An An An An EEEEnergy nergy nergy nergy AAAAnd nd nd nd LLLLoad-based oad-based oad-based oad-basedRRRRouting outing outing outing AAAAlgorithm lgorithm lgorithm

lgorithm IIIInnnn WWWWireless ireless ireless ireless SSSSensor ensor ensor ensor NNNNetwork etwork etwork etwork
Wang Jinghua Guan Tingting He Huan Chen Yuanyuan
Department oI computer science
Huazhong Normal University
Wuhan, China
jhuawang126.com gtt1021126.com
$EVWUDFW $EVWUDFW $EVWUDFW $EVWUDFW----In In In In wireless wireless wireless wireless sensor sensor sensor sensor networks, networks, networks, networks, limiting limiting limiting limiting energy energy energy energy
consumption consumption consumption consumption of of of of sensors sensors sensors sensors and and and and prolonging prolonging prolonging prolonging the the the the network network network network lifetime lifetime lifetime lifetime
have have have have been been been been important important important important reasons reasons reasons reasons to to to to evaluate evaluate evaluate evaluate routing routing routing routing protocol protocol protocol protocol ` ```ssss
performance. performance. performance. performance. This This This This paper paper paper paper proposes proposes proposes proposes aaaa routing routing routing routing metric, metric, metric, metric, which which which which
takes takes takes takes into into into into remaining remaining remaining remaining energy energy energy energy and and and and load load load load of of of of the the the the sensor sensor sensor sensor nodes, nodes, nodes, nodes,
trying trying trying trying to to to to balance balance balance balance network network network network traffic traffic traffic traffic and and and and protect protect protect protect the the the the low-power low-power low-power low-power
and and and and high-load high-load high-load high-load nodes. nodes. nodes. nodes. Base Base Base Base on on on on this this this this metric, metric, metric, metric, we we we we also also also also propose propose propose propose aaaa
new new new newrouting routing routing routing algorithm algorithm algorithm algorithm called called called called Energy Energy Energy Energy and and and and Load-based Load-based Load-based Load-based Routing Routing Routing Routing
(ELR). (ELR). (ELR). (ELR). Simulation Simulation Simulation Simulation results results results results show show show show that that that that the the the the new new new newmethod method method method can can can can even even even even
load load load load distribution distribution distribution distribution and and and andnode node node node energy. energy. energy. energy.
.H\ZRUGV .H\ZRUGV .H\ZRUGV .H\ZRUGV ZLUHOHVV ZLUHOHVV ZLUHOHVV ZLUHOHVV VHQVRU VHQVRU VHQVRU VHQVRU QHWZRUN QHWZRUN QHWZRUN QHWZRUN HQHUJ\ HQHUJ\ HQHUJ\ HQHUJ\ ORDG ORDG ORDG ORDG URXWLQJ URXWLQJ URXWLQJ URXWLQJ
DOJRULWKP DOJRULWKP DOJRULWKP DOJRULWKP
I. INTRODUCTI ON
Wireless sensor network (WSN) consists oI a number oI
sensor nodes which have the ability oI sensing, processing
and communicating to acquire process some data, publish
the result to the observer. Due to Ilexibility, selI-organization,
dynamic and reliability, WSN can be used in a wide
spectrum oI applications, including battleIield surveillance,
Ilood detection, home automation, etc
|1|
.On the other hand,
energy, computing resources, communication capabilities oI
the sensor nodes are very limited, so limiting energy
consumption oI sensors and prolonging the network liIetime
have been important reasons to evaluate routing protocol`s
perIormance.
At present, a lot oI energy-eIIicient routing protocols are
proposed
|2,3|
. Their ideas are always that discovering a
single path which has the smallest energy consumption to
transmit data in order to optimize network liIetime. But using
a Iixed path that has minimum energy consumption
Irequently may make the energy oI the nodes on the path
used up too early, which aIIects the network perIormance.
ThereIore, how to use the energy oI every sensor node
evenly is the key to design routing algorithm in WSN.
ReIerence |4| proposes an energy aware routing protocol
which bases on a Iixed path. That is to say, once the node
selects a routing path, it must use this path to communication,
at least receiving the update inIormation Irom the base
station. Because oI the dynamics oI network topology, it will
consume extra network bandwidth and node energy to
update the routing path. ReIerence |5| proposes a load
balancing multi-path routing in wireless sensor networks
(LBMPR). It depends on the geographical location oI sensor
nodes to generate multiple paths to achieve load balancing
between nodes and to prolong the network liIetime.
ReIerence |6| proposes an energy-balanced short path
routing in wireless sensor network (EB-SPR), which has
priority to select the high energy node to Iorward data.
In order to achieve energy balancing, it is necessary to
use nodes which have high remaining energy to transmit data
packets. However, it will lead to excessive network delay.
An ideal routing algorithm Ior wireless sensor networks
should consider balancing the energy consumption,
extending network liIetime and optimizing network delay.
This paper takes into remaining energy and load to balance
network traIIic, protect the low-power and high-load nodes.
Base on this metric, we also propose a new routing algorithm
called Energy and Load-based Routing (ELR).
The rest oI the paper is organized as Iollows: In Section2,
we establish an algorithm model. In Section 3, we propose
ELR algorithm, which base on energy and load inIormation.
Algorithm perIormance simulation is perIormed in Section 4.
Conclusions are in Section 5.
II. ALGORITHM MODEL
The paper assumes that all sensor nodes are uniIormly
distributed in a rectangular region, and they have the same
initial energy. The communication radius oI all nodes is R. II
the distance between two sensor nods is less than or equal to
R, we can see that there is a communication link.
According to limited energy and communication Ieatures
oI sensor nodes, we can grade wireless sensor network
|7|.Assume the level oI processing node is deIined as 0, the
level oI the sensor nodes which can communicate with
processing node directly are deIined as 1; and the level oI
nodes which can communicate with the level 1 nodes
directly but not correspond to processing node straight are
deIined as 2, and so on. As shown in Fig.1, P is the
processing node, its level is 0, A is level 1, B is level 2, and
C is level 3.
Figure 1. Node classiIication diagram
2009 Second International Symposium on Computational Intelligence and Design
978-0-7695-3865-5/09 $26.00 2009 IEEE
DOI 10.1109/ISCID.2009.78
283
2009 Second International Symposium on Computational Intelligence and Design
978-0-7695-3865-5/09 $26.00 2009 IEEE
DOI 10.1109/ISCID.2009.78
284
The principle oI classiIication is used to convert the
WSN into a hierarchical structure. The graph is described as
Fig.2.The set oI nodes is V, while the set oI the
communication links is E.
Figure 2. Hierarchical WSN graph
In hierarchical WSN graph, each sensor node has a level
number according to the distance Irom the processing node.
Set the level oI node i is , the level oI node j is ,
i
l
f
l
.II , then node i is node j s Iather node, ( , ) i f E 1
i f
l l
the set oI j s Iather nodes is .and iI ,then node i ( )
f
S f
i f
l l
is node j s brother node, the set oI j s brother nodes is
.There are three nodes, u, v, w, iI , ( )
b
S f ( )
f
w S u
and ,then node w is node v s uncle ( )
b
u S v ( )
f
w S v
node, the set oI v s uncle nodes is . ( )
u
S v
The transition is not change the network topology. II
each node selects the Iather node to transmit data, it
constitutes a SPR communication network. The level number
oI every node is its path length. Following Ioregoing
deIinition, we deIine , , as set oI node i ( )
f
E i ( )
b
E i ( )
u
E i
s Iather node energy ,brother node energy and uncle node
energy, respectively. Moreover, the resources oI nodes,
including CPU, memory, and disk are abstracted as a value
L|i|, which is not the resource utilization rate, but the current
load state oI node. We deIine , as node is ( )
f
L i ( )
b
L i
Iather node load inIormation, and brother node load
inIormation.
III. ELR ALGORITHM
In order to utilize the sensor network bandwidth
eIIectively, the sending data can transmit in multiple links.
As shown in Fig. 2, the node X can use the path X-B-Y-P, X-
P to Iorward data. P is the processing node, and the node X`s
Iather node, X is the node B`s Iather node. The energy
consumption oI X-B-Y-P is larger than X-P, so it is
unnecessary Ior transmitting data Irom node X to node B.
Assume that any node , represents the energy
f
N
i
RN
consumption Ior receiving inIormation, represents the
i
TN
energy consumption Ior sending inIormation to node .
f
N
are constant,
i
RN
r
k G
i
TN
2
, r s i f
k d k G G
r
G
s
G
while is the communication radius, k is the size oI
2
, i f
d
inIormation. So the diIIerence oI energy consumption
between them is .
2
4 2
r s
k R k G G
The result shows that WSN must select Iather node to
transmit data. Although the path Ior brother node may
consume much large energy, the node which only receives
local topology in WSN can not determine sending to brother
node leads unnecessary waste oI energy. This paper
considers that the routing path problem either on Iather node
or on brother node. In addition, the routing path between
brother nodes may cause inIormation sending each other.
ThereIore, we must ensure that Iorwarding data between
brother nodes is one at largest.
The idea oI ELR is: the current node selects the shortest
path to transmit inIormation as Iar as possible in order to
decrease time delay, optimize the routing energy
consumption and prolong network liIetime. In order to avoid
some nodes which have smaller remaining energy exhaust
too early, the current node is inclined to select high energy
and low load node to transmit inIormation. Moreover, a
proportional coeIIicient is given as Iollow:
(1)
1
2
1
0
2
( )
( )
c
c
f x
c
f x
T
In equation (1), represents the remaining energy oI
1
( ) f x
node x, represents the current load oI node x. is a
2
( ) f x
0
c
constant. , are weight coeIIicient respectively. We
1
c
2
c
deIine , as set oI value oI node is Iather node, ( )
f
i T ( )
b
i T T
and brother node.
In the Iorwarding procedure, the node which has the
highest value oI has the priority right to be selected, and it
T
can balance network energy consumption and node load. In
order to prolong network liIetime, it not only considers
energy consumption oI the whole network, but also considers
energy consumption oI the single node. To ensure the node
which has the smallest remaining energy exhausts too early,
we set a threshold T. First, we compare the energy oI node
which current node can communication directly with T. II
the energy is less than T, current node will not transmit data
to it. Else we select the node which has the highest value oI
to transmit data. T
BeIore the implementation oI the ELR, we must
determine the level oI nodes Iirstly. The processing node
sends the messages to initialize network at Iirst,
contemporary each sensor node can be assigned a level
number. According to partial inIormation exchange, the
nodes can require their , , , , and
f
S
b
S
f
E
b
E ( )
f
L i
.AIter initialization, the node can decide the next node ( )
b
L i
to transmit data according to related inIormation.
Assume that the algorithm is perIormed on node i. II
node i wants to send data packet , the Iirst thing we must p
do is determining where is Irom. There are two situations: p
284 285
(1)II came Irom the node j which is the node is p
brother node, it will be transmitted to node is Iather node.
Because we assume that Iorwarding data between brother
nodes is one at largest beIore. The Iirst thing we can do is to
compare the energy oI node with T, iI the energy is less than
T; the remaining energy oI that node is very small. Else we
Iind the highest value oI , and transmit to that node. As T p
shown in Fig.3, node C will Iorward the data packet to p
node Z, not to node Y, the reason is that the value oI on T
node Z (19/ 7) is larger than that oI node Y (21/ 9).
Figure 3. Routingtopologycreated by ELR
(2)II came Irom the node j which is the node is child p
node, The Iirst thing we can do is to compare the energy oI
node with T, iI the energy is less than T, the remaining
energy oI that node is very small. Else node i will search
, ,and calculate a subset oI , ( )
f
i T ( )
b
i T ( )
b
i T
max } }, is a
'
( )
b
i T , ( ),
f b
f S i T
f
T t ( )
f
i T
0
T
0
T
very small constant. II is not null, then calculate a
'
( )
b
i T
subset oI , , is `s nodes` ( )
u
i T
'
( )
u
i T , ( )
l u
l S i T l
'
( )
b
i T
Iather nodes}.II and are not null, it can illustrate
'
( )
b
i T
'
( )
u
i T
that there are one brother node oI node i ,named j, and node j
s Iather node at least, and the value oI node j and is l T l
larger than max }, the deviation is at least . So ( )
f
i T
0
T
node i can transmit data to node j. As shown in Fig.3, node B
will select node A to transIorm data , not node Y. Because p
under the premise oI the node A s energy is larger than T, T
value oI node A (28/10)is larger than Y (21/ 9).
IV. ALGORITHM PERFORMANCE SI MULATI ON
A. Simulation Environment
The experiment contains 100 sensor nodes which are
uniIormly distributed randomly in a 200*200 square region.
The communication radius oI nodes are 30 , and the initial
energy are 10J. The threshold is 0.5J. At the beginning oI
each experiment, k nodes are selected randomly as source
nodes, k _100.The running time oI network is divided into
periods. All source nodes send 100 data packets which
consist 400 byte data in a period, and are selected again at
the next period. Assume that sending a data packet will
consume J, and computing, receiving a packet will not
4
10

consume energy.
B. Performance Parameters
The section will compare the perIormance oI the ELR
which is proposed in this paper with that oI SPR, EB-SPR
according to two parameters .
(1) network delay, the routing hops and the network
traIIic are used to evaluate;
(2) network liIe period, that is ,Irom the normal operation
to the Iirst node dies out because oI energy depletion, the
network will consume the time.
C. Simulation Results and Analvsis
As shown in Fig.4, with the increasing oI source nodes k,
the network liIe periods oI ELR is larger than that oI the SPR,
EB-SPR. The diIIerence between them is that each routing
path is not always the lowest energy consumption and the
lowest load in ELR. But ELR has high priority to select the
sensor node which has the highest value oI as the next
T
target node, which eIIectively balance the network energy
consumption, node load, and prolong the network liIe
periods.
Figure 4. Comparingthe net work liIe periods
Figure 5. Comparingthe routing length
Fig.5 describes routing path length in the three
algorithms. The routing length Iorm source nodes to
processing node is closely to 6 in SPR, while it is not more
than 8 in EB-SPR. In ELR, it is not more than9, and with the
increasing oI source nodes, it has the decreasing trend
slightly. Although the network delay oI ELR is larger than
that oI SPR and EB-SPR, the value is less than the 2 multiple
oI SPR
|5|
.
285 286
V. CONCLUSI ONS
This paper proposes an energy and load-based routing
algorithm in WSN. In the Iorwarding data process, each node
takes into account the energy and load oI every sensor node,
looks Ior the nodes which has the highest value oI as the
T
next target node. And the value oI is related to the
T
remaining energy and load oI node. Although each routing
path is not always the lowest energy consumption and the
lowest load in ELR, it can eIIectively balance the network
energy consumption, node load, and prolong the network liIe
periods. The simulation results show that, ELR can improve
the network liIe periods Iurther, and produce small network
delay.
ACKNOWLEDGMENT
This work is partially supported by 'The research oI
Ioreign Chinese long-distance visualized teaching model
The National Society Science Foundation oI P.R. China,
Under Grant No. 07BYY03 The authors wish to thank all
members oI their research group Ior the supports oI various
aspects.
REFERENCES
|1| I.F. Akyildiz , W. Su, Y. Sankarasubramaniam, E. Cayirci, Wireless
sensor net works: Asurvey, Computer Net works 38 (2002) 393422.
|2| Lindsey S, Ranhavendra C S. PEGASIS: power-eIIicient gathering in
sensor inIormation systems. In: Proceedings oI IEEE Aerospace
ConIerence. Montana, USA:IEEE,2002,1125-1130
|3| Intanagonwiwat C, Govindan R, Estrin D, Heidemann J, Silva F.
Directed diIIusion Ior wireless sensor net working. IEEE/ACM
Transactions on Net working,2003,11(1):2-16
|4| Shah R C, Rabaey J M. Energy aware routing Ior low energy AD
Hoc sensor net works. In: Proceedings oI Wireless Communications
and Net working ConIerence. Orlando, USA: IEEE,2002,350-355
|5| Huang Liusheng, Li Hong, Xu Hongli et al.. A load balancingmulti-
path routing in wireless sensor net works|J|. Journal oI University oI
Science and TechnologyoI China, 2006,36(8):887-892
|6| Sun Guodong, Liao Minghong. Energy-balanced Short Path Routing
in Wireless Sensor Net works|J|.Acta Automatica Sinica,
2008,34(12):1540-1544
|7| Xie Yong, Lv Yuhai. A classiIication oI wireless sensor net work
routingalgorithm design|J|. Computer age,2009,4:47-49
286 287