A novel centralised clustering algorithm for energy efficient wireless sensor networks Online publication date:: Sun, 03-Aug-2008
by Stefano Colombo, Naveen Chilamkurti, Sherali Zeadally
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 1, No. 2, 2008
Abstract: Wireless Sensor Networks (WSNs) consist of a large number of low-power nodes sensing data from the environment. The sensor nodes are equipped with small and often irreplaceable batteries with limited power capacity. One of the areas of sensor networking that has attracted a lot of attention recently is the prolonging of the life span of sensor networks by exploiting energy-efficient routing schemes. We propose a novel energy-efficient centralised clustering algorithm for WSN. The proposed algorithm generates a set of possible clustering alternatives from which it selects the optimal clustering. We also present a performance evaluation of the proposed algorithm using two performance metrics Max-min and Max-sum. We found that Max-sum yields superior performance. In addition, our proposed algorithm improves the system lifetime performance over Low Energy Adaptive Clustering Hierarchy-C by almost 15%. We also compare performance results obtained with the chosen metric (Max-sum) with those obtained using other strategies (such as random and configuration 0). The Max-sum metric outperforms the random and configuration 0 strategies by almost 8.5 and 11%, respectively, for system lifetime. Moreover, we found that the total amount of data collected using the Max-sum metric is at least 9% higher than with random and configuration 0 strategies.
Online publication date:: Sun, 03-Aug-2008
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Autonomous and Adaptive Communications Systems (IJAACS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org