The impact of mobility on the time complexity for deterministic broadcasting in radio networks

Authors:
Ravi Prakash;Yoav Sasson;Mansoor Mohsin;David Cavin;Andre Schiper
Affiliations:
Department of Computer Science, University of Texas at Dallas Richardson, Mail Stop EC 31, TX 75080, USA.;Ecole Polytechnique Federale de Lausanne (EPFL), Station 14, 1015 Lausanne, Switzerland.;Microsoft Corporation, 1 Microsoft WayRedmond, WA 98052, USA.;Ecole Polytechnique Federale de Lausanne (EPFL), Station 14, 1015 Lausanne, Switzerland.;Ecole Polytechnique Federale de Lausanne (EPFL), Station 14, 1015 Lausanne, Switzerland
Venue:
International Journal of Ad Hoc and Ubiquitous Computing
Year:
2011

Citing 9
Cited 0

A lower bound for radio broadcast

Journal of Computer and System Sciences
On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization

Journal of Computer and System Sciences
Using directional antennas for medium access control in ad hoc networks

Proceedings of the 8th annual international conference on Mobile computing and networking
Deterministic Broadcasting Time in Radio Networks of Unknown Topology

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Distributed broadcast in radio networks of unknown topology

Theoretical Computer Science
Deterministic broadcasting in ad hoc radio networks

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

Distributed Computing
Broadcasting in undirected ad hoc radio networks

Distributed Computing - Special issue: PODC 02
Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism

Theoretical Computer Science - Foundations of software science and computation structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the time complexity for deterministic broadcasting algorithms in mobile radio networks. The broadcast operation consists of a source node successfully communicating its message to every other node. In multi-hop radio networks such as MANETs, the message may traverse multiple other nodes. Nodes have no prior knowledge besides the number n of nodes in the network and its diameter D. The problem we address has been extensively studied for static networks. Our work quantifies the impact of mobility. We consider three families of graphs: undirected graphs of constant contention degree, undirected graphs of non-constant contention degree and directed graphs of non-constant contention degree. We prove the lower bounds of Ω(n log n) time slots for the first family, Ω(n²/D² log D + D) time slots for the second and Ω(n²/D² log D + n log D) for the third. At the time of writing, the corresponding tightest lower bounds derived in the static case are, respectively, Ω(D log n), Ω(n log/log n / D) and Ω(n log D).