Document Open Access Logo

The Cost of Global Broadcast in Dynamic Radio Networks

Authors Mohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn, Anisur Rahaman Molla



PDF
Thumbnail PDF

File

LIPIcs.OPODIS.2015.7.pdf
  • Filesize: 0.63 MB
  • 17 pages

Document Identifiers

Author Details

Mohamad Ahmadi
Abdolhamid Ghodselahi
Fabian Kuhn
Anisur Rahaman Molla

Cite AsGet BibTex

Mohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn, and Anisur Rahaman Molla. The Cost of Global Broadcast in Dynamic Radio Networks. In 19th International Conference on Principles of Distributed Systems (OPODIS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 46, pp. 7:1-7:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/LIPIcs.OPODIS.2015.7

Abstract

We study the single-message broadcast problem in dynamic radio networks. We show that the time complexity of the problem depends on the amount of stability and connectivity of the dynamic network topology and on the adaptiveness of the adversary providing the dynamic topology. More formally, we model communication using the standard graph-based radio network model. To model the dynamic network, we use a variant of the synchronous dynamic graph model introduced in [Kuhn et al., STOC 2010]. For integer parameters T >= 1 and k => 1, we call a dynamic graph T-interval k-connected if for every interval of T consecutive rounds, there exists a k-vertex-connected stable subgraph. Further, for an integer parameter tau >= 0, we say that the adversary providing the dynamic network is tau-oblivious if for constructing the graph of some round t, the adversary has access to all the randomness (and states) of the algorithm up to round t-tau. As our main result, we show that for any T >= 1, any k >= 1, and any tau = 1, for a tau-oblivious adversary, there is a distributed algorithm to broadcast a single message in time O((1+n/(k * min(tau,T)) * n *log^3(n)). We further show that even for large interval k-connectivity, efficient broadcast is not possible for the usual adaptive adversaries. For a 1-oblivious adversary, we show that even for any T <= (n/k)^{1-epsilon} (for any constant epsilon > 0) and for any k >= 1, global broadcast in T-interval k-connected networks requires at least Omega(n^2/k^2*log(n)) time. Further, for a 0-oblivious adversary, broadcast cannot be solved in T-interval k-connected networks as long as T < n-k.
Keywords
  • radio network
  • dynamic network
  • global broadcast
  • interval connectivity
  • hitting game

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Mohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn, and Anisur R. Molla. The cost of global broadcast in dynamic radio networks. CoRR, abs/1601.01912, 2016. Google Scholar
  2. Antonio F. Anta, Alessia Milani, Miguel A. Mosteiro, and Shmuel Zaks. Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony. Distributed Computing, 25(4):279-296, 2012. Google Scholar
  3. Chen Avin, Michal Koucký, and Zvi Lotker. How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In Proc. 5th Coll. on Automata, Languages and Programming (ICALP), pages 121-132, 2008. Google Scholar
  4. Reuven Bar-Yehuda, Oded Goldreich, and Alon Itai. Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection. Distributed Computing, 5:67-71, 1991. Google Scholar
  5. Reuven Bar-Yehuda, Oded Goldreich, and Alon Itai. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. Journal of Computer and System Sciences, 45(1):104-126, 1992. Google Scholar
  6. Hervé Baumann, Pierluigi Crescenzi, and Pierre Fraigniaud. Parsimonious flooding in dynamic graphs. In Proc. of 28th ACM Symp. on Principles of Distributed Computing (PODC), pages 260-269, 2009. Google Scholar
  7. Keren Censor-Hillel, Mohsen Ghaffari, and Fabian Kuhn. Distributed connectivity decomposition. In Proc. 33rd Symp. on Principles of Distributed Computing (PODC), 2014. Google Scholar
  8. Keren Censor-Hillel, Mohsen Ghaffari, and Fabian Kuhn. A new perspective on vertex connectivity. In Proc. 25th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 546-561, 2014. Google Scholar
  9. Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Nancy Lynch, and Calvin Newport. Structuring unreliable radio networks. Distributed Computing, 27(1):1-19, 2014. Google Scholar
  10. Imrich Chlamtac and Shay Kutten. On broadcasting in radio networks-problem analysis and protocol design. IEEE Transactions on Communications, 33(12):1240-1246, 1985. Google Scholar
  11. Andrea Clementi, Angelo Monti, Francesco Pasquale, and Riccardo Silvestri. Broadcasting in dynamic radio networks. J. Comput. Syst. Sci., 75(4):213-230, 2009. Google Scholar
  12. Andrea Clementi, Angelo Monti, Francesco Pasquale, and Riccardo Silvestri. Optimal gossiping in geometric radio networks in the presence of dynamical faults. Networks, 59(3):289-298, 2012. Google Scholar
  13. Mohsen Ghaffari, Nancy Lynch, and Calvin Newport. The cost of radio network broadcast for different models of unreliable links. In Proc. 32nd Symp. on Principles of Distributed Computing (PODC), pages 345-354, 2013. Google Scholar
  14. Piyush Gupta and Panganmala R. Kumar. The Capacity of Wireless Networks. IEEE Transactions on Information Theory, 46(2):388-404, 2000. Google Scholar
  15. Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rozanski, and Grzegorz Stachowiak. On the impact of geometry on ad hoc communication in wireless networks. In Proc. 33rd Symp. on Principles of Distributed Computing (PODC), pages 357-366, 2014. Google Scholar
  16. Kyu-Han Kim and Kang G. Shin. On accurate measurement of link quality in multi-hop wireless mesh networks. In Proc. Conf. on Mobile Computing and Networking (MOBICOM), pages 38-49, 2006. Google Scholar
  17. Fabian Kuhn, Nancy Lynch, Calvin Newport, Rotem Oshman, and Andréa W. Richa. Broadcasting in unreliable radio networks. In Proc. 29th Symp. on Principles of Distributed Computing (PODC), pages 336-345, 2010. Google Scholar
  18. Fabian Kuhn, Nancy Lynch, and Rotem Oshman. Distributed computation in dynamic networks. In Proc. 42nd Symp. on Theory of Computing (STOC), pages 513-522, 2010. Google Scholar
  19. Fabian Kuhn and Rotem Oshman. Dynamic Networks: Models and Algorithms. ACM SIGACT News, 42(1):82-96, 2011. Google Scholar
  20. Eyal Kushilevitz and Yishay Mansour. An ω(d$$1log(n/d)) lower bound for broadcast in radio networks. SIAM journal on Computing, 27(3):702-712, 1998. Google Scholar
  21. Thomas Moscibroda and Roger Wattenhofer. Maximal independent sets in radio networks. In Proc. 24th Symp. on Principles of Distributed Computing (PODC), pages 148-157, 2005. Google Scholar
  22. Thomas Moscibroda and Roger Wattenhofer. The complexity of connectivity in wireless networks. In Proc. 25th Conf. on Computer Communications (INFOCOM), pages 1-13, 2006. Google Scholar
  23. Calvin Newport. Radio network lower bounds made easy. In Distributed Computing, pages 258-272. 2014. Google Scholar
  24. Calvin Newport, David Kotz, Yougu Yuan, Robert S. Gray, Jason Liu, and Chip Elliott. Experimental evaluation of wireless simulation assumptions. Simulation, 83(9):643-661, 2007. Google Scholar
  25. Regina O'Dell and Roger Wattenhofer. Information dissemination in highly dynamic graphs. In Proc. of Workshop on Foundations of Mobile Computing (DIALM-POMC), pages 104-110, 2005. Google Scholar
  26. Krishna Ramachandran, Irfan Sheriff, Elizabeth Belding, and Kevin Almeroth. Routing stability in static wireless mesh networks. In Proc. Conf. on Passive and Active Network Measurment, pages 73-82, 2007. Google Scholar
  27. Kannan Srinivasan, Maria A. Kazandjieva, Saatvik Agarwal, and Philip Levis. The β-factor: Measuring wireless link burstiness. In Proc. 6th Conf. on Embedded Networked Sensor System, pages 29-42, 2008. Google Scholar
  28. Mark D. Yarvis, Steven W. Conner, Lakshman Krishnamurthy, Jasmeet Chhabra, Brent Elliott, and Alan Mainwaring. Real-world experiences with an interactive ad hoc sensor network. In Proc. Conf. of Parallel Processing, pages 143-151, 2002. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail