Improved minimum latency aggregation scheduling in wireless sensor networks under the SINR model
by Zhaoquan Gu; Guanyu Wang; Qiang-Sheng Hua; Yuexuan Wang
International Journal of Sensor Networks (IJSNET), Vol. 14, No. 1, 2013

Abstract: Wireless sensor networks are attracting much attention from the world and Minimum Latency Aggregation Scheduling (MLAS) has become one of the most significant fundamental problems in wireless sensor networks. However, there are few results about efficient data aggregation algorithms under the Signal-to-Interference-plus-Noise-Ratio (SINR) model. In this paper, we propose a centralised algorithm to aggregate data from all sources in O(log²n) time slots where n is the total number of nodes. To the best of our knowledge, this is the current best result for the problem. This algorithm uses round scheduling, topology construction and non-linear power assignment as the main techniques. We give a detailed proof of correctness, also an aggregation latency analysis of the algorithm as well as the parameter constraints to achieve our result.

Online publication date: Tue, 10-Sep-2013

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