Title: 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
Addresses: 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
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).
Keywords: MANETs; mobile ad hoc networks; deterministic broadcasting; lower bound; mobile networks; mobility; time complexity; multi-hop radio networks.
International Journal of Ad Hoc and Ubiquitous Computing, 2011 Vol.8 No.3, pp.174 - 188
Accepted: 09 Jun 2009
Published online: 05 Sep 2011 *