Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Algorithms pp 731–732Cite as

Randomized Gossiping in Radio Networks

2001; Chrobak, Gąsieniec, Rytter

  • Reference work entry

  • 137 Accesses

Keywords and Synonyms

Wireless networks; Broadcast ; Gossip ; Total exchange of information ; All-to-all communication      

Problem Definition

The two classical problems of disseminating information in computer networks are broadcasting and gossiping. In broadcasting, the goal is to distribute a message from a distinguished source node to all other nodes in the networks. In gossiping, each node v in the network initially contains a message \( { m_v, } \) and the task is to distribute each message m v to all nodes in the network.

The radio network abstraction captures the features of distributed communication networks with multi-access channels, with minimal assumptions on the channel model and processors' knowledge. Directed edges model uni-directional links, including situations in which one of two adjacent transmitters is more powerful than the other. In particular, there is no feedback mechanism (see, for example, [6]). In some applications, collisions may be difficult to distinguish...

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   399.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Recommended Reading

  1. Chrobak, M., Gąsieniec, L., Rytter, W.: A Randomized Algorithm for Gossiping in Radio Networks. In: Proc. 8th Annual International Computing Combinatorics Conference. Guilin, China, pp. 483–492 (2001) Full version in Networks 43(2), 119–124 (2004)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Ephremides, A., Hajek, B.: Information theory and communication networks: an unconsummated union. IEEE Trans. Inf. Theor. 44, 2416–2434 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Gallager, R.: A perspective on multiaccess communications. IEEE Trans. Inf. Theor. 31, 124–142 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  5. Liu, D., Prabhakaran, M.: On randomized broadcasting and gossiping in radio networks. In: Proc. 8th Annual International Computing Combinatorics Conference, pp. 340-349, Singapore (2002)

    Google Scholar 

  6. Massey, J.L., Mathys, P.: The collision channel without feedback. IEEE Trans. Inf. Theor. 31, 192–204 (1985)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Liverpool, Liverpool, UK

    Leszek Gąsieniec

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. Department of Electrical Engineering and Computer ScienceMcCormick School of Engineering and Applied Science, Northwestern University, Evanston, IL, 60208, USA

    Ming-Yang Kao Professor of Computer Science

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Gąsieniec, L. (2008). Randomized Gossiping in Radio Networks. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_324

Download citation

Publish with us

Policies and ethics

Search

Navigation