Abstract
In the advent of large-scale multi-hop wireless technologies, such as MANET, VANET, iThings, it is of utmost importance to devise efficient distributed protocols to maintain network architecture and provide basic communication tools. One of such fundamental communication tasks is broadcast, also known as a 1-to-all communication. We present a randomized algorithm that accomplishes broadcast in O(D + log(1/δ)) rounds with probability at least 1 − δ on any uniform-power network of n nodes and diameter D, when each station is equipped with its coordinates and local estimate of network density. Next, we develop algorithms for the model where no estimate of local density is available, except of the value n of the size of a given network. First, we provide a simple and almost oblivious algorithm which accomplishes broadcast in O(Dlogn(logn + log(1/δ))) rounds with probability at least 1 − δ. We further enhance this algorithm with more adaptive leader election routine and show that the resulting protocol achieves better time performance O((D + log(1/δ))logn) with probability at least 1 − δ. Our algorithms are the first provably efficient and well-scalable randomized distributed solutions for the (global) broadcast task in the ad hoc setting with coordinates. This could be also contrasted with the complexity of broadcast by weak devices, for which such scalable algorithms (with respect to D and logn) cannot be obtained [11].
This work was supported by the Polish National Science Centre grant DEC-2012/07/B/ST6/01534.
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.
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. J. Comput. Syst. Sci 45(1), 104–126 (1992)
Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. J. Algorithms 43(2), 177–189 (2002)
Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: FOCS, pp. 492–501 (2003)
Daum, S., Gilbert, S., Kuhn, F., Newport, C.: Broadcast in the ad hoc SINR model. In: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 358–372. Springer, Heidelberg (2013)
Dessmark, A., Pelc, A.: Broadcasting in geometric radio networks. J. Discrete Algorithms 5(1), 187–201 (2007)
Emek, Y., Kantor, E., Peleg, D.: On the effect of the deployment setting on broadcasting in euclidean radio networks. In: PODC, pp. 223–232 (2008)
Farach-Colton, M., Fernandez Anta, A., Mosteiro, M.A.: Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound). Theor. Comput. Sci. 472, 60–80 (2013)
Goussevskaia, O., Moscibroda, T., Wattenhofer, R.: Local broadcasting in the physical interference model. In: Segal, M., Kesselman, A. (eds.) DIALM-POMC, pp. 35–44.ACM (2008)
Goussevskaia, O., Pignolet, Y.A., Wattenhofer, R.: Efficiency of wireless networks: Approximation algorithms for the physical interference model. Foundations and Trends in Networking 4(3), 313–420 (2010)
Halldorsson, M.M., Mitra, P.: Towards tight bounds for local broadcasting. In: FOMC 2012, p. 2 (2012)
Jurdzinski, T., Kowalski, D.R., Stachowiak, G.: Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 632–644. Springer, Heidelberg (2013)
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.: Dynamic packet scheduling in wireless networks. In: PODC, pp. 281–290 (2012)
Kesselheim, T., Vöcking, B.: Distributed contention resolution in wireless networks. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 163–178. Springer, Heidelberg (2010)
Kowalski, D.R.: On selection problem in radio networks. In: Aguilera, M.K., Aspnes, J. (eds.) PODC, pp. 158–166. ACM (2005)
Kowalski, D.R., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distributed Computing 18(1), 43–57 (2005)
Kushilevitz, E., Mansour, Y.: An omega(d log (n/d)) lower bound for broadcast in radio networks. SIAM J. Comput. 27(3), 702–712 (1998)
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., Wang, Y., Hua, Q.-S., Lau, F.C.M.: Distributed local broadcasting algorithms in the physical interference model. In: DCOSS, pp. 1–8. IEEE (2011)
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
Jurdzinski, T., Kowalski, D.R., Rozanski, M., Stachowiak, G. (2013). Distributed Randomized Broadcasting in Wireless Networks under the 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_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-41527-2_26
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)