Skip to main content
SpringerLink
Log in

Sensor Network Gossiping or How to Break the Broadcast Lower Bound

  • Conference paper
Book cover Algorithms and Computation (ISAAC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4835))

Included in the following conference series:

Abstract

Gossiping is an important problem in Radio Networks that has been well studied, leading to many important results. Due to strong resouce limitations of sensor nodes, previous solutions are frequently not feasible in Sensor Networks. In this paper, we study the gossiping problem in the restrictive context of Sensor Networks. By exploiting the geometry of sensor node distributions, we present reduced, optimal running time of O(D + Δ) for an algorithm that completes gossiping with high probability in a Sensor Network of unknown topology and adversarial wake-up, where D is the diameter and Δ the maximum degree of the network. Given that an algorithm for gossiping also solves the broadcast problem, our result proves that the classic lower bound of [16] can be broken if nodes are allowed to do preprocessing.

This research was supported in part by NSF grants CCF0621425, CCF 05414009, CCF 0632838, and DIMACS, Center for Discrete Mathematics & Theoretical Computer Science, grant numbered NSF CCR 00-87022.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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. 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, 104–126 (1992)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Bruschi, D., Pinto, M.D.: Lower bounds for the broadcast problem in mobile radio networks. Distributed Computing 10(3), 129–135 (1997)

    Article  Google Scholar 

  4. Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop networks. In: Proc. of INFOCOM (1987)

    Google Scholar 

  5. Chlebus, B., Ga̧sieniec, L., Lingas, A., Pagourtzis, A.: Oblivious gossiping in ad-hoc radio networks. In: Proc. of 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 44–51 (2001)

    Google Scholar 

  6. Chrobak, M., Ga̧sieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In: Proc. of the 41st IEEE Annual Symp. on Foundation of Computer Science (2000)

    Google Scholar 

  7. Chrobak, M., Ga̧sieniec, L., Rytter, W.: A randomized algorithm for gossiping in radio networks. Networks 43(2), 119–124 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. Clementi, A., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proc. of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (2001)

    Google Scholar 

  9. Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: Proc. of the 44th IEEE Annual Symp. on Foundation of Computer Science (2003)

    Google Scholar 

  10. Farach-Colton, M., Fernandes, R.J., Mosteiro, M.A.: Bootstrapping a hop-optimal network in the weak sensor model. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 827–838. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Fejes-Tóth, L.: über einen geometrischen satz. Mathematische Zeitschrift 46(1), 83–85 (1940)

    Article  MathSciNet  Google Scholar 

  12. Ga̧sieniec, L., Potapov, I.: Gossiping with unit messages in known radio networks. In: Proc. of 17th IFIP World Computer Congress / 2nd IFIP International Conference on Theoretical Computer Science (2002)

    Google Scholar 

  13. Geréb-Graus, M., Tsantiles, T.: Efficient optical communication in parallel computers. In: 4th Annual ACM Symposium on Parallel Algorithms and Architectures pp. 41–48 (1992)

    Google Scholar 

  14. Kowalski, D.R.: On selection problem in radio networks. In: Proceedings 24th Annual ACM Symposium on Principles of Distributed Computing, pp. 158–166 (2005)

    Google Scholar 

  15. Kowalski, D.R., Pelc, A.: Time of deterministic broadcasting in radio networks with local knowledge. SIAM Journal on Computing 33(4), 870–891 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  16. Kushilevitz, E., Mansour, Y.: An Ω(Dlog(N/D)) lower bound for broadcast in radio networks. SIAM Journal on Computing 27(3), 702–712 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  17. Liu, D., Prabhakaran, M.: On randomized broadcasting and gossiping in radio networks. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 340–349. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  18. Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)

    MATH  Google Scholar 

  19. Moscibroda, T., Wattenhofer, R.: Maximal independent sets in radio networks. Technical Report TR-478, Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland (December 2004)

    Google Scholar 

  20. Ravelomanana, V.: Optimal initialization and gossiping algorithms for random radio networks. IEEE Trans. Parallel Distr. Syst. 18(1), 17–28 (2007)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Rutgers University, Piscataway, NJ 08854, USA

    Martín Farach-Colton & Miguel A. Mosteiro

Authors
  1. Martín Farach-Colton
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miguel A. Mosteiro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Takeshi Tokuyama

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Farach-Colton, M., Mosteiro, M.A. (2007). Sensor Network Gossiping or How to Break the Broadcast Lower Bound . In: Tokuyama, T. (eds) Algorithms and Computation. ISAAC 2007. Lecture Notes in Computer Science, vol 4835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77120-3_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77120-3_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77118-0

  • Online ISBN: 978-3-540-77120-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation