Deterministic broadcasting in ad hoc radio networks

  • Authors:

  • Bogdan S. Chlebus;Leszek Gasieniec;Alan Gibbons;Andrzej Pelc;Wojciech Rytter

  • Affiliations:

  • Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097 Warszawa, Poland;Department of Computer Science, The University of Liverpool, Liverpool L69 7ZF, United Kingdom;Department of Computer Science, The University of Liverpool, Liverpool L69 7ZF, United Kingdom;Département d'Informatique, Université du Québec à Hull, Hull, Québec J8X 3X7, Canada;Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097 Warszawa, Poland and Department of Computer Science, The University of Liverpool, Liverpool L69 7ZF, United Kingdom

  • Venue:
  • Distributed Computing
  • Year:
  • 2002

Quantified Score

Hi-index 0.08

Visualization

Abstract

We consider the problem of distributed deterministic broadcasting in radio networks of unknown topology and size. The network is synchronous. If a node u can be reached from two nodes which send messages in the same round, none of the messages is received by u. Such messages block each other and node u either hears the noise of interference of messages, enabling it to detect a collision, or does not hear anything at all, depending on the model. We assume that nodes know neither the topology nor the size of the network, nor even their immediate neighborhood. The initial knowledge of every node is limited to its own label. Such networks are called ad hoc multi-hop networks. We study the time of deterministic broadcasting under this scenario.For the model without collision detection, we develop a linear-time broadcasting algorithm for symmetric graphs, which is optimal, and an algorithm for arbitrary n-node graphs, working in time O(n11/6). Next we show that broadcasting with acknowledgement is not possible in this model at all.For the model with collision detection, we develop efficient algorithms for broadcasting and for acknowledged broadcasting in strongly connected graphs.