A Hierarchical Scheduling Scheme in WSNs Based on Node-Failure Pretreatment

Abstract

One of the most important challenges in designing wireless sensor networks is how to recover a broken network within a very short time as the active nodes are failed or out-of-energy. Focusing on this problem, a hierarchical scheduling scheme based on node-failure pretreatment is proposed, in which the global optimization method is used to find the minimum connected tree and the local multilayer recovery algorithm is used to find a candidate sensor node instead of the failed one. Three highlights of this scheme are as follows: (1) The importance of sensor nodes is defined in terms of their locations in minimum connected tree and coverage acreage. (2) The neighborhood radius of failed sensor node varies with its importance, and then its candidate-node set is dynamically constructed. (3) A novel multilayer recovery strategy including node recovery and regional recovery is presented. Simulation results show that hierarchical scheduling scheme finds the optimal candidate sensor node in less time to make the repaired network with lowest energy consumption. Though the less sensor nodes are activated, the network lifetime is slightly shorter. Moreover, this scheme can be applied in the problem that the communication radius of sensor node is less than two times of its sensing radius.

A New Topology Control Algorithm in Software Defined Wireless Rechargeable Sensor Networks

“…Please note that the node failure is a common phenomenon in WSNs. Thus, when we delete nodes, we need to keep some nodes as backup [42]. However, in this work, we only study the minimum number of nodes required to finish the topology control, i.e., the situation regarding the backup nodes is not considered in this work.…”