A lower bound for radio broadcast (Q1176103)

A new --- graph oriented model for dealing with broadcasting in radio networks is proposed. The authors consider a radio network as a unidirectional, multihop network of nodes (processors) that communicate in synchronous time-slots. They prove the existence of a family of radius -2 networks with \(n\) nodes for which any broadcast schedule requires at least \(\Omega(\log^ 2 n)\) round of transmissions.