On Connectivity and Energy Efficiency for Sleeping-Schedule-Based Wireless Sensor Networks

PINC: Pickup Non-Critical Node Based k-Connectivity Restoration in Wireless Sensor Networks

A Wireless Sensor Network (WSN) is connected if a communication path exists among each pair of sensor nodes (motes). Maintaining reliable connectivity in WSNs is a complicated task, since any failure in the nodes can cause the data transmission paths to break. In a k-connected WSN, the connectivity survives after failure in any k-1 nodes; hence, preserving the k-connectivity ensures that the WSN can permit k-1 node failures without wasting the connectivity. Higher k values will increase the reliability of a WSN against node failures. We propose a simple and efficient algorithm (PINC) to accomplish movement-based k-connectivity restoration that divides the nodes into the critical, which are the nodes whose failure reduces k, and non-critical groups. The PINC algorithm pickups and moves the non-critical nodes when a critical node stops working. This algorithm moves a non-critical node with minimum movement cost to the position of the failed mote. The measurements obtained from the testbed of real IRIS motes and Kobuki robots, along with extensive simulations, revealed that the PINC restores the k-connectivity by generating optimum movements faster than its competitors.

An Energy Model Using Sleeping Algorithms for Wireless Sensor Networks under Proactive and Reactive Protocols: A Performance Evaluation

The continuous evolution of the Internet of Things (IoT) makes it possible to connect everyday objects to networks in order to monitor physical and environmental conditions, which is made possible due to wireless sensor networks (WSN) that enable the transfer of data. However, it has also brought about many challenges that need to be addressed, such as excess energy consumption. Accordingly, this paper presents and analyzes wireless network energy models using five different communication protocols: Ad Hoc On-Demand Distance Vector (AODV), Multi-Parent Hierarchical (MPH), Dynamic Source Routing (DSR), Low Energy Adaptive Clustering Hierarchy (LEACH) and Zigbee Tree Routing (ZTR). First, a series of metrics are defined to establish a comparison and determine which protocol exhibits the best energy consumption performance. Then, simulations are performed and the results are compared with real scenarios. The energy analysis is conducted with three proposed sleeping algorithms: Modified Sleeping Crown (MSC), Timer Sleeping Algorithm (TSA), and Local Energy Information (LEI). Thereafter, the proposed algorithms are compared by virtue of two widely used wireless technologies, namely Zigbee and WiFi. Indeed, the results suggest that Zigbee has a better energy performance than WiFi, but less redundancy in the topology links, and this study favors the analysis with the simulation of protocols with different nature. The tested scenario is implemented into a university campus to show a real network running.

Adaptive Consensus-Based Unscented Information Filter for Tracking Target with Maneuver and Colored Noise

Distributed state estimation plays a key role in space situation awareness via a sensor network. This paper proposes two adaptive consensus-based unscented information filters for tracking target with maneuver and colored measurement noise. The proposed filters can fulfill the distributed estimation for non-linear systems with the aid of a consensus strategy, and can reduce the impact of colored measurement noise by employing the state augmentation and measurement differencing methods. In addition, a fading factor that shrinks the predicted information state and information matrix can suppress the impact of dynamical model error induced by target maneuvers. The performances of the proposed algorithms are investigated by considering a target tracking problem using a space-based radar network. This shows that the proposed algorithms outperform the traditional consensus-based distributed state estimation method in aspects of tracking stability and accuracy.