Minimum latency aggregation scheduling for arbitrary tree topologies under the SINR model

Authors:
Guanyu Wang;Qiang-Sheng Hua;Yuexuan Wang
Affiliations:
Institute for Interdisciplinary Information Science, Tsinghua University, China;Institute for Interdisciplinary Information Science, Tsinghua University, China;Institute for Interdisciplinary Information Science, Tsinghua University, China
Venue:
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Year:
2012

Citing 13
Cited 0

Topology control meets SINR: the scheduling complexity of arbitrary topologies

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
The worst-case capacity of wireless sensor networks

Proceedings of the 6th international conference on Information processing in sensor networks
Complexity in geometric SINR

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Minimum-latency aggregation scheduling in multihop wireless networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Improved Algorithms for Latency Minimization in Wireless Networks

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Wireless Communication Is in APX

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
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
Maximizing capacity with power control under physical interference model in simplex mode

WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Minimum latency data aggregation in the physical interference model

Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Wireless connectivity and capacity

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Minimum data aggregation time problem in wireless sensor networks

MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
A constant-factor approximation for wireless capacity maximization with power control in the SINR model

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The capacity of wireless networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Almost all the existing wireless data aggregation approaches need a topology construction step before scheduling. These solutions assume the availability of flexible topology controls. However, in real scenarios, lots of factors (impenetrable obstacles, barriers, etc.) limit the topology construction for wireless networks. In this paper we study a new problem called Minimum-Latency Aggregation Scheduling for Arbitrary Tree Topologies (MLAT). We first provide an NP-hardness proof for MLAT. Second, we draw an important conclusion that two frequently used greedy scheduling algorithms result in a large overhead compared with the optimal solution: the scheduling latency generated by these two greedy solutions are $\sqrt{n}$ times the optimal result, where n is the total number of links. We finally present an approximation algorithm for MLAT which works well for the tree with a small depth. All the above results are based on the SINR (Signal-to-Interference-plus-Noise Ratio) model.