The time complexity of deterministic broadcast radio networks Original Research Article

Bar-Yehuda, Goldreich and Itai studied both the probabilistic and the deterministic time complexity of broadcast in a multihop network. They show that in the deterministic case the number of time-slots needed for successful broadcast is lower bounded by the numbers of moves of two associated games. They also obtain lower bounds for the numbers of moves in these games. In this paper we determine the exact numbers of moves and time-slots needed in the games and in broadcasting.