Professional Documents
Culture Documents
Claude Duvallet
I.
INTRODUCTION
RELATED WORK
phase. In the first phase, the clusters are organized and CH are
selected. CH change randomly over time in order to balance the
energy dissipation of nodes. In the steady state phase, the actual
data transfer to the BS takes place. Despite the fact that CH
rotation is performed at each round to achieve load balancing,
LEACH cannot ensure real load balancing because the CH are
elected in terms of probability without energy consideration.
LEACH is a CH single-hop protocol. In single-hop sensor
networks, CH use direct communication to reach the BS, and
the problem of unbalanced energy consumption among the CH
arises. CH, farther away from the BS, have heavier energy
burden due to the long-haul communication links.
Consequently, they will die earlier.
TEEN [16] is a threshold sensitive hierarchical routing
protocol. In TEEN, the authors propose the concept of Hard
Threshold (HT) and Soft Threshold (ST). The transmission of
the current sensed data depends on two conditions. The current
sensed data must be greater than HT and the difference
between the current sensed data and the previous one is greater
than ST. By this mechanism, the network can control the data
transmission. Only, the sensitive data can be transmitted to
reduce the energy transmission consumption and improve the
effectiveness and usefulness of the receiving data.
In [6], an Energy-efficient Multi-hop hierarchical Routing
protocol (EMHR) is proposed, which optimizes clustering
process based on the energy strategy, and effectively avoids the
low-energy nodes as the CH. In data transmission, the data in
CH can be transmitted by multi-hop. According to the weight
function determining the next-hop CH, this method balances
the load of network topology and reduces the CH energy
dissipation in WSN. However, when CH cooperate with each
other to forward their data to the BS, the CH closer to the BS
are burdened with heavier relay traffic and tend to die much
faster, leaving areas of the network uncovered and causing
network partitions.
III.
Our protocol has three main features. The first one is that it
performs selecting CH with more residual energy and rotating
CH periodically to distribute the energy consumption among
nodes in each cluster, and so extends the network lifetime.
The second feature is that our protocol tries to reduce the
number of transmissions. In [24], data is allowed to deviate,
with a certain degree, from their corresponding values in the
external environment. To measure data imprecision, the notion
of data error, denoted DE, which is used, gives an indication of
how much the value of data stored deviates from the
corresponding real-world value. This deviation has a threshold
named MDE (Maximum Data Error). The transmission of data
is discarded if the deviation between the current data value and
the stored value is less or equal to MDE (if DE MDE).
The third feature is concerned with the communication cost.
In single hop sensor networks, CH use direct communication to
reach the BS, and the problem of unbalanced energy
consumption among CH arises. CH farther away from the BS
have heavier energy burden due to the long-haul
communication links. Consequently, they will die earlier.
(1)
b E friss amp d if d dc
Ea (b, d )
4
b Etwo rayamp d if d dc
(2)
IV.
TABLE I
SIMULATION PARAMETERS
Parameters
Values
Network field
100 x 100
BS location
(200, 200)
Ee
50 nJ/bit
Efriss-amp
10 pJ/bit/m2
Etwo-ray-amp
0,0013 pJ/bit/m4
dC
87
500 bytes
5J
100
30 J
MDE
TABLE III
Iteration
MEE
MEEDC
100
84
50
5000
4420
100
10000
8850
150
15000
13422
200
20000
17854
F. Network lifetime
The most common definition of network lifetime is the time
when the last node in the network depletes its energy. In this
experiment, a node is considered dead if its remaining energy
is less than the value for the transmission task. Fig. 3 shows the
variation in the number of all alive nodes based on the number
of messages received by the BS. As shown in the figure, the
number of dead nodes in the proposed protocol is always less
than that of LEACH, EMHR an MEE protocol.
The MEEDC protocol outperforms the others protocols and
prolongs the lifetime of the whole network.
Iteration
1
LEACH
EMHR
MEE
MEEDC
0.53
0.46
0.41
0.36
100
52.16
45.75
41.15
36.80
200
105.42
89.96
82.16
72.82
300
155.20
135.26
123.26
109.84
400
205.93
180.56
164.74
145.67
500
255.45
225.34
205.12
184.56
E. Number of messages
As mentioned in the previous section, we have chosen to
compare the number of sent messages in the period where there
is no node depletes its energy, i.e., we have the same number of
alive nodes.
Table III shows the change in the number of messages
received by the BS until the first node in the network depletes
its energy. In the LEACH, EMHR and MEE protocol, every
non-CH node must transmit its sensed data to CH at every
iteration. In MEEDC protocol, only parts of nodes passing data
verification need transmit data to CH. This obviously reduces
the transmission energy consumption.
CONCLUSION
REFERENCES
[1] Abdoulaye Diop, Yue Qi, Qin Wang and Shariq Hussain, An Advanced
Survey on Secure Energy-Efficient Hierarchical Routing Protocols in
Wireless Sensor Networks, IJCSI International Journal of Computer
Science Issues, Vol. 10, Issue 1, No. 2, pp. 490-500, January 2013.
[2] J. Zhang, V. Varadharajan, Wireless sensor network key management
survey and taxonomy, Journal of Network and Computer Applications,
Vol. 33, No. 2, pp. 63-75, 2010.
[3] Arvind Kumar, Ravi Kant Sahu, Siddhartha Chauhan, Energy-Efficient
and Reliable Routing Protocol for Wireless Sensor Networks,
International Journal of Computer Applications, Vol. 43, No.11, pp. 3337, April 2012.
[4] S. K. Singh, M. P. Singh, and D. K. Singh, Routing Protocols in
Wireless Sensor NetworksA Survey, International Journal of
Computer Science & Engineering Survey (IJCSES), Vol. 1, No. 2, pp.
63-83, November 2010.
[5] Samina Ehsan, Bechir Hamdaoui, A Survey on Energy-Efficient
Routing Techniques with QoS Assurances for Wireless Multimedia
Sensor Networks, IEEE Communications Surveys and Tutorials, Vol.
14, No. 2, pp. 265-278, 2012.
[6] W. W. Huang, Y. L. Peng, J. Wen, M. Yu, Energy-Efficient Multi-hop
Hierarchical Routing Protocol for WSN, International Conference on
Networks Security, Wireless Communications and Trusted Computing
(NSWCTC '09), pp. 469 472, Wuhan, Hubei, 2009.
[7] Chunghui Lee, Eunju Kim, Junho Park, Dongook Seong, and Jaesoo
Yoo, An Efficient Hierarchical Multi-Hop Clustering Scheme in Nonuniform Large Wireless Sensor Networks, Computer Science and its
Applications, Vol. 203, pp. 757-765, 2012.
[8] G. Chen, C. Li, M. Ye and J. Wu, An unequal cluster-based routing
protocol in wireless sensor networks, Wireless Network, Vol. 15, Issue
2, pp. 193-207, 2007.
[9] S. K. Singh, M. P. Singh and D. K. Singh, Energy efficient
Homogeneous Clustering Algorithm for Wireless Sensor Network,
International Journal of Wireless & Mobile Networks (IJWMN), Vol. 2,
No. 3, pp. 49-61, 2010.
[10] Gaurav Bathla and Gulista Khan, Energy- efficient Routing Protocol
for Homogeneous Wireless Sensor Networks, International Journal on
Cloud Computing: Services and Architecture (IJCCSA), Vol. 1, No. 1,
pp. 12-20, May 2011.
[11] Nadeem Javaid, T. N. Qureshi, A. H. Khan, A. Iqbal, E. Akhtar, M.
Ishfaq, EDDEEC: Enhanced Developed Distributed Energy-Efficient
Clustering for Heterogeneous Wireless Sensor Networks, Procedia
Computer Science, pp.1-6, 2013.
[12] Brahim Elbhiri, Rachid Saadane, Driss Aboutajdine, Stochastic and
Equitable Distributed Energy-Efficient Clustering (SEDEEC) for
heterogeneous wireless sensor networks, International Journal of Ad
Hoc and Ubiquitous Computing (IJAHUC), Vol. 7, No. 1, pp. 4-11,
2011.
[13] Said Ben Alla, Abdellah Ezzati, Abderrahim Beni Hssane And Moulay
Lahcen Hasnaoui, Hierarchical Adaptive Balanced energy efficient
Routing Protocol (HABRP) for heterogeneous wireless sensor
networks, International Conference on Multimedia Computing and
Systems (ICMCS), pp. 16, 2011.