Visible to the public Biblio

Found 148 results

Filters: Keyword is Heuristic algorithms  [Clear All Filters]
Juleang, Pakom, Mitatha, Somsak.  2021.  Optical Hash Function for High Speed and High Security Algorithm using Ring Resonator System. 2021 7th International Conference on Engineering, Applied Sciences and Technology (ICEAST). :160–163.
This work presents a novel security technique using the optical hash function to create a message digest algorithm in the wavelength domain. The optical devices used for high speed and high security algorithm handling comprised a PANDA ring resonator connected with an add/drop filter system. The PANDA ring resonator was introduced to access the dynamic behavior of bright-bright soliton collision within the modified add/drop filter. Outputs of the dynamic states formed key suppression as a high security application for optical cryptography. The add/drop filter was an essential device in the proposed design for optical hash function processing. Simulation outputs proved that the proposed technique obtained optical hash function in the wavelength domain for real time message digest creation. The wavelength of the data must be within 40% of the center wavelength of the system input signal. The integrity of the data was maintained by this highly secure process.
Zeng, Siping, Guo, Xiaozhen.  2021.  Research on Key Technology of Software Intellectual Property Protection. 2021 International Conference on Intelligent Transportation, Big Data & Smart City (ICITBS). :329–332.
Traditional software intellectual property protection technology improves the complexity and anti-attack ability of the program, while it also increases the extra execution cost of the program. Therefore, this paper starts with the obfuscation of program control flow in reverse engineering to provide defense strategies for the protection of software intellectual property rights. Focusing on the parsing and obfuscation of Java byte code, we implement a prototype of code obfuscation system. The scheme improves the class aggregation and class splitting algorithms, discusses the fusion methods of various independent code obfuscation technologies, and provides the description and implementation of other key module algorithms. The experimental analysis shows that the obfuscation transformation scheme in this paper not only gets higher security, but also improves the program performance to a certain extent, which can effectively protect the intellectual property rights of Java software.
Safitri, Cutifa, Nguyen, Quang Ngoc, Deo Lumoindong, Christoforus Williem, Ayu, Media Anugerah, Mantoro, Teddy.  2021.  Advanced Forwarding Strategy Towards Delay Tolerant Information-Centric Networking. 2021 IEEE 7th International Conference on Computing, Engineering and Design (ICCED). :1–5.
Information-Centric Networking (ICN) is among the promising architecture that can drive the need and versatility towards the future generation (xG) needs. In the future, support for network communication relies on the area of telemedicine, autonomous vehicles, and disaster recovery. In the disaster recovery case, there is a high possibility where the communication path is severed. Multicast communication and DTN-friendly route algorithm are becoming suitable options to send a packet message to get a faster response and to see any of the nodes available for service, this approach could give burden to the core network. Also, during disaster cases, many people would like to communicate, receive help, and find family members. Flooding the already disturbed/severed network will further reduce communication performance efficiency even further. Thus, this study takes into consideration prioritization factors to allow networks to process and delivering priority content. For this purpose, the proposed technique introduces the Routable Prefix Identifier (RP-ID) that takes into account the prioritization factor to enable optimization in Delay Tolerant ICN communication.
Guo, Siyao, Fu, Yi.  2021.  Construction of immersive scene roaming system of exhibition hall based on virtual reality technology. 2021 IEEE Conference on Telecommunications, Optics and Computer Science (TOCS). :1029–1033.
On the basis of analyzing the development and application of virtual reality (VR) technology at home and abroad, and combining with the specific situation of the exhibition hall, this paper establishes an immersive scene roaming system of the exhibition hall. The system is completed by virtual scene modeling technology and virtual roaming interactive technology. The former uses modeling software to establish the basic model in the virtual scene, while the latter uses VR software to enable users to control their own roles to run smoothly in the roaming scene. In interactive roaming, this paper optimizes the A* pathfinding algorithm, uses binary heap to process data, and on this basis, further optimizes the pathfinding algorithm, so that when the pathfinding target is an obstacle, the pathfinder can reach the nearest place to the obstacle. Texture mapping technology, LOD technology and other related technologies are adopted in the modeling, thus finally realizing the immersive scene roaming system of the exhibition hall.
Zhang, Xueling, Wang, Xiaoyin, Slavin, Rocky, Niu, Jianwei.  2021.  ConDySTA: Context-Aware Dynamic Supplement to Static Taint Analysis. 2021 IEEE Symposium on Security and Privacy (SP). :796–812.
Static taint analyses are widely-applied techniques to detect taint flows in software systems. Although they are theoretically conservative and de-signed to detect all possible taint flows, static taint analyses almost always exhibit false negatives due to a variety of implementation limitations. Dynamic programming language features, inaccessible code, and the usage of multiple programming languages in a software project are some of the major causes. To alleviate this problem, we developed a novel approach, DySTA, which uses dynamic taint analysis results as additional sources for static taint analysis. However, naïvely adding sources causes static analysis to lose context sensitivity and thus produce false positives. Thus, we developed a hybrid context matching algorithm and corresponding tool, ConDySTA, to preserve context sensitivity in DySTA. We applied REPRODROID [1], a comprehensive benchmarking framework for Android analysis tools, to evaluate ConDySTA. The results show that across 28 apps (1) ConDySTA was able to detect 12 out of 28 taint flows which were not detected by any of the six state-of-the-art static taint analyses considered in ReproDroid, and (2) ConDySTA reported no false positives, whereas nine were reported by DySTA alone. We further applied ConDySTA and FlowDroid to 100 top Android apps from Google Play, and ConDySTA was able to detect 39 additional taint flows (besides 281 taint flows found by FlowDroid) while preserving the context sensitivity of FlowDroid.
Deng, Xiaolei, Zhang, Chunrui, Duan, Yubing, Xie, Jiajun, Deng, Kai.  2021.  A Mixed Method For Internal Threat Detection. 2021 IEEE 5th Information Technology,Networking,Electronic and Automation Control Conference (ITNEC). 5:748–756.
In recent years, the development of deep learning has brought new ideas to internal threat detection. In this paper, three common deep learning algorithms for threat detection are optimized and innovated, and feature embedding, drift detection and sample weighting are introduced into FCNN. Adaptive multi-iteration method is introduced into Support Vector Data Description (SVDD). A dynamic threshold adjustment mechanism is introduced in VAE. In threat detection, three methods are used to detect the abnormal behavior of users, and the intersection of output results is taken as the final threat judgment basis. Experiments on cert r6.2 data set show that this method can significantly reduce the false positive rate.
Fattakhov, Ruslan, Loginov, Sergey.  2021.  Discrete-nonlinear Colpitts oscillator based communication security increasing of the OFDM systems. 2021 International Conference on Electrotechnical Complexes and Systems (ICOECS). :253—256.

This article reports results about the development of the algorithm that allows to increase the information security of OFDM communication system based on the discrete-nonlinear Colpitts system with dynamic chaos. Proposed system works on two layers: information and transport. In the first one, Arnold Transform was applied. The second one, transport level security was provided by QAM constellation mixing. Correlation coefficients, Shannon's entropy and peak-to-average power ratio (PAPR) were estimated.

Mukherjee, Sayak, Adetola, Veronica.  2021.  A Secure Learning Control Strategy via Dynamic Camouflaging for Unknown Dynamical Systems under Attacks. 2021 IEEE Conference on Control Technology and Applications (CCTA). :905—910.

This paper presents a secure reinforcement learning (RL) based control method for unknown linear time-invariant cyber-physical systems (CPSs) that are subjected to compositional attacks such as eavesdropping and covert attack. We consider the attack scenario where the attacker learns about the dynamic model during the exploration phase of the learning conducted by the designer to learn a linear quadratic regulator (LQR), and thereafter, use such information to conduct a covert attack on the dynamic system, which we refer to as doubly learning-based control and attack (DLCA) framework. We propose a dynamic camouflaging based attack-resilient reinforcement learning (ARRL) algorithm which can learn the desired optimal controller for the dynamic system, and at the same time, can inject sufficient misinformation in the estimation of system dynamics by the attacker. The algorithm is accompanied by theoretical guarantees and extensive numerical experiments on a consensus multi-agent system and on a benchmark power grid model.

Wang, Qibing, Du, Xin, Zhang, Kai, Pan, Junjun, Yu, Weiguo, Gao, Xiaoquan, Lin, Rihong.  2021.  Reliability Test Method of Power Grid Security Control System Based on BP Neural Network and Dynamic Group Simulation. 2021 IEEE/IAS Industrial and Commercial Power System Asia (I CPS Asia). :680—685.

Aiming at the problems of imperfect dynamic verification of power grid security and stability control strategy and high test cost, a reliability test method of power grid security control system based on BP neural network and dynamic group simulation is proposed. Firstly, the fault simulation results of real-time digital simulation system (RTDS) software are taken as the data source, and the dynamic test data are obtained with the help of the existing dispatching data network, wireless virtual private network, global positioning system and other communication resources; Secondly, the important test items are selected through the minimum redundancy maximum correlation algorithm, and the test items are used to form a feature set, and then the BP neural network model is used to predict the test results. Finally, the dynamic remote test platform is tested by the dynamic whole group simulation of the security and stability control system. Compared with the traditional test methods, the proposed method reduces the test cost by more than 50%. Experimental results show that the proposed method can effectively complete the reliability test of power grid security control system based on dynamic group simulation, and reduce the test cost.

Gainutdinov, Ilyas, Loginov, Sergey.  2021.  Increasing information security of a communication system with OFDM based on a discrete-nonlinear Duffing system with dynamic chaos. 2021 International Conference on Electrotechnical Complexes and Systems (ICOECS). :249—252.

In this work, the algorithm of increasing the information security of a communication system with Orthogonal Frequency Division Multiplexing (OFDM) was achieved by using a discrete-nonlinear Duffing system with dynamic chaos. The main idea of increasing information security is based on scrambling input information on three levels. The first one is mixing up data order, the second is scrambling data values and the final is mixing symbols at the Quadrature Amplitude Modulation (QAM) plot constellation. Each level's activities were made with the use of pseudorandom numbers set, generated by the discrete-nonlinear Duffing system with dynamic chaos.

Mohan, K. Madan, Yadav, B V Ram Naresh.  2021.  Dynamic Graph Based Encryption Scheme for Cloud Based Services and Storage. 2021 9th International Conference on Cyber and IT Service Management (CITSM). :1—4.

Cloud security includes the strategies which works together to guard data and infrastructure with a set of policies, procedures, controls and technologies. These security events are arranged to protect cloud data, support supervisory obedience and protect customers' privacy as well as setting endorsement rules for individual users and devices. The partition-based handling and encryption mechanism which provide fine-grained admittance control and protected data sharing to the data users in cloud computing. Graph partition problems fall under the category of NP-hard problems. Resolutions to these problems are generally imitative using heuristics and approximation algorithms. Partition problems strategy is used in bi-criteria approximation or resource augmentation approaches with a common extension of hyper graphs, which can address the storage hierarchy.

Xu, Jun, Zhu, Pengcheng, Li, Jiamin, You, Xiaohu.  2021.  Secure Computation Offloading for Multi-user Multi-server MEC-enabled IoT. ICC 2021 - IEEE International Conference on Communications. :1—6.

This paper studies the secure computation offloading for multi-user multi-server mobile edge computing (MEC)-enabled internet of things (IoT). A novel jamming signal scheme is designed to interfere with the decoding process at the Eve, but not impair the uplink task offloading from users to APs. Considering offloading latency and secrecy constraints, this paper studies the joint optimization of communication and computation resource allocation, as well as partial offloading ratio to maximize the total secrecy offloading data (TSOD) during the whole offloading process. The considered problem is nonconvex, and we resort to block coordinate descent (BCD) method to decompose it into three subproblems. An efficient iterative algorithm is proposed to achieve a locally optimal solution to power allocation subproblem. Then the optimal computation resource allocation and offloading ratio are derived in closed forms. Simulation results demonstrate that the proposed algorithm converges fast and achieves higher TSOD than some heuristics.

Mu, Yanzhou, Wang, Zan, Liu, Shuang, Sun, Jun, Chen, Junjie, Chen, Xiang.  2021.  HARS: Heuristic-Enhanced Adaptive Randomized Scheduling for Concurrency Testing. 2021 IEEE 21st International Conference on Software Quality, Reliability and Security (QRS). :219—230.

Concurrency programs often induce buggy results due to the unexpected interaction among threads. The detection of these concurrency bugs costs a lot because they usually appear under a specific execution trace. How to virtually explore different thread schedules to detect concurrency bugs efficiently is an important research topic. Many techniques have been proposed, including lightweight techniques like adaptive randomized scheduling (ARS) and heavyweight techniques like maximal causality reduction (MCR). Compared to heavyweight techniques, ARS is efficient in exploring different schedulings and achieves state-of-the-art performance. However, it will lead to explore large numbers of redundant thread schedulings, which will reduce the efficiency. Moreover, it suffers from the “cold start” issue, when little information is available to guide the distance calculation at the beginning of the exploration. In this work, we propose a Heuristic-Enhanced Adaptive Randomized Scheduling (HARS) algorithm, which improves ARS to detect concurrency bugs guided with novel distance metrics and heuristics obtained from existing research findings. Compared with the adaptive randomized scheduling method, it can more effectively distinguish the traces that may contain concurrency bugs and avoid redundant schedules, thus exploring diverse thread schedules effectively. We conduct an evaluation on 45 concurrency Java programs. The evaluation results show that our algorithm performs more stably in terms of effectiveness and efficiency in detecting concurrency bugs. Notably, HARS detects hard-to-expose bugs more effectively, where the buggy traces are rare or the bug triggering conditions are tricky.

Tantawy, Ashraf.  2021.  Automated Malware Design for Cyber Physical Systems. 2021 9th International Symposium on Digital Forensics and Security (ISDFS). :1—6.

The design of attacks for cyber physical systems is critical to assess CPS resilience at design time and run-time, and to generate rich datasets from testbeds for research. Attacks against cyber physical systems distinguish themselves from IT attacks in that the main objective is to harm the physical system. Therefore, both cyber and physical system knowledge are needed to design such attacks. The current practice to generate attacks either focuses on the cyber part of the system using IT cyber security existing body of knowledge, or uses heuristics to inject attacks that could potentially harm the physical process. In this paper, we present a systematic approach to automatically generate integrity attacks from the CPS safety and control specifications, without knowledge of the physical system or its dynamics. The generated attacks violate the system operational and safety requirements, hence present a genuine test for system resilience. We present an algorithm to automate the malware payload development. Several examples are given throughout the paper to illustrate the proposed approach.

Nurwarsito, Heru, Nadhif, Muhammad Fahmy.  2021.  DDoS Attack Early Detection and Mitigation System on SDN using Random Forest Algorithm and Ryu Framework. 2021 8th International Conference on Computer and Communication Engineering (ICCCE). :178—183.

Distributed Denial of Service (DDoS) attacks became a true threat to network infrastructure. DDoS attacks are capable of inflicting major disruption to the information communication technology infrastructure. DDoS attacks aim to paralyze networks by overloading servers, network links, and network devices with illegitimate traffic. Therefore, it is important to detect and mitigate DDoS attacks to reduce the impact of DDoS attacks. In traditional networks, the hardware and software to detect and mitigate DDoS attacks are expensive and difficult to deploy. Software-Defined Network (SDN) is a new paradigm in network architecture by separating the control plane and data plane, thereby increasing scalability, flexibility, control, and network management. Therefore, SDN can dynamically change DDoS traffic forwarding rules and improve network security. In this study, a DDoS attack detection and mitigation system was built on the SDN architecture using the random forest machine-learning algorithm. The random forest algorithm will classify normal and attack packets based on flow entries. If packets are classified as a DDoS attack, it will be mitigated by adding flow rules to the switch. Based on tests that have been done, the detection system can detect DDoS attacks with an average accuracy of 98.38% and an average detection time of 36 ms. Then the mitigation system can mitigate DDoS attacks with an average mitigation time of 1179 ms and can reduce the average number of attack packets that enter the victim host by 15672 packets and can reduce the average number of CPU usage on the controller by 44,9%.

Wang, Chengyan, Li, Yuling, Zhang, Yong.  2021.  Hybrid Data Fast Distribution Algorithm for Wireless Sensor Networks in Visual Internet of Things. 2021 International Conference on Big Data Analysis and Computer Science (BDACS). :166–169.
With the maturity of Internet of things technology, massive data transmission has become the focus of research. In order to solve the problem of low speed of traditional hybrid data fast distribution algorithm for wireless sensor networks, a hybrid data fast distribution algorithm for wireless sensor networks based on visual Internet of things is designed. The logic structure of mixed data input gate in wireless sensor network is designed through the visual Internet of things. The objective function of fast distribution of mixed data in wireless sensor network is proposed. The number of copies of data to be distributed is dynamically calculated and the message deletion strategy is determined. Then the distribution parameters are calibrated, and the fitness ranking is performed according to the distribution quantity to complete the algorithm design. The experimental results show that the distribution rate of the designed algorithm is significantly higher than that of the control group, which can solve the problem of low speed of traditional data fast distribution algorithm.
Chen, Huiping, Dong, Changyu, Fan, Liyue, Loukides, Grigorios, Pissis, Solon P., Stougie, Leen.  2021.  Differentially Private String Sanitization for Frequency-Based Mining Tasks. 2021 IEEE International Conference on Data Mining (ICDM). :41—50.
Strings are used to model genomic, natural language, and web activity data, and are thus often shared broadly. However, string data sharing has raised privacy concerns stemming from the fact that knowledge of length-k substrings of a string and their frequencies (multiplicities) may be sufficient to uniquely reconstruct the string; and from that the inference of such substrings may leak confidential information. We thus introduce the problem of protecting length-k substrings of a single string S by applying Differential Privacy (DP) while maximizing data utility for frequency-based mining tasks. Our theoretical and empirical evidence suggests that classic DP mechanisms are not suitable to address the problem. In response, we employ the order-k de Bruijn graph G of S and propose a sampling-based mechanism for enforcing DP on G. We consider the task of enforcing DP on G using our mechanism while preserving the normalized edge multiplicities in G. We define an optimization problem on integer edge weights that is central to this task and develop an algorithm based on dynamic programming to solve it exactly. We also consider two variants of this problem with real edge weights. By relaxing the constraint of integer edge weights, we are able to develop linear-time exact algorithms for these variants, which we use as stepping stones towards effective heuristics. An extensive experimental evaluation using real-world large-scale strings (in the order of billions of letters) shows that our heuristics are efficient and produce near-optimal solutions which preserve data utility for frequency-based mining tasks.
Shah, Priyanka, Kasbe, Tanmay.  2021.  Detecting Sybil Attack, Black Hole Attack and DoS Attack in VANET Using RSA Algorithm. 2021 Emerging Trends in Industry 4.0 (ETI 4.0). :1—7.
In present scenario features like low-cost, power-efficientand easy-to-implement Wireless Sensor Networks (WSN’s) has become one of growing prospects.though, its security issues have become a popular topic of research nowadays. Specific attacks often experience the security issues as they easily combined with other attacks to destroy the network. In this paper, we discuss about detecting the particular attacks like Sybil, Black-holeand Denial of Service (DoS) attacks on WSNs. These networks are more vulnerable to them. We attempt to investigate the security measures and the applicability of the AODV protocol to detect and manage specific types of network attacks in VANET.The RSA algorithm is proposed here, as it is capable of detecting sensor nodes ormessages transmitted from sensor nodes to the base station and prevents network from being attacked by the source node. It also improves the security mechanism of the AODV protocol. This simulation set up is performed using MATLAB simulation tool
Cui, Jie, Kong, Lingbiao, Zhong, Hong, Sun, Xiuwen, Gu, Chengjie, Ma, Jianfeng.  2021.  Scalable QoS-Aware Multicast for SVC Streams in Software-Defined Networks. 2021 IEEE Symposium on Computers and Communications (ISCC). :1—7.
Because network nodes are transparent in media streaming applications, traditional networks cannot utilize the scalability feature of Scalable video coding (SVC). Compared with the traditional network, SDN supports various flows in a more fine-grained and scalable manner via the OpenFlow protocol, making QoS requirements easier and more feasible. In previous studies, a Ternary Content-Addressable Memory (TCAM) space in the switch has not been considered. This paper proposes a scalable QoS-aware multicast scheme for SVC streams, and formulates the scalable QoS-aware multicast routing problem as a nonlinear programming model. Then, we design heuristic algorithms that reduce the TCAM space consumption and construct the multicast tree for SVC layers according to video streaming requests. To alleviate video quality degradation, a dynamic layered multicast routing algorithm is proposed. Our experimental results demonstrate the performance of this method in terms of the packet loss ratio, scalability, the average satisfaction, and system utility.
Zharikov, Alexander, Konstantinova, Olga, Ternovoy, Oleg.  2021.  Building a Mesh Network Model with the Traffic Caching Based on the P2P Mechanism. 2021 Dynamics of Systems, Mechanisms and Machines (Dynamics). :1–5.
Currently, the technology of wireless mesh networks is actively developing. In 2021, Gartner included mesh network technologies and the tasks to ensure their security in the TOP global trends. A large number of scientific works focus on the research and modeling the traffic transmission in such networks. At the same time, they often bring up the “bottle neck” problem, characteristic of individual mesh network nodes. To address the issue, the authors of the article propose using the data caching mechanism and placing the cache data straight on the routers. The mathematical model presented in the article allows building a route with the highest access speed to the requested content by the modified Dijkstra algorithm. Besides, if the mesh network cache lacks the required content, the routers with the Internet access are applied. Practically, the considered method of creating routes to the content, which has already been requested by the users in the mesh network, allows for the optimal efficient use of the router bandwidth capacity distribution and reduces the latency period.
Nurmukhametov, Alexey, Vishnyakov, Alexey, Logunova, Vlada, Kurmangaleev, Shamil.  2021.  MAJORCA: Multi-Architecture JOP and ROP Chain Assembler. 2021 Ivannikov Ispras Open Conference (ISPRAS). :37–46.
Nowadays, exploits often rely on a code-reuse approach. Short pieces of code called gadgets are chained together to execute some payload. Code-reuse attacks can exploit vul-nerabilities in the presence of operating system protection that prohibits data memory execution. The ROP chain construction task is the code generation for the virtual machine defined by an exploited executable. It is crucial to understand how powerful ROP attacks can be. Such knowledge can be used to improve software security. We implement MAJORCA that generates ROP and JOP payloads in an architecture agnostic manner and thoroughly consider restricted symbols such as null bytes that terminate data copying via strcpy. The paper covers the whole code-reuse payloads construction pipeline: cataloging gadgets, chaining them in DAG, scheduling, linearizing to the ready-to-run payload. MAJORCA automatically generates both ROP and JOP payloads for x86 and MIPS. MAJORCA constructs payloads respecting restricted symbols both in gadget addresses and data. We evaluate MAJORCA performance and accuracy with rop-benchmark and compare it with open-source compilers. We show that MAJORCA outperforms open-source tools. We propose a ROP chaining metric and use it to estimate the probabilities of successful ROP chaining for different operating systems with MAJORCA as well as other ROP compilers to show that ROP chaining is still feasible. This metric can estimate the efficiency of OS defences.
Nath, Shubha Brata, Addya, Sourav Kanti, Chakraborty, Sandip, Ghosh, Soumya K.  2021.  Container-based Service State Management in Cloud Computing. 2021 IFIP/IEEE International Symposium on Integrated Network Management (IM). :487—493.
In a cloud data center, the client requests are catered by placing the services in its servers. Such services are deployed through a sandboxing platform to ensure proper isolation among services from different users. Due to the lightweight nature, containers have become increasingly popular to support such sandboxing. However, for supporting effective and efficient data center resource usage with minimum resource footprints, improving the containers' consolidation ratio is significant for the cloud service providers. Towards this end, in this paper, we propose an exciting direction to significantly boost up the consolidation ratio of a data-center environment by effectively managing the containers' states. We observe that many cloud-based application services are event-triggered, so they remain inactive unless some external service request comes. We exploit the fact that the containers remain in an idle state when the underlying service is not active, and thus such idle containers can be checkpointed unless an external service request comes. However, the challenge here is to design an efficient mechanism such that an idle container can be resumed quickly to prevent the loss of the application's quality of service (QoS). We have implemented the system, and the evaluation is performed in Amazon Elastic Compute Cloud. The experimental results have shown that the proposed algorithm can manage the containers' states, ensuring the increase of consolidation ratio.
Jia, Yunsong.  2021.  Design of nearest neighbor search for dynamic interaction points. 2021 2nd International Conference on Big Data and Informatization Education (ICBDIE). :389—393.
This article describes the definition, theoretical derivation, design ideas, and specific implementation of the nearest query algorithm for the acceleration of probabilistic optimization at first, and secondly gives an optimization conclusion that is generally applicable to high-dimensional Minkowski spaces with even-numbered feature parameters. Thirdly the operating efficiency and space sensitivity of this algorithm and the commonly used algorithms are compared from both theoretical and experimental aspects. Finally, the optimization direction is analyzed based on the results.
Zheng, Donghua.  2021.  Dynamic data compression algorithm for wireless sensor networks based on grid deduplication. 2021 International Conference on Communications, Information System and Computer Engineering (CISCE). :178–182.
In order to improve the status monitoring and management ability of wireless sensor networks, a dynamic data compression method based on grid deduplication is proposed. Grid-based sensor node spatial positioning and big data fusion method are adopted to realize dynamic feature mining of wireless sensor network data, extract feature sequence points of wireless sensor network data, reconstruct wireless sensor network data feature space by adopting spatial grid node recombination, build a statistical detection model of dynamic feature mining of wireless sensor network data by combining grid area grouping compression method, and realize embedded fuzzy control and joint feature distributed adaptive learning. The association matching degree of wireless sensor network data is analyzed. Combining fuzzy subspace compression and big data fusion clustering, the quantitative regression analysis model of wireless sensor network data is established. The time series reorganization of wireless sensor network database is realized by index table name, index column and other information. Compressed sensing method is used in linear fusion subspace to realize data compression and adaptive detection of wireless sensor network. Constraint feature points of wireless sensor network data compression are constructed, and dynamic compression and clustering processing of wireless sensor network data are realized at constraint points. Simulation results show that the feature clustering of data compression in wireless sensor networks is better and the storage space of data is reduced.
Sargolzaei, Arman.  2021.  A Secure Control Design for Networked Control System with Nonlinear Dynamics under False-Data-Injection Attacks. 2021 American Control Conference (ACC). :2693–2699.
In a centralized Networked Control System (NCS), all agents share local data with a central processing unit that generates control commands for agents. The use of a communication network between the agents gives NCSs a distinct advantage in efficiency, design cost, and simplicity. However, this benefit comes at the expense of vulnerability to a range of cyber-physical attacks. Recently, novel defense mechanisms to counteract false data injection (FDI) attacks on NCSs have been developed for agents with linear dynamics but have not been thoroughly investigated for NCSs with nonlinear dynamics. This paper proposes an FDI attack mitigation strategy for NCSs composed of agents with nonlinear dynamics under disturbances and measurement noises. The proposed algorithm uses both learning and model-based approaches to estimate agents'states for FDI attack mitigation. A neural network is used to model uncertain dynamics and estimate the effect of FDI attacks. The controller and estimator are designed based on Lyapunov stability analysis. A simulation of robots with Euler-Lagrange dynamics is considered to demonstrate the developed controller's performance to respond to FDI attacks in real-time.