Node Recovery and Forward Node Move Algorithm for Network Lifetime Enhancement
Deepak V Biradar1, K.R. Nataraj2

1Deepak V Biradar, Ph.D, Research Scholar, Jain University, Bangalore, (Karnataka), India.
2Dr. K.R. Nataraj, Professor, Department of ECE, SJBIT, Bangalore, (Karnataka), India.
Manuscript received on 10 February 2019 | Revised Manuscript received on 23 February 2019 | Manuscript Published on 04 March 2019 | PP: 517-529 | Volume-7 Issue-5S2 January 2019 | Retrieval Number: ES2094017519/19©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: Wireless Sensor Networks are used for wide variety of applications ranging from monitoring of weather, enemy vehicles across the borders. The critical activities require the nodes to be used for a longer period of time and whenever nodes lose their energy network must be able to recover or replace nodes over a period of time. Before transmitting the data multiple routes are found and then a route is chosen which has lowest distance or end to end delay and high residual energy which affect the life time ratio in the network. The main cause for life time expiring at the faster rate is improper selection of forward node and second important cause occurs if all neighbours are dead. The proposed method performs the Classification of neighbours into super healthy and non healthy nodes and picks the best node which has the highest residual energy. The proposed method also performs the relocation of forward node and recovery of dead nodes to improve network lifetime.
Keywords: WSN, Residual Energy, Forward Node and Recovery, Network Lifetime.
Scope of the Article: Algorithm Engineering