An efficient cluster-based self-organisation algorithm for wireless sensor networks
by Mohamed Lehsaini, Herve Guyennet, Mohammed Feham
International Journal of Sensor Networks (IJSNET), Vol. 7, No. 1/2, 2010

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.

Online publication date: Fri, 26-Feb-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Sensor Networks (IJSNET):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your 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 subs@inderscience.com