Multiple Communication in Multi-Hop Radio Networks

Two tasks of communication in a multi-hop synchronous radio network are considered: point-to-point communication and broadcast (sending a message to all nodes of a network). Efficient protocols for both problems are presented. Even though the protocols are probabilistic, it is shown how to acknowledge messages deterministically. Let n, D, and ∆ be the number of nodes, the diameter and the maximum degree of our network, respectively. Both protocols require a setup phase in which a BFS tree is constructed. This phase takes O ((n + Dlogn)log∆) time. After the setup, k point-to-point transmissions require O ((k +D)log∆) time on the average. Therefore the network allows a new transmission every O (log∆) time slots. Also, k broadcasts require an average of O ((k +D)log∆logn) time. Hence the average throughput of the network is a broadcast every O(log∆logn) time slots. Both protocols pipeline the messages along the BFS tree. They are always successful on the graph spanned by the...

• Type: Conference
• Year: 1989
• Where: PODC
• Authors: Reuven Bar-Yehuda, Amos Israeli
• Keywords: BFS Tree, Distributed And Parallel Computing, Multi-hop Synchronous Radio, PODC 1989, Time Slots