Abstract
The Wireless Gathering Problem is to find a schedule for data gathering in a wireless static network. The problem is to gather a set of messages from the nodes in the network at which they originate to a central node, representing a powerful base station. The objective is to minimize the time to gather all messages. The sending pattern or schedule should avoid interference of radio signals, which distinguishes the problem from wired networks.
We study the Wireless Gathering Problem from a combinatorial optimization point of view in a centralized setting. This problem is known to be NP-hard when messages have no release time. We consider the more general case in which messages may be released over time. For this problem we present a polynomial-time on-line algorithm which gives a 4-approximation. We also show that within the class of shortest path following algorithms no algorithm can have approximation ratio better than 4. We also formulate some challenging open problems concerning complexity and approximability for variations of the problem.
Work of the first author is partly supported by Dutch Ministry of Education, Culture and Science through a Huygens scholarship. Work of the first and third author is partly supported by EU FET Integrated Project AEOLUS, IST- 15964. Work of the authors is partly supported by EU COST-action 293, Graal.
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
Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization. Journal of Computer and System Sciences 45(1), 104–126 (1992)
Bar-Yehuda, R., Israeli, A., Itai, A.: Multiple communication in multihop radio networks. SIAM Journal on Computing 22(4), 875–887 (1993)
Bermond, J., Galtier, J., Klasing, R., Morales, N., Pérennes, S.: Hardness and approximation of gathering in static radio networks. In: FAWN 2006, Pisa, Italy (2006)
Bhatt, S.N., Pucci, G., Ranade, A., Rosenberg, A.L.: Scattering and gathering messages in networks of processors. IEEE Trans. Comput. 42(8), 938–949 (1993)
Fraigniaud, P., Lazard, E.: Methods and problems of communication in usual networks. Discrete Appl. Math. 53, 79–133 (1994)
Haenggi, M.: Opportunities and challenges in wireless sensor networks. In: Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems. CRC Press, Boca Raton (2004)
IEEE Standard 802.11, Information technology-—Telecommunications and information exchange between systems-—Local and metropolitan area networks-—Specific requirements-—Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications (1999)
Ilyas, M., Mahgoub, I.: Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems. CRC Press, Boca Raton (2004)
Pahlavan, K., Levesque, A.H.: Wireless information networks. Wiley-Interscience, New York (1995)
Perkins, C.E.: Ad hoc networking. Addison-Wesley Longman Publishing Co.,Inc., Boston (2001)
Su, W., Cayirci, E., Akan, O.: Overview of communication protocols for sensor networks. In: Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems. CRC Press, Boca Raton (2004)
Tse, D., Viswanath, P.: Fundamentals of Wireless Communication. Cambridge University Press, Cambridge (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonifaci, V., Korteweg, P., Marchetti-Spaccamela, A., Stougie, L. (2006). An Approximation Algorithm for the Wireless Gathering Problem. In: Arge, L., Freivalds, R. (eds) Algorithm Theory – SWAT 2006. SWAT 2006. Lecture Notes in Computer Science, vol 4059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11785293_31
Download citation
DOI: https://doi.org/10.1007/11785293_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35753-7
Online ISBN: 978-3-540-35755-1
eBook Packages: Computer ScienceComputer Science (R0)