Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony

The topic of this paper is the study of information dissemination in mobile ad-hoc networks by means of deterministic protocols. We assume a weak set of restrictions on the mobility of nodes, parameterized by α, the disconnection time, and β, the link stability time, such that the mobile ad-hoc networks considered are connected enough for dissemination. Such a connectivity model generalizes previous models in that we assume much less connectivity, or make explicit the assumptions in previous papers. The protocols studied are classified into three classes: oblivious (the transmission schedule of a node is only a function of its ID), quasi-oblivious (the transmission schedule may also depend on a global time), and adaptive. The main contribution of this work concerns negative results. Contrasting the lower and upper bounds derived, interesting complexity gaps among protocol-classes are observed. These results show that the gap in time complexity between oblivious and quasi-oblivious (hence, adaptive) protocols is almost linear. This gap is what we call the profit of global synchrony since it represents the gain the network obtains from global synchrony with respect to not having it. We note that the global synchrony required by the efficient quasi-oblivious protocol proposed is simply achieved by piggybacking in the messages sent the time at the source node, as a global reference.

[1]  Tracy Camp,et al.  A Review of Geocasting Protocols for a Mobile Ad Hoc Network , 2002 .

[2]  Roger Wattenhofer,et al.  Information dissemination in highly dynamic graphs , 2005, DIALM-POMC '05.

[3]  Roberto Baldoni,et al.  Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks , 2007, DISC.

[4]  Eyal Kushilevitz,et al.  An Ω(D log(N/D)) lower bound for broadcast in radio networks , 1993, PODC '93.

[5]  Marco Conti,et al.  Modelling data dissemination in opportunistic networks , 2008, CHANTS '08.

[6]  Pierre Humblet.  Selecting a leader in a clique in 0(N log N) messages , 1984, The 23rd IEEE Conference on Decision and Control.

[7]  Sandeep K. S. Gupta,et al.  An adaptive protocol for reliable multicast in mobile multi-hop radio networks , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[8]  Wojciech Rytter,et al.  Deterministic broadcasting in ad hoc radio networks , 2002, Distributed Computing.

[9]  Lawrence G. Roberts,et al.  ALOHA packet system with and without slots and capture , 1975, CCRV.

[10]  Antonio Fernández,et al.  Bounds for Deterministic Reliable Geocast in Mobile Ad-Hoc Networks , 2008, OPODIS.

[11]  Dariusz R. Kowalski,et al.  On Many-to-Many Communication in Packet Radio Networks , 2006, OPODIS.

[12]  Fabian Kuhn,et al.  Gradient clock synchronization in dynamic networks , 2009, SPAA '09.

[13]  Baruch Awerbuch,et al.  Efficient and reliable broadcast is achievable in an eventually connected network(Extended Abstract) , 1984, PODC '84.

[14]  André Schiper,et al.  Reliable Broadcast in Wireless Mobile Ad Hoc Networks , 2006, Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06).

[15]  David Peleg,et al.  Time-Efficient Broadcast in Radio Networks , 2010, Graphs and Algorithms in Communication Networks.

[16]  Andrzej Lingas,et al.  Oblivious gossiping in ad-hoc radio networks , 2001, DIALM '01.

[17]  Andrzej Pelc,et al.  Deterministic M2M multicast in radio networks , 2006, Theor. Comput. Sci..

[18]  Miguel A. Mosteiro,et al.  Sensor Network Gossiping or How to Break the Broadcast Lower Bound , 2007, ISAAC.

[19]  Boaz Patt-Shamir,et al.  Adapting to asynchronous dynamic networks (extended abstract) , 1992, STOC '92.

[20]  Andrzej Pelc,et al.  Broadcasting in geometric radio networks , 2007, J. Discrete Algorithms.

[21]  Shmuel Zaks,et al.  Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors , 1989, Theor. Comput. Sci..

[22]  Xiaoyang Guan,et al.  Better Face Routing Protocols , 2009, ALGOSENSORS.

[23]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[24]  Danilo Bruschi,et al.  Lower bounds for the broadcast problem in mobile radio networks , 1997, Distributed Computing.

[25]  Andrea E. F. Clementi,et al.  Round Robin is optimal for fault-tolerant broadcasting on wireless networks , 2001, J. Parallel Distributed Comput..

[26]  Andrea E. F. Clementi,et al.  Flooding time in edge-Markovian dynamic graphs , 2008, PODC '08.

[27]  J. Rosser,et al.  Approximate formulas for some functions of prime numbers , 1962 .

[28]  Eyal Kushilevitz,et al.  An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks , 1998, SIAM J. Comput..

[29]  Antonio Fernández,et al.  Deterministic Communication in the Weak Sensor Model , 2007, OPODIS.

[30]  Dariusz R. Kowalski,et al.  On selection problem in radio networks , 2005, PODC '05.

[31]  Andrzej Pelc,et al.  Broadcasting in UDG radio networks with unknown topology , 2007, PODC '07.

[32]  Elena Pagani,et al.  Reliable broadcast in mobile multihop packet networks , 1997, MobiCom '97.

[33]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[34]  Andrzej Pelc,et al.  Deterministic M2M Multicast in Radio Networks: (Extended Abstract) , 2004, ICALP.

[35]  Reuven Bar-Yehuda,et al.  On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..

[36]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[37]  Andrzej Pelc,et al.  Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism , 2005, Theor. Comput. Sci..

[38]  Marco Conti,et al.  Opportunistic networking: data forwarding in disconnected mobile ad hoc networks , 2006, IEEE Communications Magazine.

[39]  Pierre Fraigniaud,et al.  Parsimonious flooding in dynamic graphs , 2009, PODC '09.

[40]  Andrea E. F. Clementi,et al.  Distributed multi-broadcast in unknown radio networks , 2001, PODC '01.

[41]  Andrea E. F. Clementi,et al.  Information Spreading in Stationary Markovian Evolving Graphs , 2009, IEEE Transactions on Parallel and Distributed Systems.

[42]  Wojciech Rytter,et al.  Deterministic broadcasting in unknown radio networks , 2000, SODA '00.

[43]  André Schiper,et al.  A Lower Bound for Broadcasting in Mobile Ad Hoc Networks , 2004 .

[44]  Nancy A. Lynch,et al.  Distributed computation in dynamic networks , 2010, STOC '10.

[45]  Andrea E. F. Clementi,et al.  Communication in dynamic radio networks , 2007, PODC '07.

[46]  James Aspnes,et al.  An Introduction to Population Protocols , 2007, Bull. EATCS.

[47]  Andrea E. F. Clementi,et al.  Selective families, superimposed codes, and broadcasting on unknown radio networks , 2001, SODA '01.