Deterministic Radio Broadcasting
We consider broadcasting in radio networks: one node of the network knows a message that needs to be learned by all the remaining nodes. We seek distributed deterministic algorithms to perform this task. Radio networks are modeled as directed graphs. They are unknown, in the sense that nodes are not assumed to know their neighbors, nor the size of the network, they are aware only of their individual identifying numbers. If more than one message is delivered to a node in a step then the node cannot hear any of them. Nodes cannot distinguish between such collisions and the case when no messages have been delivered in a step.
The fastest previously known deterministic algorithm for deterministic distributed broadcasting in unknown radio networks was presented in , it worked in time O(n 11/6). We develop three new deterministic distributed algorithms. Algorithm A develops further the ideas of  and operates in time O(n 1.77291) = O(n 9/5), for general networks, and in time O(n 1+a+H(a)+0(1)) for sparse networks with in-degrees O(n a) for a < 1/2; here H is the entropy function. Algorithm B uses a new approach and works in time O(n 3/2 log1/2 n) for general networks or O(n 1+a+0(1)) for sparse networks. Algorithm C further improves the performance for general networks running in time O(n 3/2).
KeywordsBroadcasting Distributed Deterministic Radio network
Unable to display preview. Download preview PDF.
- 6.B.S. Chlebus, L. Gcasieniec, A.M. Gibbons, A. Pelc, and W. Rytter, Deterministic broadcasting in unknown radio networks, in Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms, San Francisco, California, 2000, pp. 861–870.Google Scholar
- 8.K. Diks, E. Kranakis, D. Krizanc and A. Pelc, The impact of knowledge on broadcasting time in radio networks, in Proc. 7th European Symposium on Algorithms, Prague, Czech Republic, 1999, Springer LNCS 1643, pp. 41–52.Google Scholar
- 9.I. Gaber and Y. Mansour, Broadcast in radio networks, in Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms, 1995, pp. 577–585.Google Scholar
- 11.L.A. Goldberg, M. Jerrum, S. Kannan, and M. Paterson, A bound on the capacity of backoff and acknowledgement-based protocols, in this volume of Springer LNCS.Google Scholar
- 12.E. Kranakis, D. Krizanc and A. Pelc, Fault-tolerant broadcasting in radio networks, in Proc. 6th European Symposium on Algorithms, Venice, Italy, 1998, Springer LNCS 1461, pp. 283–294.Google Scholar
- 14.E. Kushilevitz and Y. Mansour, Computation in noisy radio networks, in Proc. 9th Ann. ACM-SIAM Symp. on Discrete Algorithms, 1998, pp. 236–243.Google Scholar
- 15.K. Pahlavan and A. Levesque, “Wireless Information Networks,” Wiley-Interscience, New York, 1995.Google Scholar
- 16.A. Sen and M. L. Huson, A new model for scheduling packet radio networks, in Proc. 15th Ann. Joint Conference of the IEEE Computer and Communication Societies, 1996, pp. 1116–1124.Google Scholar