Encyclopedia of Algorithms

2008 Edition
| Editors: Ming-Yang Kao

Deterministic Broadcasting in Radio Networks

2000; Chrobak, Gąsieniec, Rytter
  • Leszek Gąsieniec
Reference work entry
DOI: https://doi.org/10.1007/978-0-387-30162-4_105

Keywords and Synonyms

Wireless networks; Dissemination of information; One-to-all communication        

Problem Definition

One of the most fundamental communication problems in wired as well as wireless networks is broadcasting, where one distinguished source node has a message that needs to be sent to all other 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, [13]). In some applications, collisions may be difficult to distinguish from the noise that is normally present on the channel, justifying the need for protocols that do not depend on the reliability of the collision detection mechanism (see [9,10]). Some network...

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

Recommended Reading

  1. 1.
    Bruschi, D., Del Pinto, M.: Lower Bounds for the Broadcast Problem in Mobile Radio Networks. Distrib. Comput. 10(3), 129–135 (1997)CrossRefGoogle Scholar
  2. 2.
    Chlebus, B.S., Gąsieniec, L., Gibbons, A.M., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. Distrib. Comput. 15(1), 27–38 (2002)CrossRefGoogle Scholar
  3. 3.
    Chlebus, M., Gąsieniec, L., Östlin, A., Robson, J.M.: Deterministic broadcasting in radio networks. In: Proc. 27th International Colloquium on Automata, Languages and Programming.LNCS, vol. 1853, pp. 717–728, Geneva, Switzerland (2000)Google Scholar
  4. 4.
    Chlebus, B.S., Kowalski, D.R.: Almost Optimal Explicit Selectors. In: Proc. 15th International Symposium on Fundamentals of Computation Theory, pp. 270–280, Lübeck, Germany (2005)Google Scholar
  5. 5.
    Chrobak, M., Gąsieniec, L., Rytter, W.: Fast Broadcasting and Gossiping in Radio Networks,. In: Proc. 41st Annual Symposium on Foundations of Computer Science, pp. 575–581, Redondo Beach, USA (2000) Full version in J. Algorithms 43(2) 177–189 (2002)Google Scholar
  6. 6.
    Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. J. Algorithms 60(2), 115–143 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    De Bonis, A., Gąsieniec, L., Vaccaro, U.: Optimal Two-Stage Algorithms for Group Testing Problems. SIAM J. Comput. 34(5), 1253–1270 (2005)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    De Marco, G., Pelc, A.: Faster broadcasting in unknown radio networks. Inf. Process. Lett. 79(2), 53–56 (2001)zbMATHCrossRefGoogle Scholar
  9. 9.
    Ephremides, A., Hajek, B.: Information theory and communication networks: an unconsummated union. IEEE Trans. Inf. Theor. 44, 2416–2434 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Gallager, R.: A perspective on multiaccess communications. IEEE Trans. Inf. Theor. 31, 124–142 (1985)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 697–704, San Francisco, USA (2002)Google Scholar
  12. 12.
    Kowalski, D.R., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distr. Comput. 18(1), 43–57 (2005)CrossRefGoogle Scholar
  13. 13.
    Massey, J.L., Mathys, P.: The collision channel without feedback. IEEE Trans. Inf. Theor. 31, 192–204 (1985)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2008

Authors and Affiliations

  • Leszek Gąsieniec
    • 1
  1. 1.Department of Computer ScienceUniversity of LiverpoolLiverpoolUK