By Topic

Performance analysis of the EDCR algorithm in a distributed wireless sensor network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gamwarige, S. ; Dept. of Electron. & Telecommun. Eng., Moratuwa Univ. ; Kulasekere, C.

The energy driven cluster-head rotation (EDCR) algorithm proposed in S. Gamwarige and E. Kulasekere (2005) has been shown to out performed existing clustering algorithms such as LEACH (W.B. Heinzelman et al., 2002), HEED (O. Younis and S. Fahmy, 2004), ANTCLUST based (J. Kamimura et al., 2004) and SEP (G. Smaragdakis et al., 2004) in terms of END and PNA (95%) lifetime metrics in a distributed wireless sensor network (WSN). In this paper we present theoretical analysis of the performance parameters such as the optimum transmission range (Ropt) and the clustering trigger threshold value (lambdai) of EDCR in terms correctness and complexity of the algorithm. Further we explain how to find the optimal values for such parameters in order to maximize the network lifetime

Published in:

Wireless and Optical Communications Networks, 2006 IFIP International Conference on

Date of Conference:

0-0 0