Skip to main content
SpringerLink
Log in

Data Gathering in Wireless Networks

  • Chapter
  • First Online:
Graphs and Algorithms in Communication Networks

Part of the book series: Texts in Theoretical Computer Science. An EATCS Series ((TTCS))

Abstract

In this chapter, we address the problem of gathering information in a specific node of a radio network when interference constraints are present. Nodes can communicate data using a radio device; we consider a synchronous time model, where time is divided into rounds. The interference constraints limit the possibility of simultaneous data communication of nodes to the same region of the network. The survey focuses on two interference models, the general interference model and the distance-2 interference model. We survey recent complexity results and approximation algorithms for several variants of the problem. We consider several interference scenarios, the uniform and non-uniform data models, different optimization parameters, and the off-line and online settings of the problem. The objective functions we consider are the minimization of maximum completion time, maximum flow time, and average flow time.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Computer Networks 38(4), 393–422 (2002)

    Article  Google Scholar 

  2. Ausiello, G., Protasi, M., Marchetti-Spaccamela, A., Gambosi, G., Crescenzi, P., Kann, V.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer (1999)

    Google Scholar 

  3. 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)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bar-Yehuda, R., Israeli, A., Itai, A.: Multiple communication in multihop radio networks. SIAM Journal on Computing 22(4), 875–887 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bermond, J. C., Corrêa, R. C., Yu, M. L.: Gathering algorithms on paths under interference constraints. In: Proceedings of the 6th Italian Conference Algorithms and Complexity, Lecture Notes in Computer Science, vol. 3998, pp. 115–126. Springer (2006). Full version to appear in Discrete Mathematics

    Google Scholar 

  6. Bermond, J. C., Galtier, J., Klasing, R., Morales, N., Pérennes, S.: Gathering in specific radio networks. In: 8èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, pp. 85–88. Trégastel, France (2006)

    Google Scholar 

  7. Bermond, J. C., Galtier, J., Klasing, R., Morales, N., Pérennes, S.: Hardness and approximation of gathering in static radio networks. Parallel Processing Letters 16(2), 165–183 (2006)

    Article  MathSciNet  Google Scholar 

  8. Bermond, J. C., Galtier, J., Klasing, R., Morales, N., Pérennes, S.: Hardness and approximation of gathering in static radio networks. In: Proc. Foundation and Algorithms for Wireless Networking, pp. 75–79. Pisa, Italy (2006)

    Google Scholar 

  9. Bermond, J. C., Gargano, L., Rescigno, A.: Gathering with minimum delay in tree sensor networks. In: Proceedings of the 15th International Colloquium on Structural Information and Communication Complexity, Lecture Notes in Computer Science, vol. 5058, pp. 262–276. Springer (2008)

    Google Scholar 

  10. Bermond, J. C., Peters, J.: Efficient gathering in radio grids with interference. In: Septiémes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, pp. 103–106. Presqu’île de Giens, France (2005)

    Google Scholar 

  11. Bermond, J. C., Yu, M. L.: Optimal gathering algorithms in multi-hop radio tree networks with interferences. In: Proc. of the Int. Conf. on Ad-Hoc, Mobile, and Wireless Networks, pp. 204–217 (2008)

    Google Scholar 

  12. Bertin, P., Bresse, J. F., Sage, B.: Accès haut débit en zone rurale: une solution “ad hoc”. France Telecom R & D 22, 16–18 (2005)

    Google Scholar 

  13. Bonifaci, V., Korteweg, P., Marchetti-Spaccamela, A., Stougie, L.: An approximation algorithm for the wireless gathering problem. Operations Research Letters 36(5), 605–608 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  14. Bonifaci, V., Korteweg, P., Marchetti-Spaccamela, A., Stougie, L.: The distributed wireless gathering problem. In: Proc. Int. Conf. on Algorithmic Aspects in Information and Management, Lecture Notes in Computer Science, vol. 5034, pp. 72–83. Springer (2008)

    Google Scholar 

  15. Bonifaci, V., Korteweg, P., Marchetti-Spaccamela, A., Stougie, L.: Minimizing average flow time in sensor data gathering. In: Proc. 4th Workshop on Algorithmic Aspects of Wireless Sensor Networks, Lecture Notes in Computer Science, vol. 5389, pp. 18–29. Springer (2008)

    Google Scholar 

  16. Bonifaci, V., Korteweg, P., Marchetti-Spaccamela, A., Stougie, L.: Minimizing flow time in the wireless gathering problem. In: Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, pp. 109–120 (2008)

    Google Scholar 

  17. Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press (1998)

    Google Scholar 

  18. Boukerche, A. (ed.): Handbook of Algorithms for Wireless Networking and Mobile Computing. Chapman & Hall (2005)

    Google Scholar 

  19. Cidon, I., Kutten, S., Mansour, Y., Peleg, D.: Greedy packet scheduling. SIAM Journal on Computing 24(1), 148–157 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  20. Coleri, S.: PEDAMACS: Power Efficient and Delay Aware Medium Access Protocol for Sensor Networks. Master’s thesis, University of California, Berkeley (2002)

    Google Scholar 

  21. Duckworth, W., Manlove, D., Zito, M.: On the approximability of the maximum induced matching problem. Journal of Discrete Algorithms 3(1), 79–91 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  22. Florens, C., Franceschetti, M., McEliece, R. J.: Lower bounds on data collection time in sensory networks. IEEE Journal on Selected Areas in Communications 22, 1110– 1120 (2004)

    Article  Google Scholar 

  23. Garey, M. R., Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)

    Google Scholar 

  24. Gargano, L.: Time optimal gathering in sensor networks. In: Proceedings of the 14th International Colloquium on Structural Information and Communication Complexity, Lecture Notes in Computer Science, vol. 4474, pp. 7–10. Springer (2007)

    Google Scholar 

  25. Gargano, L., Rescigno, A. A.: Optimally fast data gathering in sensor networks. In: Proceedings of the 31st Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 4162, pp. 399–411. Springer (2006)

    Google Scholar 

  26. Hromkovič, J.: Algorithmics for Hard Problems — Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics. Springer (2001)

    Google Scholar 

  27. Klasing, R., Morales, N., Pérennes, S.: On the complexity of bandwidth allocation in radio networks. Theoretical Computer Science 406, 225–239 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  28. Korteweg, P.: Online Gathering Algorithms for Wireless Networks. Ph.D. thesis, Eindhoven Technical University (2008)

    Google Scholar 

  29. Kumar, V. S. A., Marathe, M. V., Parthasarathy, S., Srinivasan, A.: End-to-end packet-scheduling in wireless ad-hoc networks. In: J. I. Munro (ed.) Proceedings of the 15th Symposium on Discrete Algorithms, pp. 1021–1030 (2004)

    Google Scholar 

  30. Morales, N.: Algorithmique de réseaux de communication radio modelisés par de graphes. PhD thesis, Université de Nice-Sophia Antipolis (2007)

    Google Scholar 

  31. Papadimitriou, C. H.: Computational Complexity. Addison-Wesley (1994)

    Google Scholar 

  32. Perkins, C. E. (ed.): Ad Hoc Networking. Addison-Wesley Professional (2001)

    Google Scholar 

  33. Pottie, G. J., Kaiser, W. J.: Wireless integrated network sensors. Communications of the ACM 43(5), 51–58 (2000)

    Article  Google Scholar 

  34. Raghavendra, C. S., Sivalingam, K. M., Znati, T. (eds.): Wireless Sensor Networks. Springer (2004)

    Google Scholar 

  35. Revah, Y., Segal, M.: Improved algorithms for data-gathering time in sensor networks II: Ring, tree and grid topologies. In: Proc. of the 3rd IEEE Int. Conf. on Networking and Services (2007)

    Google Scholar 

  36. Revah, Y., Segal, M.: Improved lower bounds for data-gathering time in sensor networks. In: Proc. of the 3rd IEEE Int. Conf. on Networking and Services (2007)

    Google Scholar 

  37. Schmid, S., Wattenhofer, R.: Algorithmic models for sensor networks. In: Proceedings of the 20th International Parallel and Distributed Processing Symposium (2006)

    Google Scholar 

  38. Segal, M., Yedidsion, L.: On real time data-gathering in sensor networks. In: Proc. of the 3rd IEEE Int. Conf. on Mobile, Adhoc and Sensor Systems (2007)

    Google Scholar 

  39. Vazirani, V. V.: Approximation Algorithms. Springer, Berlin (2001)

    Google Scholar 

  40. Yao, A. C. C.: Probabilistic computations: Towards a unified measure of complexity. In: Proc. of the 18th Symp. on the Foundations of Computer Science, pp. 222–227 (1977)

    Google Scholar 

Download references

Acknowledgements

This work was supported by EU COST action 293 – Graphs and Algorithms in Communication Networks (GRAAL). Research of the authors was partially supported by the Future and Emerging Technologies Unit of EC (IST priority – 6th FP) under contract no. FP6–021235–2 (project ARRIVAL), by the Dutch BSIK–BRICKS project, by EU ICT–FET 215270 FRONTS, by MIUR–FIRB Italy–Israel project RBIN047MH9, by ANR–project ALADDIN (France), by the project CEPAGE of INRIA (France), and by European project COST Action 295 Dynamic Communication Networks (DYNAMO).

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria Elettrica e dell’Informazione, Università degli Studi dell’Aquila, Poggio di Roio, 67040, L’Aquila, Italy

    Vincenzo Bonifaci

  2. Dipartimento di Informatica e Sistemistica, Sapienza Università di Roma, Roma, Italy

    Vincenzo Bonifaci & Alberto Marchetti-Spaccamela

  3. CNRS - LaBRI, Université Bordeaux 1, Talence cedex, France

    Ralf Klasing

  4. Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands

    Peter Korteweg

  5. Department of Economics and Business Administration, Free University, De Boelelaan 1105, 1081 HV, Amsterdam, The Netherlands

    Leen Stougie

  6. CWI, Amsterdam, The Netherlands

    Leen Stougie

Authors
  1. Vincenzo Bonifaci
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ralf Klasing
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peter Korteweg
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Leen Stougie
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Alberto Marchetti-Spaccamela
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Vincenzo Bonifaci , Ralf Klasing , Peter Korteweg , Leen Stougie or Alberto Marchetti-Spaccamela .

Editor information

Editors and Affiliations

  1. LS II für Mathematik, RWTH Aachen, Templergraben 55, Aachen, 52056, Germany

    Arie Koster

  2. Depto. Matematica Aplicada IV, Universitat Politècnica de Catalunya, C. Jordi Girona 1-3, Barcelona, 08034, Spain

    Xavier Muñoz

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bonifaci, V., Klasing, R., Korteweg, P., Stougie, L., Marchetti-Spaccamela, A. (2009). Data Gathering in Wireless Networks. In: Koster, A., Muñoz, X. (eds) Graphs and Algorithms in Communication Networks. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02250-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02250-0_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02249-4

  • Online ISBN: 978-3-642-02250-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation