The document proposes a Fast Fault Node Recovery algorithm to enhance the lifetime of a wireless sensor network when sensor nodes fail. The algorithm is based on rerouting using grade diffusion combined with a genetic algorithm. It aims to reduce the number of replaced sensor nodes and reuse more routing paths. Simulation results show the algorithm increases active nodes by up to 8.7 times, reduces data loss by 98.8%, and reduces energy consumption by 31.1%.

1. Fast Fault Node Recovery
Algorithm for a Wireless Sensor
Network

2. ABSTRACT
 This paper proposes a fault node recovery algorithm to enhance
the lifetime of a wireless sensor network when some of the
sensor nodes shut down.
 The algorithm is based on the rerouting on grade diffusion
algorithm combined with the genetic algorithm.
 The algorithm can result in fewer replacements of sensor nodes
and more reused routing paths.
 In our simulation, the proposed algorithm increases the number
of active nodes up to 8.7 times, reduces the rate of data loss by
approximately 98.8%, and reduces the rate of energy
consumption by approximately 31.1%.

3. Existing system
 In sensor networks, each sensor node has limited wireless computational
power to process and transfer the live data to the base station or data
collection center. Therefore, to increase the sensor area and the
transmission area the wireless sensor network usually contains many sensor
nodes.
 Generally, each sensor node has a low level of battery power that cannot
be replenished. When the energy of a sensor node is exhausted, wireless
sensor network leaks will appear, and the failed nodes will not relay data to
the other nodes during transmission processing.
 Thus, the other sensor nodes will be burdened with increased transmission
processing.

4. Problem Statement:
 In sensor networks, each sensor node has limited wireless computational
power to process and transfer the live data to the base station or data collection
center.
 Therefore, to increase the sensor area and the transmission area the wireless
sensor network usually contains many sensor nodes.
 Each sensor node has a low level of battery power, the energy of a sensor node
is exhausted, wireless sensor network leaks will appear, and the failed nodes
will not relay data to the other nodes during transmission processing. Thus, the
other sensor nodes will be burdened with increased transmission processing.

5. Proposed system
 This paper proposes a fault node recovery (FNR) algorithm to
enhance the lifetime of a wireless sensor network (WSN) when
some of the sensor nodes shut down, either because they no longer
have battery energy or they have reached their
operational threshold.
 Using the FNR algorithm can result in fewer replacements of sensor
nodes and more reused routing paths. Thus, the algorithm not only
enhances the WSN lifetime but also reduces the cost of replacing
the sensor nodes.
 The algorithm proposed in this paper is based on the GD algorithm,
with the goal of replacing fewer sensor nodes that are inoperative or
have depleted batteries, and of reusing the maximum number of
routing paths.

6. Scope
 This paper proposes a fault node recovery (FNR) algorithm to enhance the
lifetime of a wireless sensor network (WSN) when some of the sensor
nodes shut down, either because they no longer have battery energy or they
have reached their operational threshold.
 Using the FNR algorithm can result in fewer replacements of sensor nodes
and more reused routing paths. Thus, the algorithm not only enhances the
WSN lifetime but also reduces the cost of replacing the sensor nodes.

7. IMPLEMENTATION
◦ Implementation is the stage of the project when the theoretical design is turned out into a
working system. Thus it can be considered to be the most critical stage in achieving a
successful new system and in giving the user, confidence that the new system will work and
be effective.
 The implementation stage involves careful planning, investigation of
the existing system and it’s constraints on implementation, designing of
methods to achieve changeover and evaluation of changeover methods.

8. Block diagram

9. MODULE
 Directed Diffusion Algorithm
 Grade Diffusion Algorithm
 Fast rerouting Algorithm
 Fault node recovery (FNR) algorithm

10. Directed Diffusion Algorithm
 The goal of the DD algorithm is to reduce the data relay transmission counts for power
management. The DD algorithm is a query-driven transmission protocol. The collected
data is transmitted only if it matches the query from the sink node.
 In the DD algorithm, the sink node provides the queries in the form of attribute-value
pairs to the other sensor nodes by broadcasting the query packets to the whole network.
Subsequently, the sensor nodes send the data back to the sink node only when it fits the
queries

11. Grade Diffusion Algorithm
• To solve the power consumption and transmission routing problems in wireless sensor networks
• The first step is to assign the grade for the sensor nodes and to update the routing table for each
node.
• The data transmission takes place from higher grade nodes to lower grade nodes and hence it is
named as grade diffusion algorithm
• the GD algorithm increases the sensor node’s lift time and the sensor node’s transmission effect.
Moreover, the sensor node can save some backup nodes to reduce the energy for the re-looking
routing by GD algorithm in case the sensor node’s routing is broken.
• The Grade Diffusion algorithm overcomes the disadvantages of Direct Diffusion algorithm by
broadcasting the neighbors to only first neighbor set. After that nodes are picked up based on hop
count or rules and the amount of RREQ exchange is reduced hence amount of power required is
less as compared to Direct Diffusion.

12. Steps
 First, the sink node broadcasts the grade-creating package with the grade value of
zero. A grade value of one means that the sensor node receiving this grade-creating
package transmits data to the sink node requires only one hop
 The sensor nodes "b" and "c" receive a grade-creating package with a grade value of
one from sink node "a".
 The sensor nodes "b" and "c" increase the grade value of the grade-creating package
to two and broadcast the modified grade-creating package.
 Sensor nodes "d" ,"e" and "f" increase the grade value of the grade-creating package
to three and broadcast the modified package again.
 Finally, sensor nodes "g" and "h" increase the grade value of the grade-creating
package to four and broadcast the grade-creating package But the sensor nodes
discard the package because the grade value of the sensor nodes surrounding nodes
"g" and "h" are less than four.

14. SYSTEM ARCHITECTURE

15. System Configuration:-
 H/W System Configuration:-
 Processor - Pentium –III
 Speed - 1.1 Ghz
 RAM - 256 MB(min)
 Hard Disk - 20 GB
 Floppy Drive - 1.44 MB
 Key Board - Standard Windows
Keyboard
 Mouse - Two or Three Button
Mouse
 Monitor - SVGA
 S/W System Configuration:-
 Operating System : Windows XP / 7
 Front End : JAVA,RMI, SWING.

16. ADVANTAGES OF PROPOSED
SYSTEM
 Increases the WSN lifetime by replacing some of the sensor nodes that are
not functioning
 Enhancing the active nodes and reducing the data losses.