On complexity of wireless gathering problems on unit-disk graphs

Authors:
Nikola Milosavljević
Affiliations:
Max-Planck-Institut für Informatik, Saarbrücken, Germany
Venue:
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Year:
2011

Citing 6
Cited 0

End-to-end packet-scheduling in wireless ad-hoc networks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Hardness and approximation of Gathering in static radio networks

PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Ad hoc networks beyond unit disk graphs

Wireless Networks
Universality considerations in VLSI circuits

IEEE Transactions on Computers
Minimizing flow time in the wireless gathering problem

ACM Transactions on Algorithms (TALG)
The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the problem of efficient gathering of data from a wireless network to a single sink node. Network's communication and interference pattern are assumed to be captured by the unit-disk model. We consider the objective of minimizing the maximum latency (the time between release and delivery of a packet). We prove that the problem is NP-complete even when all packets are released from the same source node, or at the same time. To our knowledge, these are the first results about the wireless gathering problem in the plane. They can be seen as an extension of recent inapproximability results of Bonifaci et al., which hold in three dimensions.