An energy-efficient adaptive clustering algorithm with load balancing for wireless sensor network Online publication date: Sun, 08-Jul-2012
by Buddha Singh; D.K. Lobiyal
International Journal of Sensor Networks (IJSNET), Vol. 12, No. 1, 2012
Abstract: Maximisation of network lifetime is the issue of prime importance in Wireless Sensor Network (WSN). An energy-efficient clustering algorithm with load balancing can achieve this challenging goal. We propose Density-based Dynamic Clustering (DDC) algorithm for clustering and cluster head election mechanism with the use of independence set. Furthermore, a distributed algorithm (DISD - Distributed Independence Set Discovery) is designed for cluster head election in O(1) complexity per sensor node. In this, we dynamically find an optimal sensor cover to dominate maximum sensors within a cluster, therefore forming an InDependence Set (IDS). Only the members of IDS are allowed to participate in the cluster head selection (rotation), thereby establishing load balancing and energy management. Our model is designed for dual modes: low- and high-traffic session. According to the flow of packets, the sleep management technique is modified. Network simulator is used for the simulation of our proposed algorithms.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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:
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook