GMCA: a greedy multilevel clustering algorithm for data gathering in wireless sensor networks
by Manish Kumar; Shekhar Verma; Neerav Agarwal
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 11, No. 2, 2013

Abstract: Data gathering plays an important role in several applications of wireless sensor network (WSN). In an energy constrained WSN environment, the data gathering must be energy efficient to maximise the operational lifetime of the network. This paper proposes GMCA for data gathering which makes a dynamic backbone for data transfer to the base station. This results in the enhancement of the network lifetime. The approach endeavours to find the most energy efficient path for every message and distribute energy consumption evenly in the network simultaneously. Simulation results show that GMCA performs better than existing algorithms and enhances the lifetime of a sensor network significantly.

Online publication date: Fri, 28-Feb-2014

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 Communication Networks and Distributed Systems (IJCNDS):
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