On the limiting performance of broadcast algorithms over unidimensional ad-hoc radio networks
Andréa Zanella, Gianfranco L. Pierobon, Simone Merlin · 2004
Broadcast mechanisms are widely used in self-organizing wireless networks, for management, control and data exchange pur- poses. In general, broadcast algorithms are required to provide a rapid, reliable and energy-efficient way to diffuse information over a network of randomly distributed nodes. In this paper, we address such issues in the context of uni- dimensional networks, with nodes distributed according to a 1- dimension inhomogeneous Poisson process. We statistically derive the propagation dynamic of the optimum broadcast algorithm defined over the Minimum Connected Dominating Set (MCDS) of nodes. Hence, we derive the limiting broadcast performance over uni-dimensional networks, in terms of some useful measures, thus providing common reference values for comparing the effectiveness of different broadcast algorithms.