An Efficient Cut Recovery Algorithm Using Particle Swam optimization for WSN

Abstract

The two important task of the sensor nodes in WSNs are sensing the environment and forwarding the packets among other nodes. When a cut node is identified in the network, the forwarded data can be rerouted through different path, but the “sensing” function cannot be done. This will lead to loss of precious data which is to be gained by the network from the environment. So the cut node should be recovered immediately after the failure of a node. A Backup node based cut recovery algorithm (BNCR) is proposed to recover the cut node. In this paper back up nodes are selected by using Particle Swarm optimization algorithm. The nodes which is having maximum coverage and at one hop distance to all other nodes in the cluster is selected as backup node. Initially this backup node will be in sleep mode. Once the cut is detected, the cluster head checks for the availability of back up nodes. If back up nodes are available, it will be activated and plays the role of the cut node. If back up nodes are not available at one hop distance, mobile nodes will be initiated by the base station to recover the cut nodes. This algorithm increases the lifetime of the Wireless Sensor Networks