Centralized broadcast in multihop radio networks

Iris Gaber, Yishay Mansour*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We show that for any radio network there exists a schedule of a broadcast whose time is O(D+log5 n), where D is the diameter and n is the number of nodes. (This result implies an optimal broadcast to networks with D = Ω(log5 n).) We present a centralized randomized polynomial time algorithm that given a network and a source, outputs a schedule for broadcasting the message from the source to the rest of the network.

Original languageEnglish
Pages (from-to)1-20
Number of pages20
JournalJournal of Algorithms
Issue number1
StatePublished - Jan 2003


  • Algorithms
  • Broadcast
  • Radio networks


Dive into the research topics of 'Centralized broadcast in multihop radio networks'. Together they form a unique fingerprint.

Cite this