IAETSD JOURNAL FOR ADVANCED RESEARCH IN APPLIED SCIENCES, VOLUME 4, ISSUE 1, JAN-JUNE /2017

ISSN (ONLINE): 2394-8442

ANALYSIS OF DYNAMIC NODE REPLACEMENT BY RE-LINKING

FOR ENHANCING ROUTE PERFORMANCE IN PRE-EMPTIVE
MAINTENANCE IN WIRELESS SENSOR NETWORKS
Shilpa. M. Lambor #1, Sangeeta. M. Joshi *2
#1
Department of Electronics, Vishwakarma Institute of Technology, India
*2 Department of Electronics, Vidyalankar Institute of Technology, India
1
shilpa.lambor@vit.edu, 2sangeeta.joshi@vit.edu.in

ABSTRACT.

In this paper we mathematically analyze the dynamic node replacement process by re-
linking in pre-emptive route maintenance whereby a soon-to-die energy deficient node is replaced with
an energy abundant neighbour node, in the route to the destination. The route from the source to the
destination is modelled as a Continuous Time Markov Chain (CTMC). The dynamic node replacement
process by re-linking modifies the system behaviour and results in a modified Markov chain that exhibits
a lower energy cost as compared to the prevailing route CTMC. The performance comparison of local
route repair and global route repair is carried out. The effect of repeated local re-linkings on route energy
consumption, packet delivery ratio and latency in the route is demonstrated. Numerical analysis
highlights the limitations on the number of re-linking in a single route, before a new route from the
source to the destination is established.

Keywords Node replacement, re-linking, Markov chain, energy cost, packet delivery ratio

I. INTRODUCTION
The process of routing establishes the path between the source and the destination. Also, the wireless sensor networks (WSN) are
characterized by sensor nodes operating on limited energy budgets. Hence one of the major reasons for route break-up is depletion of node
energy. The death of a node in a routing path breaks the link and the connection between the source and the destination is severed. This
necessitates re-routing to complete the data transmission task. Therefore a key challenge in designing routing protocols is that it must be able to
dynamically update the status of its links and re-configure itself in order to maintain strong connectivity to support reliable communication
among the nodes. It is observed that when a link breaks, some packets may be dropped and hence loss of information occurs. Re-transmission of
data on discovery of a new route leads to an increase in the energy consumption. It is of utmost importance to carry out the re-routing procedure
ensuring that energy efficiency is maintained and packet loss is minimized. Although the node battery energy has been previously exploited in
routing protocols, there is a need to explore its efficient usage in re-routing techniques ([1]-[5]).

Routing protocols usually comprise of the route discovery phase and the route maintenance phase. The routing protocol performance in terms
of packet drop, latency and energy consumption predominantly depends on the route maintenance mechanism employed. Studies reveal that
route maintenance can be either post link failure, predictive or pre-emptive ([6]-[9]). In the post link failure maintenance, route maintenance is
initiated only after link and route failure, thereby increasing the packet drops, latency and energy consumption. Predictive route maintenance
guesses when a route failure will happen, and initiates a route recovery mechanism. Whereas in pre-emptive route maintenance, techniques to
search for a new route to the destination are implemented before a route failure occurs.

In the light of the existing research work, we focus our attention in analysing the process of dynamic node replacement by re-linking in pre-
emptive route maintenance. We analyse the effect of re-linking on energy cost incurred for successful packet delivery in a route. We further
highlight the limitations on the number of re-linking in a single route, before a new route from the source to the destination is required to be
established. The paper is organized as follows. Section II discusses the related work carried out till date for predictive and pre-emptive route
maintenance. Section III analyses the node replacement policy for re-linking. Finally section IV concludes and discusses future scope of work.

To Cite This Article: Shilpa. M. Lambor and Sangeeta. M. Joshi,. Analysis of Dynamic Node
Replacement by Re-Linking for Enhancing Route Performance in Pre-emptive Maintenance in
Wireless Sensor Networks. Journal for Advanced Research in Applied Sciences ;Pages: 508-515
509. Shilpa. M. Lambor and Sangeeta. M. Joshi,. Analysis of Dynamic Node Replacement by Re-Linking for
Enhancing Route Performance in Pre-emptive Maintenance in Wireless Sensor Networks. Journal for
Advanced Research in Applied Sciences; Pages: 508-515

II. RELATED WORK

We present the existing work related to route repair in WSN. We review the pre-emptive route recovery mechanisms for on demand routing
protocols and give an overview of predictive and pre-emptive maintenance techniques employed in WSN. It is observed that adhoc on demand
distance vector (AODV) routing protocol, which represents the class of reactive routing protocols, is widely researched since it provides reliable
and efficient end-to-end data packet delivery.

AODV can repair a route by reestablishing a new route from the source node (Global Repair), or initiate repairing from the intermediate node
where the link break is detected (Local Repair) ([10],[11]). However, it only recovers routes after route break detection and doesn't respond
quickly enough to link failures. Thus, it may suffer from the risk of flooding the whole network for new route discovery, and the route repair
process may introduce packet loss, high delay in packet delivery and high control overhead. All of these disadvantages further degrade the
network performance. Considerable research efforts have been devoted to improving AODV performance by locally repairing broken links,
anticipating link breaks by using pre-emptive mechanisms.

Xiao et al. have proposed a novel AODV repair method that would repair the route within the next two-hop node [12]. If the link breaks, it
firstly initiates the repair process in the next two-hop nodes until a new route is found, or repairs the route by AODV local repair scheme. Feng
et al. have proposed a recursive route repair algorithm [13]. On the onset of link breakage, the repairing node tries to repair the route locally. If
unsuccessful, the cached data packet is transmitted back to the pioneer node, which then tries to repair the route locally; if still unsuccessful, the
cached data packet is returned to the upstream node again, until the repair is successful or the data packet is returned back to the source node.
The route repair algorithm is observed to increase network overheads.

One of the main categories of pre-emptive route recovery protocols defines link quality as a function of the Received Signal Strength (RSS)
[14], in order to anticipate link breaks. When an intermediate node receives a packet with RSS less than the predefined threshold, the node
assumes the link is about to break, triggering the route recovery process, preventing an incoming link break. Although local repair may solve
some problems, flooding of RREQ messages for new route discovery on link break may lead to packet loss and communication delay, especially
in heavy traffic condition.

Srinath et al. have proposed a pre-emptive route repair strategy called Router Handoff [15] which broadcasts a Handoff packet to announce a
link break. It contains information of the previous and next hop nodes of broken link. The node that receives the Handoff packet checks for valid
routes to both the previous and next hop nodes, in its routing table, and if yes, will send a positive reply to notify that there exists a valid route to
the next hop. However maintaining the RSS information of neighbors imposes considerable burden on the network. Crisstomo et al. introduced
a pre-emptive local route repair (PLRR) scheme as an extension for AODV [16], which uses GPS to obtain the position and speed of the nodes
to compute the link expiration time (LET). When the LET of a link falls below a predefined threshold, a local repair is used to find an alternative
path. This scheme requires GPS device equipped on each node and clock synchronization. Moreover, it is aware of link degradation only due to
mobility.

The approach of Soliman and Al-Otaibi needs focuses on maintaining a neighbors activity table (NAT) that records information located two-
hop away [17]. The maintenance of such a NAT depends on nodes of an active route monitoring activities of the other active routes, which make
their protocol sensitive to the number of conversations. In cases of fewer conversation-pairs, the NAT table may not be able to populate enough
alternative links for future path detouring. Zheng Zhang et al [18] have proposed an Enhanced Pre-emptive Local Repairing Mechanism (PLRM)
for AODV, which adopts the pre-emptive link break avoidance by monitoring link quality, residual energy and traffic load, and takes measures
to reduce route length, control overhead and packet delay in local repair process The authors have shown that PLRM could indeed outperform
original AODV and the recursive route repair AODV in terms of packet delivery ratio, packet delay and control overhead within a high mobile
network environment.

In [19], Goff et al. propose a pre-emptive route maintenance extension to on-demand routing protocols that aims to find an alternative path
before the cost of a link failure is incurred. The received transmission power is used to estimate the expected link break. However a major
disadvantage observed is the great overhead encountered upon false warning messages. Hence the system is very vulnerable to false warning
message or missing judgments of broken links. In [20], Boukerche and Zhang propose a Pre-emptive AODV (PrAODV) that combines two pre-
emptive mechanisms, advance rediscovery and warn the source before the path breaks. When the signal power of received packets is below a
threshold value, the node sends a hello message to its upstream neighbor.

If this neighbor does not respond, a warning message is sent back to the source. An issue with this technique is the high routing cost
(overhead), however, the average end to end delay per packet is significantly reduced. Authors in [21] have proposed predictive pre-emptive
AODV (PPAODV) that avoids sending unnecessary warning messages. A node is considered to be in an unsafe or pre-emptive region if the
signal it receives from a predecessor node is below threshold signal strength. Once a node enters this zone, at least three consecutive
measurements of the signal strength of packets received from the predecessor node are made, and link failure is predicted using the Lagrange
interpolation.

It is observed that re-linking solutions depend on link break detection mechanisms and may require special hardware or may also lead to
longer routes. Some solutions predict link break by periodically checking the residual battery energy, received signal strength, traffic load etc. It
can be said that predictive route maintenance techniques suffer from excessive computing overheads while pre-emptive techniques may generate
false warnings. In addition, these solutions can't predict network congestion, transmitting interference and node energy exhaustion, which also
causes link failures. Thus there is a need to opt between the need to implement local route repair by re-linking and the necessity to switchover to
global route repair.
510. Shilpa. M. Lambor and Sangeeta. M. Joshi,. Analysis of Dynamic Node Replacement by Re-Linking for
Enhancing Route Performance in Pre-emptive Maintenance in Wireless Sensor Networks. Journal for
Advanced Research in Applied Sciences; Pages: 508-515

III. DYNAMIC LOAD REPLACEMENT BY RE-LINKING

We analyze dynamic node replacement that employs re-linking prior to the event of failure of a node in an active route from the source to the
destination. We employ the basic principle of node battery threshold level monitoring to initiate the re-linking process prior to node failure so as
to reduce the packets loss and hence enable for successful dynamic re-linking and node replacement. When a node in an active route is about to
die, the re-linking process is initiated by the soon-to-die node. The aim is to find a sub-path towards the destination, bypassing the soon-to-die
node. The dynamic node replacement process is executed in two stages.

Stage I: Node battery energy monitoring - Node battery energy threshold levels are defined and real time monitoring of node battery energy is
employed. The node battery status is informed to the neighboring nodes in the route. The node battery energy is compared with two pre-defined
threshold levels.

Stage II: Dynamic re-linking - On verifying impending battery failure status, the re-linking procedure is initiated. New alternate link discovery
is executed locally by the previous node in the route. Simultaneously the existing packets are successfully transmitted by the soon-to-die node.
The incoming packets are stored in the previous node buffer and forwarded through the newly discovered link. New link discovery process is
executed as per the AODV routing protocol.

Performance evaluation of the re-linking technique has been carried out through simulations as well as experimentally in our earlier work
[22]. We have applied the local re-linking technique to AODV and compared the performance of the modified battery-monitored BM-AODV
with reactive AODV and proactive dynamic source routing (DSR) protocols. Experimental validation of the proposed re-linking process in
indoor and outdoor scenario has also been carried out. Results demonstrate a reduction in packet loss by 15% and a decrease in latency by
83.23% on implementing BM-AODV. In this paper, we further analyze the dynamic node replacement policy mathematically and numerically to
study its effectiveness.

A. Mathematical Modelling

We consider a static wireless sensor network with independent identical sensor nodes. We represent the path between the source node and the
destination node as a finite irreducible continuous time Markov chain (CTMC). A Continuous-Time Markov Chain (CTMC) is a stochastic
process (Xt, t R 0) such that the state space S is discrete, the set t > 0 is continuous, and the stochastic process satisfies the Markov property
namely:

Pr{X(tn+1) = xn+1 | X(t0) = x0, , X(tn) = xn} = Pr{X(tn+1) = xn+1 | X(tn) = xn} (1)

Let every node in the path from the source node to the destination node represent a state of the CTMC. We assume that the property of interest
is over states satisfying the Markov property, and that every node of the WSN is independent and identical. We define the WSN as a 2-tuple
system (S,L), s S, l L. Let l L = {0,1,2,3,4} denote a path from source to destination. Let l =0 represent the initial path and l = {1,2,3,4}
represent the re-routed paths. Let s S = {0, 1, 2, 3, 4} denote the number of active nodes in a route. Let (0, 4) be the source node and (0, 0) be
the destination node. Then nodes (0, 3) through (0, 1) represents the intermediate relay nodes. Let an active node make a transition to a dead
state when the residual energy of the node battery falls below threshold 1. The destination node state (0, 0) is an absorbing state from which
there is zero probability of exiting. Hence a routing system can be said to be analogous to an absorbing Markov system that contains at least one
absorbing state, and is such that it is possible to get from each non absorbing state to some absorbing state in one or more steps. We use the
stationarity assumption that the State transition probabilities are independent of the actual time at which transitions take place.

We assume that the nodes are equidistantly placed and transmit with a fixed data rate. Let be the probability of successful transmission of a
packet to an intermediate node in the path from source to destination. By virtue of the analogy between a routing system and a CTMC, the
transition probability from state s to state s(=s-1) can then be said to be e(- ).

We define the re-linking factor f.

f = f b * fn (2)

where

f : Probability that the active node gets discharged below the threshold level and is replaced by a neighboring active node during the process of
re-linking.

fb : Probability of accurately detecting the node battery threshold levels

fn : Probability of active nodes as neighbors

Since global re-routing is initiated after a node in the path is dead, the probability of selecting an alternative route will be [1-e(- (1-f))]. Let a
node in the newly discovered path forward the packet to the next node in the path with the same initial probability e (- ). In the analysis of the
proposed modified Markov chain, a node replacement policy is employed whereby local re-linking is initiated prior to the failure of a node in the
active route. This will lead to multiple node replacements before an entirely new route from the source to the destination is established. Hence
the probability of selecting an alternative node link is [1- e(- f)].
511. Shilpa. M. Lambor and Sangeeta. M. Joshi,. Analysis of Dynamic Node Replacement by Re-Linking for
Enhancing Route Performance in Pre-emptive Maintenance in Wireless Sensor Networks. Journal for
Advanced Research in Applied Sciences; Pages: 508-515

Fig. 1 graphically represents the proposed Markov chain under consideration. Every state is represented by its energy e, number of
transmissions t, number of hops n in the route, the delay in data delivery d and the packets delivered p. Every time a state is advanced an energy
cost is incurred which is a function of number of transmissions t. Let 1 unit of energy be expended for every transmission t. Also a delay is
introduced which is a function of number of hops n. We assume that the source and destination nodes do not exhaust their energy. Let (0,4)-
(0,3)-(0,2)-(0,1)-(0,0) be the initial route from the source to the destination. Assuming the impending failure of node (0,2), the re-linked route 1
is (0,4)-(0,3)-(1,2)-(0,1)-(0,0), re-linked route 2 is (0,4)-(0,3)-(1,3)-(2,2)-(1,1)-(0,1)-(0,0). Consequently as the number of re-linkings increase,
the intermediate relay nodes in a route are increased.

Fig. 1 Graphical representation of modified CTMC

B. Energy Cost Calculations

We now model the node in the route as a Markov Reward Model (MRM) and calculate the energy cost incurred for uninterrupted data
forwarding in the route (Fig. 2). An MRM is a labelled CTMC augmented with state reward and impulse reward structures [23]. The state
reward structure is defined as a function that assigns to each state sn S a reward (sn) such that if t time-units are spent in state sn, a reward of
(sn) * t is acquired. We represent the rewards as the energy cost incurred for staying in some state. A Mica 2 node typically consumes 60 mW
while transmitting, 45 mW while receiving, 18 mW while in idle state and 0 mW when in OFF state. The state reward structure is represented as
a function that assigns to each state sn S a cost (sn). Hence (1) = 0 mW, (2) = 18 mW, (3) = 45 mW, (4) = 60 mW [24].

Fig. 2 Node modelled as an MRM

The impulse reward structure defines a function i that assigns an energy cost i (s n, sn) > 0 of taking a transition from s n to sn, where sn, sn S.
The impulse reward structure defines the state transitions in a node. It is noted that 416 s is independently required to transmit and receive the
payload. 250 s is required for the node to switch ON from the OFF state. The energy costs incurred are i (1,2) = 4.5 mJ, i (2,3) = 18.72 mJ, i
(2,4) = 24.96 mJ and i (2,1) = i (3,2) = i (4,2) = 0 mJ. A node moves to the D-state when its battery falls below the pre-defined energy threshold.

C. Continuous Time Markov Chain Analysis

A CTMC makes transitions from state s to state s, independent of the past, according to a discrete time Markov chain, but once entering a
state s remains in that state, independent of the past, for an exponentially distributed amount of time before changing state again. Hence using
the uniformization technique, the finite state CTMC is directly represented as a discrete time Markov chain (DTMC) with transitions governed
by an independent Poisson process, since in a Poisson process the times between transitions are IID exponential random variables. Using
uniformization we apply properties of DTMCs to analyze CTMCs. Let {Yn : n 0} be the DTMC with one-step transition matrix P and let
{N(t) : t 0} be an independent Poisson process with rate t 0. The Markov model proposed assumes that the means of the transition times 1/ti
from state s to state s are all the same. Under this condition, the CTMC {X(t) : t 0} can be constructed as a random time change of the DTMC
{Yn : n 0} by the Poisson process {N(t) : t 0}, i.e., X(t) = Y N(t) , t 0. As a consequence,

Ps,s(t) P(X(t) = s | X(0) = s) = =k) = . (3)

512. Shilpa. M. Lambor and Sangeeta. M. Joshi,. Analysis of Dynamic Node Replacement by Re-Linking for
Enhancing Route Performance in Pre-emptive Maintenance in Wireless Sensor Networks. Journal for
Advanced Research in Applied Sciences; Pages: 508-515

We make the rates uniform without changing the probability law of the CTMC by introducing one-step transitions from some states to
themselves, which we can regard as fictitious transitions, because the process never actually moves. We generate potential transitions from a
Poisson process with rate , where is chosen so that

, for all s. (4)

When the CTMC is in state s, each of the potential transitions to another state is a real transition with probability ts/ , while the potential
transition from state s back to state s is a fictitious transition meaning that we remain in state s with probability 1(t s/ ), independently of past
events. Thus in each state s, we perform independent thinning of the Poisson process having rate , creating real transitions in state s according
to a Poisson process having rate ts , just as in the original model. The uniformization construction requires that we change the transition matrix of
the embedded DTMC. The new one-step transition matrix allows transitions from a state to itself. Let be the one-step transition matrix and Q
be the CTMC transition rate matrix satisfying condition (4). Then

s,s = Q s,s / for s s

s,s = 1 s,ss s,s = 1 (ts / ) = 1 + (Qs,s / ) = 1 (s,ss Qs,s / ) (5)

In matrix notation,
1
=I+ Q

Hence, Q = (-I). (6)

Multiplying by , we get Q = (-) which implies that

Q = 0 iff = (7)

This ensures that is a bonafide Markov chain transition matrix; it is nonnegative with row sums 1. For the CTMC characterized by the rate
matrix Q, we have transition probabilities Ps,s(t) expressed via and as

Ps,s (t) P(X(t) = s | X(0) = s) = =k) = (8)

where is the DTMC transition matrix. For an irreducible finite-state CTMC, there exists a unique limiting probability vector such that

for all s, s and t > 0.

Statement: Given a CTMC characterized in terms of a DTMC with one-step transition matrix P and exponential transition times with means
1/ts, we have

(9)

Where is the unique solution to = P and e = 1 and e is a column vector of 1s.

The transition probability matrix P is constructed for both the re-routing and re-linking processes. The limiting distribution s is determined in
each case. Applying equation (9) the limiting probabilities s are calculated and the associated rate matrix are generated. Routing protocols, in
general, employ the global route repair policy of replacing the entire route from the source to the destination on the event of failure of an
intermediate node. The transition probability matrix of the embedded DTMC for global re-routing is given by (Fig. 3). Where R0 = 1-e(- (1-f)) , is
the transition probability from route L-1 to route L. State 0 corresponds to a new route and hence the limiting probability 0 corresponds to the
long run limiting probability of staying in route 0.
0 1 2 L-1 L
0 (1 R0 ) R0 0 ... 0 0
1 0 (1 R0 ) R0 ... 0 0
2 0 0 (1 R0 ) ... 0 0
P
.... ... ... ... ... ... ...
L 1 0 0 0 ... (1 R0 ) R0
L 0 0 0 ... 0 1
Fig. 3 Transition probability matrix for global re-routing
513. Shilpa. M. Lambor and Sangeeta. M. Joshi,. Analysis of Dynamic Node Replacement by Re-Linking for
Enhancing Route Performance in Pre-emptive Maintenance in Wireless Sensor Networks. Journal for
Advanced Research in Applied Sciences; Pages: 508-515

We define the energy cost C of route replacement as the energy expended for re-routing and re-transmissions of dropped data packets on the
event of node failure (Refer III.B). The total cost of re-routing is defined as

L
l s C s (10)
l 0

where s represents the final steady state distribution. Cs represents energy cost for re-routing and re-transmissions of dropped data packets when
a node is dead. In an attempt to enhance route lifetime and energy savings, a node replacement strategy is instituted. This strategy calls for
replacing the node in an active route upon its battery reaching a pre-defined threshold level. It is assumed that periodic inspection of node battery
on completion of each successful data transmission is carried out. Under the proposed node replacement policy by re-linking, the system
behaviour is modified and results in a modified Markov chain {X(tnR), n 0}. The corresponding modified transition probability matrix of the
embedded DTMC for re-linking is given by (Fig. 4)

0 1 2 k-1 k
0 0 RR 0 ... 0 0
1 0 RR RR ... 0 0
2 0 RR RR ... 0 0
P
... ... ... ... ... ... ...
k 1 0 RR RR ... RR RR
k 0 0 0 ... 0 1
Fig. 4 Transition probability matrix for node replacement by re-linking

Where RR = 1-e(- f)) , is the transition probability from link k-1 to link k for the same route. It is assumed that each time a node is replaced and re-
linking initiated, energy cost K is incurred. Our interest is in maximum re-linking with minimum energy cost expenditure so as to maximize
route lifetime before a new route discovery process is initiated. This cost is given by the expected cost under the limited distribution for the
Markov chain {X(tnR)}. Denoting this average cost by (R), we have

k
( R ) l s ( R ) K s ( R ) (11)
l 0

Ks(R) represents the energy cost for re-linking.

The limiting distribution s(R) is determined by the equations

r o
r ( R )Qrs ( R ) 0, s 0,..., k (12)

And

0 ( R) 1 ( R) 2 ( R) ... k ( R) 1 (13)

D. Numerical Analysis Of Node Replacement By Re-Linking

The node replacement policy by local re-linking has been validated numerically. A comparative analysis of the results obtained with existing
energy efficient global re-routing is also carried out. We consider a numerical example to find the optimal re-linking processes required for
maximizing route lifetime before a new route to the destination is discovered. We compare it with the cost incurred for corresponding multiple
route discoveries when re-routing is initiated after a node fails. Let number of available routes be L = 5, number of re-links be K, RL = 1-e(- (1-f)) ,
RK = 1-e(- f) , = f = 0.8, Ci = 0.375 W, Ki(R) = 0.25 W. The associated stationarity distribution tables for route replacement (Table I) and node
replacement (Table II) depict the cost incurred in terms of energy expenditure.

TABLE I
STATIONARY PROBABILITY VECTOR ROUTE REPLACEMENT POLICY

Stationary Distribution Average Cost

L 0 1 2 3 4 5 (l)
0 0.8712 0.1288 0 0 0 0 0.375
1 0.4655 0.4655 0.0689 0 0 0 0.4008
2 0.3177 0.3177 0.3177 0.047 0 0 0.4104
3 0.2411 0.2411 0.2411 0.2411 0.0357 0 0.4152
4 0.1942 0.1942 0.1942 0.1942 0.1942 0.0287 0.418
514. Shilpa. M. Lambor and Sangeeta. M. Joshi,. Analysis of Dynamic Node Replacement by Re-Linking for
Enhancing Route Performance in Pre-emptive Maintenance in Wireless Sensor Networks. Journal for
Advanced Research in Applied Sciences; Pages: 508-515

TABLE III
STATIONARY PROBABILITY VECTOR NODE REPLACEMENT POLICY

Stationary Distribution Average Cost

K 0 1 2 3 4 5 (k)
0 0.679 0.321 0 0 0 0 0.08
1 0.243 0.5139 0.243 0 0 0 0.189
2 0.1532 0.3608 0.3238 0.1532 0 0 0.2091
3 0.1673 0.0853 0.3937 0.3537 0.1673 0 0.25
4 0.3248 -1.267 0.1656 0.7649 0.6866 0.3248 0.1688

The average cost associated for multiple route discoveries is almost twice the cost incurred for multiple node replacements in a single route.
The stationary distribution for node replacement policy for K = 5 shows that as the cost increases with increase in node replacements, the
optimal limit is set at 3 node replacements. Thence a new route from the source to the destination needs to be established.

E. Mathematical Validation

The probability of being absorbed in state (0,0) has been calculated using Matlab for a varying hop count between the source node and the
destination node. We have assumed the probability of successful transmission of a packet to an intermediate node as 0.8 and the re-linking
factor f is also assumed to be equal to 0.8 [25]. It is assumed that 1000 packets are transmitted by the source node in a burst. Probability of
packets reaching from source node to destination node is calculated for both global re-routing and local node replacement re-linking policy. This
increase in percentage PDR on implementing the node replacement policy for varying hop count (N) is depicted in Fig. 5.

Results show an appreciable improvement in the absorption probability when node replacement is initiated prior to the failure of a node in the
path from source to destination. We observe that the packet delivery to the destination decreases as the hop count increases between the source
and the destination nodes. This can be accounted for by the packet losses incurred in multiple receptions-transmissions and since probability of
transmission assumed < 1. For the same hop numbers, the packet delivery ratio for local node replacement by re-linking almost doubles in
comparison to global re-routing since initiation of re-linking prior to node failure reduces packet drops. Latency is also observed to decrease by
62.5% for 5 hops to 31.25% for 10 hops. This can be attributed to the fact that the time spent on re-routing after the failure of a node is
eliminated (Fig. 6). This supports our belief that pre-emptive route maintenance techniques that supports initiation of re-linking prior to node
failure enhances the performability of the system.

Fig. 5 Percentage improvement in Packet Delivery Ratio

Fig. 6 Improvement in Latency

515. Shilpa. M. Lambor and Sangeeta. M. Joshi,. Analysis of Dynamic Node Replacement by Re-Linking for
Enhancing Route Performance in Pre-emptive Maintenance in Wireless Sensor Networks. Journal for
Advanced Research in Applied Sciences; Pages: 508-515

IV. CONCLUSION

This paper has analyzed the pre-emptive local route repair policy of node replacement by re-linking just prior to the failure of a node in the
route from source to the destination. The route from the source to the destination is represented as a continuous time Markov chain. The
mathematical analysis of the modified CTMC indicates a significant increase of more than 60 % in the percentage of packets reaching the
destination node. Latency is also observed to decrease by an average of almost 44 %, as compared to global route repair through re-routing. The
node replacement policy avoids further route deterioration and prolongs impending failure of the route. Numerical analysis of route replacement
and node replacement highlights energy cost savings upto 50 % in the local pre-emptive node replacement policy by re-linking. Number of re-
linking in an active route is restricted by the increasing energy costs incurred. Results are indicative that the node battery energy is more
efficiently utilized along with an appreciative improvement in packet delivery ratio on implementation of the local route repair node replacement
re-linking policy. Thus our analysis reiterates the fact that local re-linking in the event of node or link failure is more energy efficient and
reduces latency and hence is suggested for WSN applications that demand reliable data forwarding with high energy efficiency. However
repeated local route repair degrades route performance and global route repair is advisable.

REFERENCES

[1] Kulau, F. Busching and L. Wolf, A Nodes Life: Increasing WSN Lifetime by Dynamic Voltage Scaling. The 9th IEEE International
Conference on Distributed Computing in Sensor Systems (IEEE DCoSS), Cambridge, USA, 2013.
[2] Amit Sinha and Anantha Chandrakasan, Dynamic Power Management in Wireless Sensor Networks, IEEE Design and Test of
Computers, pp 62_74, 2001.
[3] Arun Avudainayagam, Wenjing Lou, Yuguang Fang, DEAR: A Device and Energy Aware Routing Protocol for Heterogenous Adhoc
Networks, Elsevier, Journal of Parallel and Distributed Computing. 63, pp 228_236, 2003.
[4] C.Chiasserini and R.Rao, Energy Efficient Battery Management, IEEE Journal on Selected Areas in Communication. Vol 19, No 7, pp
1235_1245, 2001.
[5] C K Toh, Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks, IEEE
Communications Magazine, pp 138_147, 2001.
[6] K. Akkaya and M. Younis, A Survey of Routing Protocols in Wireless Sensor Networks, Elsevier Ad Hoc Network Journal. Vol. 3/3, pp.
325_349, 2005.
[7] P. Jain and A. Suryawanshi, Energy Efficient Local Route Repair Multicast AODV Routing Schemes in Wireless Adhoc Network,
International Conference on Advanced Communication Control and Computing Technologies (CACCT), Ramanathapuram, India, pp
1168_1173, May 2014.
[8] Y. Choi, D. Kang and S. Bahk, Improvement of AODV Routing Protocol through Dynamic Route Change using Hello Message,
International Conference on Information and Communication Technology Convergence(ICTC), Busan, South Korea, pp 117_121, October
2014.
[9] A. J. Cahill, P. L. De Leon and C. J. Sreenan, Link Cache Extensions for Predictive Routing and Repair in Adhoc Wireless Networks,
Proceedings of the 4th International Conference on Mobile and Wireless Communication Networks (MWCN), pp 43_52, September 2002.
[10] Charles E. Perkins, Elizabeth M. Royer, Samir R. Das, Ad Hoc On-Demand Distance Vector Routing, Internet Engineering Task Force,
Draft, 33 pages, 1999.
[11] S. R. Azzuhri, M. Portmann and W. L. Tan, Evaluation of Parameterized Route Repair in AODV, in Proc. 4th International Conference
on Signal Processing and Communication Systems, pp 1_7, 2010.
[12] B. L. Xiao, G. Wei, J. Liu and S. L. Zhu, An Improvement for Local Routing Repair in Mobile Ad Hoc Network, in Proc. 6th
International Conference on ITS Telecommunication Proceedings, Chengdu, pp 691_694, 2006.
[13] J. Feng and H. B. Zhou, A Self-Repair Algorithm for Ad Hoc On-Demand Distance Vector Routing, in Proc. International Conference
of Wireless Communications, Networking and Mobile Computing, pp 1_4, 2006.
[14] Z. K. Lee, H. R. Oh and H. Song, QoS-Aware Routing and Power Control Algorithm for Multimedia Service over Multi-Hop Mobile
Adhoc Network, Wireless Communications and Mobile Computing, Vol. 12, No 7, pp 567_579, 2012.
[15] P. Srinath, P. Abhilash and I. Sridhar, Router Hand-Off: Pre-Emptive Routing in Ad Hoc Networks, Journal of Parallel and Distributed
Computing, pp 123_140, 2003.
[16] S. Crisstomo, S. Sargento, P. Brando, and R. Prior, Improving AODV with Pre-emptive Route Repair, Technical Report Series:
DCC-2003-0, Universidadedo Porto, Portugal, 2003.
[17] H. Soliman and M. Al-Otaibi, Enhancing AODV Routing Protocol over Mobile Adhoc Sensor Networks, International Journal of
Sensor Networks, Vol 10, pp 36_41, 2011.
[18] Zheng Zhang, Zhenbo Li and Jiapin Chen, An Enhanced AODV Route Repairing Mechanism in Wireless Ad-Hoc Sensor Network,
Journal of Communications, Vol 9, No 8, pp 651_657, August 2014.
[19] Tom Goff, B. Nael, N. Abu-Ghazaleh, Dhananjay S. Pathak and Ridvan Kahvecioglu, Pre-emptive Routing in Ad Hoc Networks,
Proceedings of 7th International Conference on Mobile Computing and Networking, ACM, Rome, Italy, pp 43_52, 2001.
[20] A. Boukerche and L. Zhang, A Performance Evaluation of Pre-Emptive On-Demand Distance Vector Routing Protocol for Mobile Adhoc
Networks, Vol. 4, Wireless Communications and Mobile Computing, pp 99_108, 2004.
[21] Sofiane Boukli Hacene and Ahmed Lehireche, An Overview on Predictive and Pre-Emptive Maintenance Techniques in Manets,
Colloque sur lOptimization et les Systmes dInformation, COSl, January 2007.
[22] Nishit Shetty, S. M. Lambor, S.M. Joshi, Empirical Analysis and Performance Evaluation of a Generic Re-Linking Technique for Robust
Route Maintenance, IEEE Bombay Section Symposium, September 2015.
[23] William J. Stewart. Probability, Markov Chains, Queues and Simulation. Princeton University Press: 2009.