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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balakrishnan, H., Barrett, C.L., Kumar, V.S.A., Marathe, M.V., Thite, S.: 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 22, 1069–1079 (2004)
Bermond, J.-C., Morales, N., Perennes, S., Galtier, J., Klasing, R.: Hardness and approximation of gathering in static radio networks. In: IEEE International Conference on Pervasive Computing and Communications Workshops, pp. 75–79 (2006)
V. Bonifaci, P. Korteweg, A. Marchetti-Spaccamela, L. Stougie. Minimizing flow time in the wireless gathering problem. ACM Transactions on Algorithms (accepted for publication)
Kuhn, F., Wattenhofer, R., Zollinger, A.: Ad Hoc Networks Beyond Unit Disk Graphs. Wireless Networks 14(5), 715–729 (2008)
Anil Kumar, V.S., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: End-to-end packet-scheduling in wireless ad-hoc networks. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, pp. 1021–1030. Society for Industrial and Applied Mathematics, Philadelphia (2004)
Shiloach, Y.: Arrangements of Planar Graphs on the Planar Lattice. PhD thesis, Weizmann Institute of Science, Rehovot, Israel (1976)
Stockmeyer, L.J., Vazirani, V.V.: NP-Completeness of Some Generalizations of the Maximum Matching Problem. Inf. Process. Lett. 15(1), 14–19 (1982)
Valiant, L.G.: Universality Considerations in VLSI Circuits. IEEE Trans. Computers 30(2), 135–140 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Milosavljević, N. (2011). On Complexity of Wireless Gathering Problems on Unit-Disk Graphs. In: Frey, H., Li, X., Ruehrup, S. (eds) Ad-hoc, Mobile, and Wireless Networks. ADHOC-NOW 2011. Lecture Notes in Computer Science, vol 6811. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22450-8_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-22450-8_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22449-2
Online ISBN: 978-3-642-22450-8
eBook Packages: Computer ScienceComputer Science (R0)