Time-efficient broadcasting in radio networks: a review

  • Authors:
  • David Peleg

  • Affiliations:
  • Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot, Israel

  • Venue:
  • ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Broadcasting is a basic network communication task, where a message initially held by a source node has to be disseminated to all other nodes in the network. Fast algorithms for broadcasting in radio networks have been studied in a wide variety of different models and under different requirements. Some of the main parameters giving rise to the different variants of the problem are the accessibility of knowledge about the network topology, the availability of collision detection mechanisms, the wake-up mode, the topology classes considered, and the use of randomness. The paper reviews the literature on time-efficient broadcasting algorithms for radio networks under a variety of models and assumptions.