International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 3

ISSN: 2321-8169
1361 - 1366

_______________________________________________________________________________________________

Survey on Faulty Node Detection and Recovery Algorithm for WSN

Shinde Kishor Shankar
DGOI, FOE, Pune
Department of Computer Engineering
Pune, India
e-mail: kishor4shinde@gmail.com

Gaikwad Supriya Rajendra

DGOI, FOE, Pune
Department Of Computer Engineering
Pune, India
e-mail: gsupriya71@yahoo.com

Khune Amol Ashok

DGOI, FOE, Pune
Department of Computer Engineering
Pune, India
e-mail: anmolkhune21@gmail.com

Ghadage Anil Nanaso

DGOI, FOE, Pune
Department Of Computer Engineering
Pune, India
e-mail: anilghadage96@gmail.com

Abstract In Faulty Node Detection and Recovery Algorithm for WNS critical problems like fault tolerance created. Earlier fault toleran ce
mechanism consume significant extra energy to detect and recover from the failure or having additional hardware and software resources.
.Lifetime of sensor node is enhanced because of using diffusion algorithm combined with the genetic algorithm. When some node get faulty in
network then this algorithm is useful to avoid performance related data transfer. Wireless sensor networks are having tendency to fail of sensor,
due to the energy depletion, failure of hardwares, conditions of network environment.
We sure that that type of algorithm used then result is replacements of sensor nodes and more reused routing paths. Time for data transfer is
depend on active nodes thats why we detect a routing path with faulty node. Power consumption is affect the hierarchy of active nodes thats
why data is not transferred surely. In this proposed algorithm reduces the rate of data loss by approximately 98.8%, and reduces the rate of
energy consumption by approximately 31.1%.
Keywords-component; Wireless Sensor Network (WSN), Grade Diffusion (GD), Directed Diffusion (DD) Algorithm, Genetic Algorithm (GA),
Graph Based Genetic Algorithm (GB-GA), Ladder Diffusion Ant Colony Optimization (LDACO) Algorithm, A Reduce Identical Composite
Event Transmission (RIET) Algorithm.

__________________________________________________*****_________________________________________________
I. INTRODUCTION
In Faulty Node Recovery Algorithm Using WNS critical
problems like fault tolerance created. Earlier fault tolerance
mechanism consumes significant extra energy to detect and
recover from the failure or having additional hardware and
software resources. Lifetime of sensor node is established
because of using diffusion algorithm combined with the
genetic algorithm. When some node get faulty in network
then this algorithm is useful to avoid performance related
data transfer. Wireless Sensor Network having number of
sensor node that node having same advanced in processor,
memory and radio technology. It is small and cheap node
capable for sensing communication. In Wireless Sensor
Network Directed Diffusion Algorithm [1],[11],[15] act as
routing protocol or it user for communication for sensor
node, how message or data can flow source to sink. 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.

Fig 1: Typical Wireless sensor Network.

II. RELATED WORK
We Study Followings techniques for WSN. Traditional
techniques to sensor network routing including the Directed
Diffusion Algorithm [1],[11],[15], Grade Diffusion [1],[8],
Genetic Algorithms [1],[5], Graph Based Genetic Algorithm
[5], Ladder Diffusion Ant Colony Optimization Algorithm
[7]. These optimization will ultimately enhance the WSN
lifetime and reduce sensor node replacement cost.

1361
IJRITCC | March 2015, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 3

ISSN: 2321-8169
1361 - 1366

_______________________________________________________________________________________________
A.

Directed Diffusion Algorithm.

A series of routing algorithms [1],[11], [15] for wireless

device networks have been planned in recent geezer hood. C.
Intanagonwiwat et al. presented the Directed Dispersion (DD)
rule [1], [10] in 2003. The content of the DD rule is to limit
the aggregation passage coefficient counts for cognition
management. The DD rule is a query-driven transmittal
protocol. The unanimous collection is transmitted only if it
matches the query from the imbed node. In the DD rule, the
lapse symptom provides the queries in the gathering of
attribute-value pairs to the other sensor nodes by medium the
ask packets to the whole meshing. Later, the device nodes
transfer the collection wager to the depression client exclusive
when it fits the queries.
A.

Grade Diffusion Algorithm

H. C. Shih et al. presented the Grade Diffusion (GD)

algorithm [8] in 2012 to improve the ladder diffusion
algorithm using ant colony optimization (LD-ACO) for
wireless sensor networks [7]. The GD algorithm not only
creates the routing for each sensor node but also identifies a
set of neighbor nodes to reduce the transmission loading.
Each sensor node can select a sensor node from the set of
neighbor nodes when its grade table lacks a node able to
perform the relay. The GD algorithm can also record some
information regarding the data relay. Then, a sensor node
can select a node with a lighter loading or more available
energy than the other nodes to perform the extra relay
operation. That is, the GD algorithm updates the routing
path in real time, and the event data is thus sent to the sink
node quickly and correctly. Whether the DD or the GD
algorithm is applied, the grade creating packages or
interested query packets must first be broadcast. Then, the
sensor nodes transfer the event data to the sink node,
according to the algorithm, when suitable events occur. The
sensor routing paths are shown in Fig No. 2. Routing Path
[10]

In this case interest is reach to source node it

generate gradients notice that every pair of neighboring
node establishes a gradient toward each other.
3. Data Propagation.
A sensor node that is within specified rest
processes to save power sensor are off until tasked
Furthermore the intensity of signal amplitude measure the
intensity of the sampled waveform.
B. Genetic Algorithms.
Genetic Algorithms (GAs) are adaptive heuristic search
algorithm based on the evolutionary ideas of natural
selection and genetics. As such they represent an intelligent
exploitation of a random search used to solve optimization
problems. Although randomised, GAs are by no means
random, instead they exploit historical information to direct
the search into the region of better performance within the
search space. The basic techniques of the GAs are designed
to simulate processes in natural systems necessary for
evolution; especially those follow the principles first laid
down by Charles Darwin of "survival of the fittest. Since
are in nature, competition among individuals for scanty
resources results in the fittest individuals dominating over
the weaker ones.
1. Initialization
In the initialization stage, the genetic algorithm created
chromosomes, and each chromosome is a supposed bleach.
The numerate of chromosomes is settled according to the
assemblage size, which is definite by the human. Each
chromosome is a compounding whitener, and the
chromosome size is the product of device nodes that are
depleted or not active. The elements in the genes are either 0
or 1. A 1 substance the client should be replaced and a 0
agency that the thickening module not be replaced. Show in
Fig No. 3 Represent Chromosome [1].

Fig.2. Routing path [10]

1.

Interest:
Sink node broadcasts an interest message to each of
its neighbor. This initial interest contains the specified rest
and duration attributes, but it contains much longer interval
attribute. Now this interest may be thought of as exploratory
every node maintains an interest cache. After receiving an
interest node may decide to resend interest to some subset of
neighbors. The simplest alternative is to rebroadcast the
interest to all neighbors.
2. Gradient.

Fig3. Represent chromosome [1].

2. Evaluation
In this step, fitness value is calculate by using fitness
function and the parameters of fitness function are the
chromosome genes However we cannot put chromosome
genes directly into FNR algorithm, because of chromosome
genes simply show weather node should be replace. In the
FNR algorithm, goal is reuse most routing path with less
1362

IJRITCC | March 2015, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 3

ISSN: 2321-8169
1361 - 1366

_______________________________________________________________________________________________
sensor node replace. Hence the number of routing path is
available and some non-functioning sensor node replaces
and calculates Fitness function show in below. (1)
(1)
In (1):
Ni = the number of replaced sensor nodes and their grade
value at i.
Pi = the number of re-usable routing paths from sensor
Nodes with their grade value at i .
T N = total number of sensor nodes in the original WSN.
T P = total number of routing paths in the original WSN.
In (1), a high fitness value is sought because the WSN
Is looking for the most available routing paths and the least
number of replaced sensor nodes.
3. Selection
The selection step will eliminate the chromosomes with the
lowest fitness values. We use the elitism strategy and keep
the half of the chromosomes with better fitness values and
put them in the mating plash. The worse chromosomes will
be deleted, and new chromosomes are made to replace them
after the crossover step. Fig. No. 5. shows selection stage
[1].

Fig. No. 4. Selection Step [1].

4. Crossover
The crossover step is used in the genetic algorithm to
change the personal chromosome. In this algorithm, we use
the one-point crossover strategy to create new
chromosomes, as shown in Fig. No. 5. Crossover step [1].

Fig. No.5. Crossover step [1].

One crossover point will be selected, binary string from
beginning of chromosome to the crossover point is copied
from one parent, and the rest is copied from the second
parent.

5. Mutation
The mutation step can introduce traits not found in the
original individuals and prevents the GA from converging
too very fast. In this algorithm, we simply flip a gene
randomly in the chromosome, as shown in Fig. No. 6.
Mutation step [1].

Fig 6 Mutation step [1].

The chromosome with the best fitness value is the solution
after the process. The FNR algorithm will replace the sensor
nodes in the chromosome with genes of 1 to extend the
WSN lifetime.
C. Ladder Diffusion Ant-Colony Optimization
Dorigo et al. [1, 47, 12] proposed ACO in 1997, which
imitates the behavior of ant colonies as ants search for the
shortest path from their nest to the food source. The method
was developed to solve the traveling salesman problem
(TSP). Ladder diffusion algorithm that with ladder diffusion
with ACO in order to minimize
Power consumption are presented we propose the ladder
diffusion algorithm to identify routes from sensor nodes to
the sink node and avoid the generation of circle routes using
the ladder diffusion process. The LD algorithm is fast and
completely creates the ladder table in each sensor node
based on the entire wireless sensor network by issuing the
ladder create packet that is created from the sink node.
D. Graph Based Genetic Algorithm.
Implementation of genetic algorithm for instrumentation
purpose are presented in this paper. The GA constitutes an
initialization module of a decision support system for sensor
network design. The method development entitled the
definition of the individuals representation as well as the
design of a graph based fitness function, along with the
formulation of several other ad hoc implemented features.
E. Ladder Diffusion Ant Colony Optimization
First, the sink node broadcasts the ladder creating packet
with the grade value of one, and grade value of one means
that the sensor node receiving this ladder creating packet
transmits data to the sink node requires only one hop. Then
sensor nodes increase the grade value of the ladder-creating
packet to two and broadcast the modified ladder-creating
packet. A grade value of two means that the sensor node
receiving this ladder-creating packet sends data to the sink
node requires two hops count.

1363
IJRITCC | March 2015, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 3

ISSN: 2321-8169
1361 - 1366

_______________________________________________________________________________________________
F. A Reduce Identical Composite Event Transmission
(RIET) Algorithm
The DD and GD algorithms consider only a sensor node
that sends an event to the sink node when the event takes
place. Hence, sensor nodes consume large amounts of power
to send the same event if detected. H. C. Shih et al. [15]
proposed a Reduce Identical Event Transmission Algorithm
(RIET), which can reduce the probability of sending a same
event and save the sensor nodes power. Moreover, the
RIET algorithm is based on the GD algorithm.
The RIET algorithm that is used in the wireless sensor
network can reduce the probability of sending a same event,
save the nodes power, and enhance the sensor nodes
lifetime by sensor node communication. The sensor node
not only has the ability to sense and transfer events, but also
can commute with its neighbor nodes when it senses an
event. The RIET algorithm uses the finite state machine
(FSM) that has a Sensing State, Delay State, Query
State, and Receive Query State to avoid simultaneous
sensor node commutation with neighbor nodes in the
algorithm. Hence, a sensor node can query or respond to its
neighbor nodes by our algorithm and by the FSM. The
FSMs transformation is shown in Fig No. 7. Finite State
Machine diagram for RIET Algorithm [15].

III. COMPARISON
TABLE1. COMPARISON OF DIFFERENT ALGORITHM [16].
Algorithms for WSN

Title

GD

Tech
nique
s

Create
routing
for each
node &
find out
neighbor
ing
nodes.

Ener
gy
Effici
ency

LDACO

CGD-GA

EGD

DD

Using
ladde
r
diffus
ion
phase
&
routin
g.

Based on
genetic
algorithm.

Compo
site
event
aggrega
tion.

DD
paradi
gm &
its key
Featur
es.

29.5%
energy
saving.

52.36
%
energ
y
consu
mptio
n.

Not
mentione
d.

Reduce
52.82%
energy
consum
ption.

Batter
energy
saving
s.

Time
Requ
ired
for
Data
pack
et
Tran
sfer

80.39%
lesser
time

61.11
%
data
forwa
rding.

Lesser
time
needed.

Enhanc
e
lifetime
21.67%
.

Not
mentio
ned.

Cost

Medium.

High.

60%Savin
g.

Mediu
m.

High.

III. Routing Techniques.

There are different Routing Techniques or Protocol used
for Wireless Sensor Network, We Study some of them like
Ad-Hoc, MANET etc.
Topology Control for Wireless Sensor Networks.
Topology control process for ANs (Application Node)
and BSs (Base Station), which constitute the upper tier of a
two-tiered WSN. We propose approaches to maximize the
topological network lifetime of the WSN, by arranging BS
location and inter-A relaying optimally. Based on an
algorithm in Computational Geometry, we derive the
optimal BS locations under three topological lifetime
definitions according to mission criticality. Show in Fig No.
8. Topology Control iterations for WSN
1.

Fig No. 7. Finite State Machine diagram for RIET

Algorithm [15].

1364
IJRITCC | March 2015, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 3

ISSN: 2321-8169
1361 - 1366

_______________________________________________________________________________________________
Multipath

No

Yes

Yes

Throughput

High

Low

Low

Catching
Overhead

Low

High

Medium

CONCLUSION

Fig. No. 8. Topology Control iterations for WSN [12].

Various Routing Protocols for MANETs
Routing protocols for MANETs should be evaluated on
both qualitative and quantitative metrics. Qualitative metrics
describe desirable protocols attributes that make them
efficient. Show in Fig No. 9. A Mobile Ad hoc Network [14].
2.

We Study differed Algorithm and Routing Protocol

In real Wireless Sensor networks, the sensor nodes use
battery power supplies and thus have limited energy
resources. In wireless sensor networking large number of
nodes connected to each other with related energy,
efficiency. Some basic problem encountered like power
consumption, large distance thats why work is dismissed or
avoided. This type of problem is faced using fault node
recovery algorithm for WSN based on the grade diffusion
algorithm combined with genetic algorithm. We sure that
that type of algorithm used then result is replacements of
sensor nodes and more reused routing paths. Time for data
transfer is depend on active nodes thats why we detect a
routing path with faulty node. Power consumption is affect
the hierarchy of active nodes thats why data is not
transferred surely. In this proposed algorithm reduces the
rate of data loss by approximately 98.8%, and reduces the
rate of energy consumption by approximately 31.1%.
REFERENCES
[1]

[2]

[3]

[4]

Fig No. 9 A Mobile Ad hoc Network [14].

[5]

TABLE2. COMPARISON OF REACTIVE ROUTING

PROTOCOLS [14].

[6]

[7]

Routing Protocols for Wireless

Sensor Network
Parameters

AODV

DSR

TORA

Route
updating

NonPeriodic

NonPeriodic

High
routing
overhead

Performance
Metrics

Speed

Shortnes
s

Speed

Routing
Overhead

High

High

High

[8]

[9]

[10]

Hong-Chi Shih, Student Member, IEEE, Jiun-Huei Ho, BinYih Liao, Member, IEEE, and
Jeng-Shyang Pan,
Senior Member, IEEE, Fault Node Recovery Algorithm for
a Wireless Sensor Network, IEEE SENSORS JOURNAL
VOL:13 NO 7 YEAR 2013.
J. A. Carballido, I. Ponzoni, and N. B. Brignole, CGD-GA:
A graphbased genetic algorithm for sensor network design,
Inf. Sci., vol. 177, no. 22, pp. 50915102, 2007.
F. C. Chang and H. C. Huang, A refactoring method for
cache-efficient swarm intelligence algorithms, Inf. Sci., vol.
192, no. 1, pp. 3949, Jun. 2012.
S. Corson and J. Macker, Mobile Ad Hoc Networking
(MANET): Routing Protocol Performance Issues and
Evaluation Considerations. New York, NY, USA: ACM,
1999.
M. Gen and R. Cheng, Genetic Algorithms and Engineering
Design. New York, NY, USA: Wiley, 1997.
Z. He, B. S. Lee, and X. S. Wang, Aggregation in sensor
networks with a user-provided quality of service goal, Inf.
Sci., vol. 178, no. 9 , pp. 21282149, 2008.
J. H. Ho, H. C. Shih, B. Y. Liao, and S. C. Chu, A ladder
diffusion algorithm using ant colony optimization for
wireless sensor networks, Inf. Sci., vol. 192, pp. 204212,
Jun. 2012.
J. H. Ho, H. C. Shih, B. Y. Liao, and J. S. Pan, Grade
diffusion algorithm, in Proc. 2nd Int. Conf. Eng. Technol.
Innov., 2012, pp. 20642068.
T. P. Hong and C. H. Wu, An improved weighted clustering
algorithm for determination of application nodes in
heterogeneous sensor networks, J. Inf. Hiding Multimedia
Signal Process., vol. 2, no. 2, pp. 173184, 2011.
C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann,
and F. Silva, Directed diffusion for wireless sensor
networking, IEEE/ACM Trans. Netw., vol. 11, no. 1, pp. 2
16, Feb. 2003.
1365

IJRITCC | March 2015, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 3

ISSN: 2321-8169
1361 - 1366

_______________________________________________________________________________________________
[11] W. H. Liao, Y. Kao, and C. M. Fan, Data aggregation in

[12]

[13]

[14]

[15]

[16]

wireless sensor networks using ant colony algorithm, J.

Netw. Comput. Appl., vol. 31 , no. 4, pp. 387401, 2008.
T. H. Liu, S. C. Yi, and X. W. Wang, A fault management
protocol for low-energy and efficient wireless sensor
networks, J. Inf. Hiding Multimedia Signal Process., vol. 4,
no. 1, pp. 3445, 2013.
J. Pan, Y. Hou, L. Cai, Y. Shi, and X. Shen, Topology
control for wireless sensor networks, in Proc. 9th ACM Int.
Conf. Mobile Comput. Netw., 2003, pp. 286299.
E. M. Royer and C. K. Toh, A review of current routing
protocols for ad-hoc mobile networks, IEEE Personal
Commun., vol. 6, no. 2, pp. 4655, Apr. 1999.
H. C. Shih, S. C. Chu, J. Roddick, J. H. Ho, B. Y. Liao, and
J. S. Pan, A reduce identical event transmission algorithm
for wireless sensor networks, in Proc. 3rd Int. Conf. Intell.
Human Comput. Interact., 2011, pp. 147154.
Resmi.S.J and Jiby J Puthiyidam,A study on Fault Node
Recovery Algorithm in Wireless Sensor Networks,in
Volume 2, Issue 11, November 2014.

1366
IJRITCC | March 2015, Available @ http://www.ijritcc.org

_______________________________________________________________________________________