Please use this identifier to cite or link to this item:
https://rda.sliit.lk/handle/123456789/908
Title: | Performance analysis of the edcr algorithm in a distributed wireless sensor network |
Authors: | Gamwarige, S Kulasekere, E. C |
Keywords: | Performance analysis EDCR algorithm distributed wireless sensor network |
Issue Date: | 11-Apr-2006 |
Publisher: | IEEE |
Citation: | S. Gamwarige and C. Kulasekere, "Performance analysis of the EDCR algorithm in a distributed wireless sensor network," 2006 IFIP International Conference on Wireless and Optical Communications Networks, 2006, pp. 5 pp.-5, doi: 10.1109/WOCN.2006.1666547. |
Series/Report no.: | 2006 IFIP International Conference on Wireless and Optical Communications Networks;Pages 5 pp.-5 |
Abstract: | 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 (R opt ) and the clustering trigger threshold value (lambda i ) 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 |
URI: | http://rda.sliit.lk/handle/123456789/908 |
ISSN: | 1811-3923 |
Appears in Collections: | Research Papers - Department of Electrical and Electronic Engineering Research Papers - SLIIT Staff Publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Performance_analysis_of_the_EDCR_algorithm_in_a_distributed_wireless_sensor_network.pdf Until 2050-12-31 | 1.43 MB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.