Current Issue : January - March Volume : 2020 Issue Number : 1 Articles : 5 Articles
Herein, the problem of target tracking in wireless sensor networks (WSNs) is investigated\nin the presence of Byzantine attacks. More specifically, we analyze the impact of Byzantine attacks\non the performance of a tracking system. First, under the condition of jointly estimating the target\nstate and the attack parameters, the posterior Cramer-Rao lower bound (PCRLB) is calculated. Then,\nfrom the perspective of attackers, we define the optimal Byzantine attack and theoretically find a\nway to achieve such an attack with minimal cost. When the attacked nodes are correctly identified\nby the fusion center (FC), we further define the suboptimal Byzantine attack and also find a way to\nrealize such an attack. Finally, in order to alleviate the negative impact of attackers on the system\nperformance, a modified sampling importance resampling (SIR) filter is proposed. Simulation\nresults show that the tracking results of the modified SIR filter can be close to the true trajectory of\nthe moving target. In addition, when the quantization level increases, both the security performance\nand the estimation performance of the tracking system are improved....
In directional sensor networks research, target event detection is currently an active research area, with applications in underwater\ntarget monitoring, forest fire warnings, border areas, and other important activities. Previous studies have often discussed target\ncoverage in two-dimensional sensor networks, but these studies cannot be extensively applied to three-dimensional networks.\nAdditionally, most of the previous target coverage detection models are based on a circular or omnidirectional sensing model.\nMore importantly, if the directional sensor network does not design a better coverage algorithm in the coverage-monitoring\nprocess, its nodesâ?? energy consumption will increase and the network lifetime will be significantly shortened. With the objective\nof addressing three-dimensional target coverage in applications, this study proposes a dynamic adjustment optimisation\nalgorithm for three-dimensional directional sensor networks based on a spherical sector coverage model, which improves the\nlifetime and coverage ratio of the network. First, we redefine the directional nodesâ?? sensing model and use the three-dimensional\nVoronoi method to divide the regions where the nodes are located. Then, we introduce a correlation force between the target\nand the sensor node to optimise the algorithmâ??s coverage mechanism, so that the sensor node can accurately move to the\nspecified position for target coverage. Finally, by verifying the feasibility and accuracy of the proposed algorithm, the simulation\nexperiments demonstrate that the proposed algorithm can effectively improve the network coverage and node utilisation....
Applying parachutes-deployed Wireless Sensor Network (WSN) in monitoring the\nhigh-altitude space is a promising solution for its effectiveness and cost. However, both the\nhigh deviation of data and the rapid change of various environment factors (air pressure, temperature,\nwind speed, etc.) pose a great challenge. To this end, we solve this challenge with data compensation\nin dynamic stress measurements of parachutes during the working stage. Specifically, we construct a\ndata compensation model to correct the deviation based on neural network by taking into account a\nvariety of environmental parameters, and name it as Data Compensation based on Back Propagation\nNeural Network (DC-BPNN). Then, for improving the speed and accuracy of training the DC-BPNN,\nwe propose a novel Adaptive Artificial Bee Colony (AABC) algorithm. We also address its stability of\nsolution by deriving a stability bound. Finally, to verify the real performance, we conduct a set of real\nimplemented experiments of airdropped WSN....
In the process of resolving domain names to IP addresses, there exist complex dependence relationships between domains and\nname servers. This paper studies the impact of the resolution dependence on the DNS through constructing a domain name\nresolution network based on large-scale actual data. The core nodes of the resolution network are mined from different perspectives\nby means of four methods. Then, both core attacks and random attacks on the network are simulated for further\nvulnerability analysis.The experimental results show that when the top 1% of the core nodes in the network are attacked, 46.19% of\nthe domain names become unresolved, and the load of the residual network increases by nearly 195%, while only 0.01% of domain\nnames fail to be resolved and the load increases with 18% in the same attack scale of the random mode. For these key nodes, we\nneed to take effective security measures to prevent them from being attacked. The simulation experiment also proves that the\nresolution network is a scale-free network, which exhibits robustness against random failure and vulnerability against intentional\nattacks. These findings provide new references for the configuration of the DNS....
Routing remains a most challenging task in sensor networks because of constrained resources like battery power, processing, and\nmemory. Many energy efficiency techniques for the sensor networks have been proposed, among which hierarchical routing is\nconsidered the most energy-efficient and extended network lifetime technique. This technique has a lesser number of transmissions\nin the network. On the contrary, zone-based routing claims lesser control and routing overhead on the overall network\nlifetime. In this research, a simulation-based comparison of zone-based routing with static clustering hierarchical routing is\nconducted. The simulation results show that the zone-based routing outperforms hierarchical routing with static clustering in\nterms of energy efficiency, network lifetime, and throughput....
Loading....