An Approximation Algorithm for the Wireless Gathering Problem

  • Vincenzo Bonifaci
  • Peter Korteweg
  • Alberto Marchetti-Spaccamela
  • Leen Stougie
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4059)


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.


Short Path Completion Time Medium Access Control Greedy Algorithm Release Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Bar-Yehuda, R., Israeli, A., Itai, A.: Multiple communication in multihop radio networks. SIAM Journal on Computing 22(4), 875–887 (1993)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    Fraigniaud, P., Lazard, E.: Methods and problems of communication in usual networks. Discrete Appl. Math. 53, 79–133 (1994)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Ilyas, M., Mahgoub, I.: Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems. CRC Press, Boca Raton (2004)CrossRefGoogle Scholar
  9. 9.
    Pahlavan, K., Levesque, A.H.: Wireless information networks. Wiley-Interscience, New York (1995)Google Scholar
  10. 10.
    Perkins, C.E.: Ad hoc networking. Addison-Wesley Longman Publishing Co.,Inc., Boston (2001)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    Tse, D., Viswanath, P.: Fundamentals of Wireless Communication. Cambridge University Press, Cambridge (2005)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Vincenzo Bonifaci
    • 1
    • 2
  • Peter Korteweg
    • 1
  • Alberto Marchetti-Spaccamela
    • 2
  • Leen Stougie
    • 1
    • 3
  1. 1.Department of Mathematics and Computer ScienceEindhoven University of TechnologyEindhovenThe Netherlands
  2. 2.Department of Computer and Systems ScienceUniversity of Rome “La Sapienza”RomeItaly
  3. 3.CWIAmsterdamThe Netherlands

Personalised recommendations