Abstract
The paper deals with radio network distributed algorithms where initially no information about node degrees is available. We show that the lack of such an information affects the time complexity of existing fundamental algorithms by only a polylogarithmic factor. More precisely, given an n-node graph modeling a multi-hop radio network, we provide a O(log2 n) time distributed algorithm that computes w.h.p., a constant approximation value of the degree of each node. We also provide a O(Δlogn + log2 n) time distributed algorithm that computes w.h.p., a constant approximation value of the local maximum degree of each node, where the global maximum degree Δ of the graph is not known. Using our algorithm as a plug-and-play procedure, we show that the local maximum degree can be used instead of Δ to break the symmetry efficiently. We illustrate this claim by revisiting some fundamental algorithms that use Δ as a key parameter. First, we investigate the generic problem of simulating any point-to-point interference-free message passing algorithm in the radio network model. Then, we study the fundamental coloring problem in unit disk graphs. The obtained results show that the local maximum degree allows nodes to self-organize in a local manner and to avoid the radio interferences from being a communication bottleneck.
A preliminary version of this paper appeared as an inria internal research report [6].
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
Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: On the complexity of radio communication. In: 21st annual ACM Symposium on Theory of computing (STOC 1989), pp. 274–285. ACM, New York (1989)
Balakrishnan, H., Barrett, C.L., Anil Kumar, V.S., Marathe, M.V., Thite, S.: The distance-2 matching problem and its relationship to the mac-layer capacity of ad hoc wireless networks. IEEE Journal on Selected Areas in Communications 22(6), 1069–1079 (2004)
Bar-Yehuda, R., Goldreich, O., Itai, A.: Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection. In: Bermond, J.-C., Raynal, M. (eds.) WDAG 1989. LNCS, vol. 392, pp. 24–32. Springer, Heidelberg (1989)
Bar-Yehuda, R., Israeli, A., Itai, A.: Multiple communication in multi-hop radio networks. In: 8th ACM Symposium on Principles of distributed computing (PODC 1989), pp. 329–338 (1989)
Barrett, C.L., Kumar, V.S.A., Marathe, M.V., Thite, S., Istrate, G.: Strong edge coloring for channel assignment in wireless radio networks. In: 4th annual IEEE international conference on Pervasive Computing and Communications Workshops (PERCOMW 2006), Washington, DC, USA, p. 106. IEEE Computer Society Press, Los Alamitos (2006)
Derbel, B., Talbi, E.-G.: Radio network distributed algorithms in the unknown neighborhood model. In: Technical Report HAL, inria-00292155, RR-6581 (June 2008), http://hal.inria.fr
Gasieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: 24th symposium on principles of distributed computing (PODC 2005), pp. 129–137. ACM, New York (2005)
Goussevskaia, O., Moscibroda, T., Wattenhofer, R.: Local Broadcasting in the Physical Interference Model. In: International Workshop on Foundations of Mobile Computing (DialM-POMC), Toronto, Canada, August 2008, pp. 35–44 (2008)
Mitzenmacher, M., Upfal, E.: Probability and Computing, Randomized Algorithms and probabilistic analysis. Cambridge University Press, Cambridge (2005)
Moscibroda, T., Wattenhofer, R.: Coloring Unstructured Radio Networks. In: 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), July 2005, pp. 39–48 (2005)
Moscibroda, T., Wattenhofer, R.: Coloring unstructured radio networks. Distributed Computing 21(4), 271–284 (2008)
Schneider, J., Wattenhofer, R.: Coloring unstructured wireless multi-hop networks. In: 28th Symposium on Principles of Distributed Computing (PODC 2009), pp. 210–219 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Derbel, B., Talbi, EG. (2010). Radio Network Distributed Algorithms in the Unknown Neighborhood Model. In: Kant, K., Pemmaraju, S.V., Sivalingam, K.M., Wu, J. (eds) Distributed Computing and Networking. ICDCN 2010. Lecture Notes in Computer Science, vol 5935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11322-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-11322-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11321-5
Online ISBN: 978-3-642-11322-2
eBook Packages: Computer ScienceComputer Science (R0)