Modeling and analyzing cascading dynamics of the clustered wireless sensor network

分簇式无线传感器网络的级联动力学建模与分析

Reliability Engineering & System Safety, Volume 186, June 2019, Pages 1-10

Xiuwen Fu, Haiqing Yao, Yongsheng Yang

摘要：Although some progress has been made in studying the invulnerability of wireless sensor networks (WSNs) against cascading failures, they only consider the impact of network topology on network invulnerability, and do not consider the impact of routing protocols, which makes these studies unable to correctly reflect the traffic characteristics of WSNs. In this work, we construct a cascading model for clustered WSN and proposed a congestion-aware routing recovery mechanism. In this model, the load function is defined on each node according to the real-time number of data packets, and the overload function is defined on the basis of the congestion state of each node. The overloaded node can recover after a certain time delay, instead of being deleted permanently from the network. We analyzed the impact of key parameters and evaluate the performance of several typical clustered routing protocols from the perspective of cascading invulnerability. The simulation results show that the network invulnerability is positively correlated with overload tolerance coefficient and negatively correlated with congestion tolerance coefficient, and the extension of recovery time can aggravate the fluctuation of the cascading process. In addition, balancing the cluster size and putting the sink node near the center of the deployment area can help the network reduce the risks of cascading failures. By introducing routing recovery mechanism into existing clustered routing protocols, the network is able to recover in a few steps.

Distributed joint sensor registration and target tracking via sensor network

基于传感器网络的分布式多传感器配准及目标跟踪

Information Fusion, Volume 46, March 2019, Pages 218-230

Lin Gao, Giorgio Battistelli, Luigi Chisci, Ping Wei

摘要：This paper deals with distributed registration of a sensor network for target tracking in the presence of false and/or missed measurements. Each sensor acquires measurements of the target position in local coordinates, having no knowledge about the relative positions (referred to as drift parameters) of its neighboring nodes. A distributed Bernoulli filter is run over the network to compute in each node a local posterior target density. Then a suitable cost function, expressing the discrepancy between the local posteriors in terms of averaged Kullback–Leibler divergence, is minimized with respect to the drift parameters for sensor registration purposes. In this way, a computationally feasible optimization approach for joint sensor registration and target tracking is devised. Finally, the effectiveness of the proposed approach is demonstrated through simulation experiments on both tree networks and networks with cycles, as well as with both linear and nonlinear sensors.

Self-calibration methods for uncontrolled environments in sensor networks: A reference survey

非可控环境下传感器网络的自标定方法：文献综述

Ad Hoc Networks, Volume 88, 15 May 2019, Pages 142-159

Jose M. Barcelo-Ordinas, Messaoud Doudou, Jorge Garcia-Vidal, Nadjib Badache

摘要：Growing progress in sensor technology has constantly expanded the number and range of low-cost, small, and portable sensors on the market, increasing the number and type of physical phenomena that can be measured with wirelessly connected sensors. Large-scale deployments of wireless sensor networks (WSN) involving hundreds or thousands of devices and limited budgets often constrain the choice of sensing hardware, which generally has reduced accuracy, precision, and reliability. Therefore, it is challenging to achieve good data quality and maintain error-free measurements during the whole system lifetime. Self-calibration or recalibration in ad hoc sensor networks to preserve data quality is essential, yet challenging, for several reasons, such as the existence of random noise and the absence of suitable general models. Calibration performed in the field, without accurate and controlled instrumentation, is said to be in an uncontrolled environment. This paper provides current and fundamental self-calibration approaches and models for wireless sensor networks in uncontrolled environments.

Data censoring with network lifetime constraint in wireless sensor networks

基于网络寿命约束的无线传感器网络数据删失

Digital Signal Processing, Volume 92, September 2019, Pages 73-81

Liu Yang, Hongbin Zhu, Haifeng Wang, Kai Kang, Hua Qian

摘要：In wireless sensor networks (WSNs), senor nodes are usually battery-powered with limited energy budget. The network lifetime is directly related to the energy consumption of each node. Online censoring is an effective approach to reduce the overall energy consumption by only transmitting statistical informative data. However, the network lifetime is not proportionally extended with online censoring, since individual sensor may still suffer from energy shortage due to frequent transmission of informative data or transmission over long distance. In this paper, a parameters estimation problem is considered in WSNs, where the goal is to minimize the estimation error under the network lifetime constraint. Two censoring algorithms are developed, which allow sensor nodes to make decisions locally on whether to transmit the sampled data. The proposed algorithms can extend the network lifetime with little performance loss. Simulation results validate their effectivenesses.

Design of network coding based reliable sensor networks

基于网络编码的可靠传感器网络设计

Ad Hoc Networks, Volume 91, August 2019, Article 101870

E. AL-Hawri, N. Correia, A. Barradas

摘要：Network coding can be very useful in achieving a balance between energy efficiency and end-to-end packet error in sensor networks, particularly if only a subset of the nodes act as encoding nodes. In this article, a mathematical model and a heuristic algorithm are proposed to plan for the best placement of encoding nodes while ensuring reliability. These approaches are also able to address scenarios where sensor networks, using different gateways, are federated. In this case a distributed storage system is required to ensure the recovery of packets when related coded packets arrive to the different gateways. The experimental results show that the adequate number and placement of encoding nodes can be effectively determined, significantly enhancing the performance of constrained sensor networks using network coding.

Target coverage in random wireless sensor networks using cover sets

基于覆盖集的随机无线传感器网络的目标覆盖

Journal of King Saud University - Computer and Information Sciences, In press, corrected proof, Available online 24 May 2019

Anvesha Katti

摘要：There are numerous coverage algorithms which efficiently monitor targets in sensor networks by dividing the sensor network into cover sets where each cover monitors all the targets. Creating maximum number of cover sets is a NP Complete problem and therefore problems providing subprime solutions have been proposed. In this paper we propose a novel and energy efficient target coverage algorithm that produces disjoint as well as non-disjoint cover sets. Our proposed solution along with generating cover sets for monitoring targets also gives the energy optimized minimum path from sink to the sensor node and from cover set to the sink. Our algorithm keeps a track of the number of targets a sensor is monitoring along with the energy remaining to find a path which is energy optimized to increase the lifetime of the sensor network. Through simulations, we have shown that our proposed algorithm outperforms similar algorithms found in literature. The increased network lifetime provided by energy optimized path and energy efficient cover sets makes our algorithm desirable for a wider range of applications.