Efficient algorithm for maximum lifetime many-to-one data aggregation in wireless sensor networks
by Deying Li, Qinghua Zhu, Wenping Chen
International Journal of Sensor Networks (IJSNET), Vol. 9, No. 2, 2011

Abstract: Data aggregation problem with maximising network lifetime is one of important issues in wireless sensor networks. In this paper, we study the maximum lifetime many-to-one data gathering with aggregation (MLMTODA) problem: given locations of sensors and a base station together with available energy of each sensor, and a set of sources, find a schedule in which data should be gathered from all the sources and transmitted to the base station, such that the lifetime of the network is maximised. We propose efficient algorithms to solve the MLMTODA problem. Our simulations demonstrate that the proposed algorithm has a good performance for the MLMTODA problem.

Online publication date: Tue, 01-Mar-2011

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