Energy Efficient Model for Recovery from Multiple Nodes Failure in Wireless Sensor Networks

Abstract

Connectivity among deployed sensor nodes in wireless sensor network (WSN) is essential for collection and transmission of sensed data. In harsh environmental conditions, it is difficult to maintain the network connectivity in case of failures of participating nodes, that results disjoint partitions of the network. In this paper, an attempt has been made for WSNs, to mitigate both connectivity and coverage loss for partitioned network in energy-efficient manner. In the proposed model, relay nodes have been used as anchor node for the deployed sensor nodes. A heuristic is proposed for relay nodes placement in this work, because finding minimum number of relay nodes required covering a network is known NP-hard problem. The proposed model is divided into two phases: intra-partition phase and inter-partition phase. In the intra-partition phase, the redundant nodes spread towards the boundary of the partitions and spreading gradually increases the coverage of each partition. The nodes are moved in iterations up to the representative area of relay nodes. In the inter-partition phase, a game theoretic approach is proposed to restore connectivity between partitions obtained from intra-partition phase. The proposed model is experimentally analyzed and evaluated through simulations and outperforms when compared with existing algorithms.