A clustering algorithm with reduced cluster head variations in LEACH protocol Online publication date: Wed, 28-Sep-2016
by Payal Khurana Batra; Krishna Kant
International Journal of Systems, Control and Communications (IJSCC), Vol. 7, No. 4, 2016
Abstract: Efficient utilisation of energy is a challenging issue in wireless sensor networks as the sensor nodes are battery operated. Cluster-based routing protocols help in achieving the goal of energy efficiency. Low energy adaptive clustering hierarchy (LEACH) is a cluster-based routing protocol, which increases both energy efficiency and scalability of the network. However, in LEACH protocol, high variation in cluster head count from the optimal value hampers the expected performance. In this paper, we propose an improvement over LEACH, called LEACH-MAC, which attempts to stabilise the number of cluster heads. Proposed approach also has been evaluated for different-base station locations to suit different applications requirements. Simulation results show that the proposed approach outperforms LEACH and LEACH-SWDN (LEACH with sliding window and dynamic number of nodes) protocol in all different-base station locations.
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 Systems, Control and Communications (IJSCC):
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