Authors: Stefano Colombo, Naveen Chilamkurti, Sherali Zeadally
Addresses: Polytecnico Di Torino, Corso Duca degli Abruzzi, 24 10129 Torino, Italy. ' Computer Science and Computer Engineering, La Trobe University, Melbourne, Australia 3086. ' Network Systems Laboratory, Department of Computer Science and Information Technology, University of the District of Columbia, Washington, DC 20008, USA
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.
Keywords: communications; clustering algorithms; energy efficiency; wireless sensor networks; WSNs; wireless networks; networking; performance; protocol; energy efficient routing.
International Journal of Autonomous and Adaptive Communications Systems, 2008 Vol.1 No.2, pp.242 - 261
Published online: 03 Aug 2008 *Full-text access for editors Access for subscribers Purchase this article Comment on this article