An optimal algorithm of acknowledged broadcasting in ad hoc radio networks

Authors:
Takaya Okuwa;Wei Chen;Koichi Wada
Affiliations:
Nagoya Institute of Technology, Gokiso-cho, Syowa-ku, Nagoya, Japan;Tennessee State University, Nashville, TN;Nagoya Institute of Technology, Gokiso-cho, Syowa-ku, Nagoya, Japan
Venue:
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
Year:
2003

Citing 8
Cited 3

On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A lower bound for radio broadcast

Journal of Computer and System Sciences
Broadcast in radio networks

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Faster broadcasting in unknown radio networks

Information Processing Letters
Deterministic Radio Broadcasting

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Fast broadcasting and gossiping in radio networks

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Deterministic broadcasting in ad hoc radio networks

Distributed Computing
Lower bounds for the broadcast problem in mobile radio networks

Distributed Computing

Acknowledged broadcasting and gossiping in ad hoc radio networks

Theoretical Computer Science
Maximum Finding in the Symmetric Radio Networks with Collision Detection

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Information dissemination in unknown radio networks with large labels

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of distributed deterministic broadcasting in synchronous radio networks whose topology and size are unknown. Radio networks can be modeled by directed graphs. It has been shown that there does not exist any algorithm of acknowledged radio broadcasting (ARB) on the model without a collision detection even if graphs are restricted to symmetric ones, where ARB is a broadcasting task in which a distinguished node(called source) transmits a source message to all nodes and it confirms that all nodes have received the source message. In this paper, on the model of radio networks with a collision detection, we show an O(r + ecc) time deterministic ARB algorithm for symmetric graphs, where r is the length of the source message and ecc is the largest distance from the source to any other node.