A distributed algorithm for energy-aware clustering in WSN
by Susmit Bagchi
International Journal of Sensor Networks (IJSNET), Vol. 7, No. 1/2, 2010

Abstract: The clustering of sensor nodes of the Wireless Sensor Networks (WSNs) has received considerable research attention in recent time. The sensor devices of a WSN are severely resource constrained having limited operational lifetime. The clustering of sensor nodes provides longer operational lifetime of the nodes and facilitates data aggregation. This paper proposes a distributed algorithm for clustering of sensor nodes based on the one-hop-neighbours of the nodes. The cluster heads of the clusters are elected based on the local energy levels of the nodes without involving any distributed messaging. This paper presents the design, analysis and experimental evaluation of the algorithm. A comparative analysis of the algorithm is also included.

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