The Cost of Global Broadcast in Dynamic Radio Networks

Abstract We study the time complexity of single and multi token broadcast in adversarial dynamic radio networks. Initially, k tokens (which are k pieces of information) are distributed among the n nodes of a network and all the tokens need to be disseminated to all the nodes in the network. We first consider the single-token broadcast problem (i.e., the case k = 1 ). By presenting upper and lower bounds, we show that the time complexity of single-token broadcast depends on the amount of stability and connectivity of the dynamic network topology and on the adaptiveness of the adversary providing the dynamic topology. Then, we give two generic algorithms which allow to transform generalized forms of single-token broadcast algorithms into multi-token broadcast (k-token broadcast) algorithms. Based on these generic algorithms, we obtain k-token broadcast algorithms for a number of different dynamic network settings. For one of the modeling assumptions, our algorithm is complemented by a lower bound which shows that the upper bound is close to optimal.

[1]  Dariusz R. Kowalski,et al.  On the impact of geometry on ad hoc communication in wireless networks , 2014, PODC '14.

[2]  Majid Khabbazian,et al.  Time-efficient randomized multiple-message broadcast in radio networks , 2011, PODC '11.

[3]  Fabian Kuhn,et al.  A New Perspective on Vertex Connectivity , 2013, SODA.

[4]  Wojciech Rytter,et al.  A randomized algorithm for gossiping in radio networks , 2004, Networks.

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

[6]  Kevin C. Almeroth,et al.  Routing Stability in Static Wireless Mesh Networks , 2007, PAM.

[7]  Nancy A. Lynch,et al.  Broadcasting in unreliable radio networks , 2010, PODC.

[8]  Mark D. Yarvis,et al.  Real-world experiences with an interactive ad hoc sensor network , 2002, Proceedings. International Conference on Parallel Processing Workshop.

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

[10]  Fabian Kuhn,et al.  Multi-message Broadcast in Dynamic Radio Networks , 2016, ALGOSENSORS.

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

[12]  Calvin C. Newport.  Radio Network Lower Bounds Made Easy , 2014, DISC.

[13]  Nancy A. Lynch,et al.  Structuring unreliable radio networks , 2011, PODC '11.

[14]  Nancy A. Lynch,et al.  Multi-message broadcast with abstract MAC layers and unreliable links , 2014, PODC '14.

[15]  Shmuel Zaks,et al.  Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony , 2010, DISC.

[16]  Andrea E. F. Clementi,et al.  Optimal gossiping in geometric radio networks in the presence of dynamical faults , 2012, Networks.

[17]  Philip Levis,et al.  The β-factor: measuring wireless link burstiness , 2008, SenSys '08.

[18]  Roger Wattenhofer,et al.  Maximal independent sets in radio networks , 2005, PODC '05.

[19]  Fabian Kuhn,et al.  Distributed connectivity decomposition , 2013, PODC.

[20]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

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

[22]  Jason Liu,et al.  Experimental evaluation of wireless simulation assumptions , 2004, MSWiM '04.

[23]  Nancy A. Lynch,et al.  The cost of radio network broadcast for different models of unreliable links , 2013, PODC '13.

[24]  Muriel Médard,et al.  Algebraic gossip: a network coding approach to optimal multiple rumor mongering , 2006, IEEE Transactions on Information Theory.

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

[26]  Andrzej Lingas,et al.  Gossiping with Bounded Size Messages in ad hoc Radio Networks , 2002, ICALP.

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

[28]  Roger Wattenhofer,et al.  The Complexity of Connectivity in Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[29]  Imrich Chlamtac,et al.  On Broadcasting in Radio Networks - Problem Analysis and Protocol Design , 1985, IEEE Transactions on Communications.

[30]  Andrea E. F. Clementi,et al.  Broadcasting in dynamic radio networks , 2009, J. Comput. Syst. Sci..

[31]  Fabian Kuhn,et al.  Dynamic networks: models and algorithms , 2011, SIGA.

[32]  Chen Avin,et al.  How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) , 2008, ICALP.

[33]  Reuven Bar-Yehuda,et al.  Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection , 1989, Distributed Computing.

[34]  Dariusz R. Kowalski,et al.  Dynamic multiple-message broadcast: bounding throughput in the affectance model , 2014, FOMC '14.

[35]  Kang G. Shin,et al.  On accurate measurement of link quality in multi-hop wireless mesh networks , 2006, MobiCom '06.

[36]  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..

[37]  Nancy A. Lynch,et al.  The abstract MAC layer , 2009, Distributed Computing.

[38]  Dariusz R. Kowalski,et al.  Many-to-Many Communication in Radio Networks , 2007, Algorithmica.