Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/12563
Title: Data aggregation scheduling in uncoordinated duty-cycled wireless sensor networks under protocol interference model
Authors: Jiao, X
Lou, W 
Wang, X
Cao, J 
Xu, M
Zhou, X
Keywords: Approximation algorithms
Breadth-first-search
Data aggregation scheduling
Duty cycle
Protocol interference model
Wireless sensor networks
Issue Date: 2012
Source: Ad-Hoc and sensor wireless networks, 2012, v. 15, no. 2-4, p. 315-338 How to cite?
Journal: Ad-Hoc and Sensor Wireless Networks 
Abstract: Data aggregation is a critical and widely-used operation in wireless sensor networks (WSNs). Data aggregation scheduling (DAS) aims to find an interference-free scheduling for data aggregation with the minimum latency. Most existing algorithms for the DAS problem, unfortunately, assume that nodes are always active, and hence are not suitable for duty-cycled scenarios. In this paper, we investigate the DAS problem in uncoordinated duty-cycled WSNs (DAS-UDC problem) under protocol interference model and prove its NP-hardness. To solve this problem, we propose two novel approximation algorithms called SDAS and CDAS with the data aggregation latency of at most O(R s + Δ) and O(R + Δ) respectively, where Rs, Δ and R are the maximum depth of the breadthfirst- search tree rooted at the sink node s, the maximum node degree and the graph-theoretic radius of the network respectively.We conduct extensive simulations to evaluate the performance of our algorithms and report their average performance.
URI: http://hdl.handle.net/10397/12563
ISSN: 1551-9899
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

3
Last Week
0
Last month
0
Citations as of Oct 16, 2017

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
0
Citations as of Oct 17, 2017

Page view(s)

47
Last Week
4
Last month
Checked on Oct 22, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.