Abstract
In this paper, we study lower bounds for randomized solutions to the maximal independent set (MIS) and connected dominating set (CDS) problems in the dual graph model of radio networks—a generalization of the standard graph-based model that now includes unreliable links controlled by an adversary. We begin by proving that a natural geographic constraint on the network topology is required to solve these problems efficiently (i.e., in time polylogarthmic in the network size). In more detail, we prove that in the absence of this constraint, for a network of size n: every MIS algorithm now requires Ω(n 1 − ε) rounds to solve the problem, for any constant ε, 0 < ε ≤ 1, and every CDS algorithm that provides a reasonable approximation of a minimum CDS now requires \(\Omega(\sqrt{n}/\log{n})\) rounds. We then prove the importance of the assumption that nodes are provided advance knowledge of their reliable neighbors (i.e, neighbors connected by reliable links). In more detail, we prove that in the absence of this assumption, for any CDS algorithm that guarantees a g(n)-approximation of a minimum CDS in f(n) rounds, it follows that g(n) + f(n) = Ω(n). This holds even if we assume the geographic constraint and the weakest possible adversary controlling the unreliable links. Finally, we show that although you can efficiently build an MIS without advance neighborhood knowledge, this omission increases the problem’s dependence on the geographic constraint. When both constraints are missing, every MIS algorithm now requires Ω(n) rounds, even if we assume the weakest possible adversary. Combined, these results answer an open question by proving that the efficient MIS and CDS algorithms from [2] are optimal with respect to their dual graph model assumptions. They also provide insight into what properties of an unreliable network enable efficient local computation.
This work is supported in part by NSF grant number CCF 1320279 and the Ford Motor Company University Research Program.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bar-Yehuda, R., Goldreich, O., Itai, A.: 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)
Censor-Hillel, K., Gilbert, S., Kuhn, F., Lynch, N., Newport, C.: Structuring Unreliable Radio Networks. In: Proceedings of the ACM Conference on Distributed Computing (2011)
Chlamtac, I., Kutten, S.: On Broadcasting in Radio Networks–Problem Analysis and Protocol Design. IEEE Transactions on Communications 33(12), 1240–1246 (1985)
Clementi, A., Monti, A., Silvestri, R.: Round Robin is Optimal for Fault-Tolerant Broadcasting on Wireless Networks. Journal of Parallel and Distributed Computing 64(1), 89–96 (2004)
Farach-Colton, M., Fernandes, R.J., Mosteiro, M.A.: Lower Bounds for Clear Transmissions in Radio Networks. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 447–454. Springer, Heidelberg (2006)
Ghaffari, M., Haeupler, B., Lynch, N., Newport, C.: Bounds on Contention Management in Radio Networks. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 223–237. Springer, Heidelberg (2012)
Ghaffari, M., Lynch, N., Newport, C.: The Cost of Radio Network Broadcast for Different Models of Unreliable Links. In: Proceedings of the ACM Conference on Distributed Computing (2013)
Jurdziński, T., Stachowiak, G.: Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 535–549. Springer, Heidelberg (2002)
Kuhn, F., Lynch, N., Newport, C., Oshman, R., Richa, A.: Broadcasting in Unreliable Radio Networks. In: Proceedings of the ACM Conference on Distributed Computing (2010)
Kuhn, F., Lynch, N., Newport, C.: Brief Announcement: Hardness of Broadcasting in Wireless Networks with Unreliable Communication. In: Proceedings of the ACM Conference on Distributed Computing (2009)
Kuhn, F., Moscibroda, T., Wattenhofer, R.: Initializing Newly Deployed Ad Hoc and Sensor Networks. In: Proceedings of the International Conference on Mobile Computing and Networking (2004)
Kuhn, F., Wattenhofer, R., Zollinger, A.: Ad-Hoc Networks Beyond Unit Disk Graphs. In: Proceedings of the International Workshop on the Foundations of Mobile Computing (2003)
Linial, N.: Locality in Distributed Graph Algorithms. SIAM Journal on Computing 21(1), 193–201 (1992)
Moscibroda, T., Wattenhofer, R.: Maximal Independent Sets in Radio Networks. In: Proceedings of the ACM Conference on Distributed Computing (2005)
Moscibroda, T., Wattenhofer, R.: The Complexity of Connectivity in Wireless Networks. In: Proceedings of the IEEE International Conference on Computer Communications (2006)
Newport, C.: Lower Bounds for Structuring Unreliable Radio Networks. Full version available on ArXiv and the author’s publication web site: http://cs.georgetown.edu/~cnewport/publications.html
Newport, C., Kotz, D., Yuan, Y., Gray, R.S., Liu, J., Elliott, C.: Experimental Evaluation of Wireless Simulation Assumptions. Simulation 83(9), 643–661 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Newport, C. (2014). Lower Bounds for Structuring Unreliable Radio Networks. In: Kuhn, F. (eds) Distributed Computing. DISC 2014. Lecture Notes in Computer Science, vol 8784. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45174-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-662-45174-8_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45173-1
Online ISBN: 978-3-662-45174-8
eBook Packages: Computer ScienceComputer Science (R0)