Abstract
An increasing amount of attention is being turned toward the study of distributed algorithms in wireless network models based on calculations of the signal to noise and interference ratio (SINR). In this paper we introduce the ad hoc SINR model, which, we argue, reduces the gap between theory results and real world deployment. We then use it to study upper and lower bounds for the canonical problem of broadcast on the graph induced by both strong and weak links. For strong connectivity broadcast, we present a new randomized algorithm that solves the problem in O(Dlog(n)polylog(R)) rounds in networks of size n, with link graph diameter D, and a ratio between longest and shortest links bounded by R. We then show that for back-off style algorithms (a common type of algorithm where nodes do not explicitly coordinate with each other) and compact networks (a practice-motivated model variant that treats the distance from very close nodes as equivalent), there exist networks in which centralized algorithms can solve broadcast in O(1) rounds, but distributed solutions require Ω(n) rounds. We then turn our attention to weak connectivity broadcast, where we show a similar Ω(n) lower bound for all types of algorithms, which we (nearly) match with a back-off style O(nlog2 n)-round upper bound. Our broadcast algorithms are the first known for SINR-style models that do not assume synchronous starts, as well as the first known not to depend on power control, tunable carrier sensing, geographic information and/or exact knowledge of network parameters.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A Lower Bound for Radio Broadcast. Journal of Computer and System Sciences 43(2), 290–298 (1991)
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: Proc. ACM Symp. on Principles of Distributed Computing (PODC), pp. 79–88 (2011)
Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. Journal of Algorithms 60, 115–143 (2006)
Daum, S., Gilbert, S., Kuhn, F., Newport, C.: Broadcast in the Ad Hoc SINR Model. Technical Report 274, University of Freiburg, Dept. of Computer Science (2013)
Goussevskaia, O., Wattenhofer, R., Halldorsson, M.M., Welzl, E.: Capacity of Arbitrary Wireless Networks. In: Proc. IEEE Int. Conf. on Computer Communications (2009)
Halldorsson, M.M., Mitra, P.: Towards Tight Bounds for Local Broadcasting. In: Proc.Int. Workshop on the Foundations of Mobile Computing. ACM (2012)
Halldorsson, M.M., Mitra, P.: Wireless Connectivity and Capacity. In: Proc. ACM-SIAM Symp. on Discrete Algorithms, SODA (2012)
Jurdzinski, T., Kowalski, D.R.: Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 106–120. Springer, Heidelberg (2012)
Jurdzinski, T., Kowalski, D.R., Stachowiak, G.: Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks. In: Gąsieniec, L., Wolter, F. (eds.) FCT 2013. LNCS, vol. 8070, pp. 195–209. Springer, Heidelberg (2013)
Kesselheim, T.: A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model. In: Proc. ACM-SIAM Symp. on Discrete Algorithms, SODA (2011)
Kowalski, D.R., Pelc, A.: Broadcasting in Undirected Ad Hoc Radio Networks. Distributed Computing 18(1), 43–57 (2005)
Kuhn, F., Lynch, N., Newport, C., Oshman, R., Richa, A.: Broadcasting in Radio Networks with Unreliable Communication. In: Proc. ACM Symp. on Principles of Distributed Computing, PODC (2010)
Kushilevitz, E., Mansour, Y.: An Ω(Dlog(N/D)) Lower Bound for Broadcast in Radio Networks. SIAM Journal on Computing 27(3), 702–712 (1998)
Moscibroda, T.: The Worst-Case Capacity of Wireless Sensor Networks. In: Proc. ACM/IEEE Int. Conf. on Information Processing in Sensor Networks, IPSN (2007)
Moscibroda, T., Wattenhofer, R.: Maximal Independent Sets In Radio Networks. In: Proc. ACM Symp. on Principles of Distributed Computing (PODC), pp. 148–157 (2005)
Moscibroda, T., Wattenhofer, R.: The Complexity of Connectivity in Wireless Networks. In: Proc. IEEE Int. Conf. on Computer Communications (2006)
Newport, C.: Brief Announcement: A Shorter and Stronger Proof of an Ω(Dlog(n/D)) Lower Bound on Broadcast in Radio Networks. In: Proc. ACM Symp. on Principles of Distributed Computing, PODC (2013)
Scheideler, C., Richa, A., Santi, P.: An O(log n) Dominating Set Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model. In: Proc. ACM Int. Symp. on Mobile Ad Hoc Networking and Computing (2008)
Schneider, J., Wattenhofer, R.: A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs. In: Proc. ACM Symp. on Principles of Distributed Computing (PODC), pp. 35–44 (2008)
Yu, D., Hua, Q.-S., Wang, Y., Tan, H., Lau, F.C.M.: Distributed Multiple-Message Broadcast in Wireless Ad-Hoc Networks Under the SINR Model. In: Even, G., Halldórsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 111–122. Springer, Heidelberg (2012)
Yu, D., Hua, Q.-S., Wang, Y., Lau, F.C.M.: An O(log n) Distributed Approximation Algorithm for Local Broadcasting in Unstructured Wireless Networks. In: Proc. IEEE Int. Conf. on Distributed Computing in Sensor Systems (DCOSS), pp. 132–139 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daum, S., Gilbert, S., Kuhn, F., Newport, C. (2013). Broadcast in the Ad Hoc SINR Model. In: Afek, Y. (eds) Distributed Computing. DISC 2013. Lecture Notes in Computer Science, vol 8205. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41527-2_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-41527-2_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41526-5
Online ISBN: 978-3-642-41527-2
eBook Packages: Computer ScienceComputer Science (R0)