A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Comparison between graph-based and interference-based STDMA scheduling
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Broadcast Scheduling in Interference Environment
IEEE Transactions on Mobile Computing
Data Gathering Schedule for Minimal Aggregation Time in Wireless Sensor Networks
International Journal of Distributed Sensor Networks
Unit disk graph and physical interference model: Putting pieces together
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
Energy efficient routing and scheduling for real-time data aggregation in WSNs
Computer Communications
A Note on Uniform Power Connectivity in the SINR Model
Algorithmic Aspects of Wireless Sensor Networks
Minimum-latency aggregation scheduling in wireless sensor networks under physical interference model
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
A Delay-Efficient Algorithm for Data Aggregation in Multihop Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
The capacity of wireless networks
IEEE Transactions on Information Theory
Deterministic distributed data aggregation under the SINR model
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Minimum latency aggregation scheduling for arbitrary tree topologies under the SINR model
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
| Hi-index | 0.00 |
Data aggregation has been the focus of many researchers as one of the most important applications in Wireless Sensor Networks. A main issue of data aggregation is how to construct efficient schedules by which data can be aggregated without any interference. The problem of constructing minimum latency data aggregation schedules (MLAS) has been extensively studied in the literature although most of existing works use the graph-based interference model. In this paper, we study the MLAS problem in the more realistic physical model known as Signal-to-Interference-Noise-Ratio (SINR) where few works exist and algorithms that guarantee theoretical performances are scarce [17, 16]. We first derive an © (log n) approximation lower bound for the MLAS problem in the metric SINR model. We also prove the NP-completeness of the decision version of MLAS in the geometric SINR model. This is a significant contribution as these results have not been obtained before for the SINR model. In addition, we propose a constant factor approximation algorithm whose latency is bounded by O(Δ+R) for the dual power model, where Δ is the maximum node degree of a network and R is the network radius. Finally we study the performance of the algorithms through simulation.