Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Structural Information and Communication Complexity

SIROCCO 2009: Structural Information and Communication Complexity pp 2–14Cite as

On Efficient Gossiping in Radio Networks

  • Conference paper

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

Abstract

A communication network is very often modelled as a graph of connections in which the nodes exchange information (messages) via (un)directed links. An associated communication protocol determines the way the messages are exchanged. Among the most popular network models are: (1) the message passing model in which a node in one round can inform all its neighbours; (2) the telephone model also known as the matching model where in each round edges along which the exchange of messages is performed form a matching in the graph of connections. More recently, due to arrival of wireless technology (3) the radio network model attracted more attention in algorithms community. In this model, a message transmitted by a node is destined for all neighbours of this node. It is assumed, however, that due to interference a node can successfully receive a message if and only if exactly one of its neighbours transmits during this round.

The two most fundamental problems in relation to information dissemination are: broadcasting (one-to-all communication) and gossiping (total information exchange). In broadcasting, the goal is to distribute a piece of information (broadcast message) from a distinguished source node to all other nodes in the network. In gossiping, however, each node in the network is expected to distribute its own message to every other node in the network. A lot of attention has been given to the broadcasting problem that resulted in a large volume of efficient algorithmic solutions in the models described above. However, much less is known about gossiping. The latter problem is more complex algorithmically (in principle it is a simultaneous multiple-source broadcasting) thus it concerns more advanced communication strategies. Further study on efficient gossiping methods gained recently an extra motivation through an increasing interest in, e.g., information aggregation methods that propel fundamental applications in sensor networks. Also when the use of randomisation is permitted gossiping provides an interesting context for a distributed version of the coupon collector problem.

This paper is a short survey on the most important developments in efficient radio gossiping. We discuss deterministic as well as randomized methods of communication in the context of a variety of models taking into account knowledge in relation to the network size and topology, orientation of connections and the upper bound on the size of messages. Using this opportunity we also shed more light on several combinatorial structures and algorithmic solutions that emerged during studies on efficient radio broadcasting and gossiping.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. Journal of Computer and System Sciences 43, 290–298 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization. Journal of Computer and System Sciences 45, 104–126 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  3. Berenbrink, P., Cooper, C., Hu, Z.: Energy efficient randomised communication in unknown AdHoc networks. In: Proc. 19th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2007, pp. 250–259 (2007)

    Google Scholar 

  4. Cheng, Y., Du, D.Z.: New constructions of one- and two-stage pooling designs. Journal on Computational Biology 15, 195–205 (2008)

    Article  MathSciNet  Google Scholar 

  5. Chlamtac, I., Kutten, S.: On broadcasting in radio networks - problem analysis and protocol design. IEEE Transactions on Communications 33, 1240–1246 (1985)

    Article  MATH  Google Scholar 

  6. Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio networks. IEEE Transactions on Communications 39(9), 426–433 (1991)

    Article  Google Scholar 

  7. Chlebus, B.S., Gąsieniec, L., Östlin, A., Robson, J.M.: Deterministic Radio Broadcasting. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 717–728. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  8. Chlebus, B.S., Gąsieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. Distributed Computing 15(1), 27–38 (2002)

    Article  MATH  Google Scholar 

  9. Chlebus, B.S., Kowalski, D.R.: Almost Optimal Explicit Selectors. In: Liśkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 270–280. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Christersson, M., Gąsieniec, L., Lingas, A.: Gossiping with Bounded Size Messages in ad hoc Radio Networks. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 377–389. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Chrobak, M., Gąsieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. Journal on Algorithms 43(2), 177–189 (2002)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proc. 12th Annual ACM-SIAM symposium on Discrete algorithms, SODA 2001, pp. 709–718 (2001)

    Google Scholar 

  14. Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed broadcasting in radio networks of unknown topology. Theoretical Computer Science 302, 337–364 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  15. Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. Journal on Algorithms 60(2), 115–143 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  16. Czumaj, A., Wang, X.: Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 220–231. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. De Bonis, A., Gąsieniec, L., Vaccaro, U.: Optimal Two-Stage Algorithms for Group Testing Problems. SIAM Journal on Computing 34(5), 1253–1270 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  18. De Marco, G.: Distributed broadcast in unknown radio networks. In: Proc. of 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, pp. 208–217 (2008)

    Google Scholar 

  19. De Marco, G., Pelc, A.: Faster broadcasting in unknown radio networks. Information Processing Letters 79, 53–56 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  20. Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and Its Applications. World Scientific, River Edge (2000)

    MATH  Google Scholar 

  21. Elkin, M., Kortsarz, G.: An improved algorithm for radio broadcast. ACM Transactions on Algorithms 3(1), 1–21 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  22. Eppstein, D., Goodrich, M.T., Hirschberg, D.S.: Improved combinatorial group testing algorithms for real-world problem sizes. SIAM Journal on Computing 36, 1360–1375 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  23. Erdös, P., Frankl, P., Füredi, Z.: Families of finite sets in which no set is covered by the union of r others. Israel Journal of Mathematics 51, 75–89 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  24. Farach-Colton, M., Mosteiro, M.A.: Sensor Network Gossiping or How to Break the Broadcast Lower Bound. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 232–243. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  25. Gaber, I., Mansour, Y.: Centralized broadcast in multihop radio networks. Journal of Algorithms 46(1), 1–20 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  26. Galčík, F., Gąsieniec, L., Lingas, A.: Efficient broadcasting in known topology radio networks with long-range interference. In: Proc. 28th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2009, pp. 230–239 (2009)

    Google Scholar 

  27. Gąsieniec, L., Kantor, E., Kowalski, D.R., Peleg, D., Su, C.: Time efficient k-shot broadcasting in known topology radio networks. Distributed Computing 21(2), 117–127 (2008)

    Article  MATH  Google Scholar 

  28. Gąsieniec, L., Kranakis, E., Pelc, A., Xin, Q.: Deterministic M2M multicast in radio networks. Theoretical Computer Science 362(1-3), 196–206 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  29. Gąsieniec, L., Lingas, A.: On adaptive deterministic gossiping in ad hoc radio network. In: Proc. 13th Annual ACM-SIAM symposium on Discrete Algorithms, SODA 2002, pp. 689–690 (2002)

    Google Scholar 

  30. Gąsieniec, L., Pagourtzis, A., Potapov, I.: Deterministic Communication in Radio Networks with Large Labels. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 512–524. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  31. Gąsieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. Distributed Computing 19(4), 289–300 (2007)

    Article  MATH  Google Scholar 

  32. Gąsieniec, L., Potapov, I.: Gossiping with Unit Messages in Known Radio Networks. In: IFIP TCS 2002, pp. 193–205 (2002)

    Google Scholar 

  33. Gąsieniec, L., Potapov, I., Xin, Q.: Time efficient centralized gossiping in radio networks. Theoretical Computer Science 383(1), 45–58 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  34. Gąsieniec, L., Radzik, T., Xin, Q.: Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 397–407. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  35. Gupta, P., Kumar, P.R.: The Capacity of Wireless Networks. IEEE Transactions on Information Theory 46(2), 388–404 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  36. Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: Proc. of 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002, pp. 697–704 (2002)

    Google Scholar 

  37. Kautz, W.H., Singleton, R.R.: Nonrandom binary superimposed codes. IEEE Transactions on Information Theory 10, 363–377 (1964)

    Article  MATH  Google Scholar 

  38. Kowalski, D.R., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distributed Computing 18(1), 43–57 (2005)

    Article  MATH  Google Scholar 

  39. Kowalski, D.R., Pelc, A.: Optimal Deterministic Broadcasting in Known Topology Radio Networks. Distributed Computing 19(3), 185–195 (2007)

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  41. 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 

  42. Xin, Q., Manne, F.: Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks. In: Erlebach, T. (ed.) CAAN 2006. LNCS, vol. 4235, pp. 125–134. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  43. Peleg, D.: Deterministic radio broadcast with no topological knowledge (2000) (Manuscript)

    Google Scholar 

  44. Ravelomanana, V.: Optimal initialization and gossiping algorithms for random radio networks. IEEE Transactions on Parallel Distributed Systems 18(1), 17–28 (2007)

    Article  MathSciNet  Google Scholar 

  45. Strahler, A.N.: Hypsometric (area-altitude) analysis of erosional topology. Bulletin of Geological Society of America 63, 1117–1142 (1952)

    Article  Google Scholar 

  46. Vishkin, U.: Deterministic sampling - A new technique for fast pattern matching. SIAM Journal on Computing 20, 22–40 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  47. Xu, Y.: An O(n 3/2) deterministic algorithm for radio networks. Algorithmica 36(1), 93–96 (2003)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Authors
  1. Leszek Gąsieniec
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technion – Israel Institute of Technology, Dept. of Industrial Engineering and Management,, Technion City, 32000, Haifa, Israel

    Shay Kutten

  2. Faculty of Mechanical Engineering, University of Maribor, FS, Smetanova 17, 2000, Maribor, Slovenia

    Janez Žerovnik

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gąsieniec, L. (2010). On Efficient Gossiping in Radio Networks. In: Kutten, S., Žerovnik, J. (eds) Structural Information and Communication Complexity. SIROCCO 2009. Lecture Notes in Computer Science, vol 5869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11476-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11476-2_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11475-5

  • Online ISBN: 978-3-642-11476-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation