Maximum-lifetime data aggregation for wireless sensor networks with cooperative communication
by Hongli Xu; Liusheng Huang; Haipei Sun
International Journal of Sensor Networks (IJSNET), Vol. 20, No. 3, 2016

Abstract: Cooperative communication becomes an attractive technology to avoid the signal fading for wireless transmissions. Multiple nodes can cooperatively transmit the data packets to a receiver so as to improve the spatial diversity and save the power consumption. As data aggregation is one of the most important operations for surveillance applications, this paper studies the maximum-lifetime data aggregation with cooperative communication (MLDAC) in wireless sensor networks. We first analyse the optimal power allocation for cooperative data aggregation, and propose the LPS algorithm which maximises the network lifetime through iteratively adjusting the selection of the cooperative node pairs. We also present a distributed algorithm (called DLPS), in which each node decides to participate into the cooperative transmission only with local information. The simulation results show that the LPS and DLPS algorithms will help to prolong the network lifetime by 17.9% and 12.7% compared with the traditional algorithm.

Online publication date: Thu, 17-Mar-2016

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