Title: An efficient cluster-based self-organisation algorithm for wireless sensor networks

Authors: Mohamed Lehsaini, Herve Guyennet, Mohammed Feham

Addresses: LIFC – Laboratory of Computer Engineering of Franche-Comte University, 16, Route de Gray, Besancon 25030, France. ' LIFC – Laboratory of Computer Engineering of Franche-Comte University, 16, Route de Gray, Besancon 25030, France. ' Faculty of Engineering Sciences, Tlemcen University, Tlemcen 13000, Algeria

Abstract: The paper proposes an Efficient Cluster-based Self-organisation Algorithm (ECSA) for partitioning Wireless Sensor Networks (WSNs) into clusters, thus giving at the network a hierarchical organisation. Each sensor uses its weight based on its k-density and its residual energy to elect a cluster-head in its 2-hop neighbourhood. ECSA operates without a centralised controller, and does not require that the location of sensors be known. Firstly, we estimate the number of clusters formed with ECSA according to transmission range, then we evaluate the amount of packets sent to the sink per energy dissipation by using the same model presented by Heinzelman et al. (2002), and the number of nodes alive per number of packets received at the sink. Simulation results illustrate that ECSA can evenly distribute energy consumption of sensors and consequently maximise network lifetime when compared to LEACH and LEACH-C.

Keywords: clustering algorithms; cluster head; energy dissipation; homogeneous clusters; k-density; network lifetime; node weight; residual energy; self-organisation; WSNs; wireless sensor networks; wireless networks.

DOI: 10.1504/IJSNET.2010.031852

International Journal of Sensor Networks, 2010 Vol.7 No.1/2, pp.85 - 94

Available online: 26 Feb 2010 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article