πŸ“ž +91-7667918914 | βœ‰οΈ ijarcce@gmail.com
International Journal of Advanced Research in Computer and Communication Engineering
International Journal of Advanced Research in Computer and Communication Engineering A monthly Peer-reviewed & Refereed journal
ISSN Online 2278-1021ISSN Print 2319-5940Since 2012
IJARCCE adheres to the suggestive parameters outlined by the University Grants Commission (UGC) for peer-reviewed journals, upholding high standards of research quality, ethical publishing, and academic excellence.
← Back to VOLUME 3, ISSUE 5, MAY 2014

Fault Node Identification and Route Recovery in Distributed Sensor Networks

PAVITHRA B RAJ, R SRINIVASAN PG Student, Department of Computer Science & Engineering, M.S.Ramaiah Institute of Technology, Bangalore, India Professor, Department of Computer Science & Engineering, M.S.Ramaiah Institute of Technology, Bangalore, India

πŸ‘ 50 viewsπŸ“₯ 0 downloads
Share: 𝕏 f in ✈ βœ‰
Abstract: In this paper we propose a fault node recovery algorithm in order to enhance the lifetime of a wireless sensor network when some of the sensor nodes shut down. A wireless sensor network (WSN) often contains hundreds or thousands of sensor nodes equipped with sensing, computing, and communication devices such as short-range communication devices over wireless channels. These nodes may be distributed over a large area. The sensor nodes in WSNs equipped with batteries for their energy source, but it is inconvenient to recharge or replace batteries because of the sudden giving off energy. Hence, maximizing the lifetime of the network through minimizing the energy is an important challenge in WSN. The algorithm is based on the combination of grade diffusion algorithm and the genetic algorithm. In the current approach, a route discovery approach is proposed which reduces amount of power consumption and number of nodes becoming obsolete (dead) will be less as compared to Grade Diffusion algorithm. The proposed algorithm will also determine set of nodes known as β€œgrades” which has two values namely 0 or 1. Each node will become 1 if battery is greater than threshold otherwise it will be 0. This process of finding the set of nodes whose battery power is less than threshold is called Fault Node Determination. The nodes will be replaced with new nodes of same node id this process is called Fault Node Recovery. The FNR algorithm replaces the deactivated sensor nodes and uses more reused routing paths. In the simulation the FNR algorithm reduces the packet loss rate by approximately 97% and reduces the rate of energy consumption by 70-80%.

Keywords: Fault Node Recovery (FNR) algorithm, Genetic algorithm, Grade diffusion algorithm, Wireless Sensor Networks (WSN)

How to Cite:

[1] PAVITHRA B RAJ, R SRINIVASAN PG Student, Department of Computer Science & Engineering, M.S.Ramaiah Institute of Technology, Bangalore, India Professor, Department of Computer Science & Engineering, M.S.Ramaiah Institute of Technology, Bangalore, India, β€œFault Node Identification and Route Recovery in Distributed Sensor Networks,” International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE)

Creative Commons License This work is licensed under a Creative Commons Attribution 4.0 International License.