Abstract
We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which captures the characteristics of the set-up phase of such multi-hop radio networks: asynchronous wake-up, the hidden terminal problem, and scarce knowledge about the topology of the network graph. When modelling the network as a unit disk graph, the algorithm computes a dominating set in polylogarithmic time and achieves a constant approximation ratio.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baker, D.J., Ephremides, A.: The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm. IEEE Trans. Communications COM-29(11), 1694–1701 (1981)
Bar-Yehuda, R., Goldreich, O., Itai, A.: On the Time-Complexity of broadcast in radio networks: an exponential gap between determinism randomization. In: Proc. 6 th Symposium on Principles of Distributed Computing (PODC), pp. 98–108. ACM Press, New York (1987)
Feige, U.: A Threshold of ln n for Approximating Set Cover. Journal of the ACM (JACM) 45(4), 634–652 (1998)
Gao, J., Guibas, L., Hershberger, J., Zhang, L., Zhu, A.: Discrete Mobile Centers. In: Proc. 17 th Symposium on Computational Geometry (SCG), pp. 188–196. ACM Press, New York (2001)
Gasieniec, L., Pelc, A., Peleg, D.: The wakeup problem in synchronous broadcast systems (extended abstract). In: Proc. 19 th Symposium on Principles of Distributed Computing (PODC), pp. 113–121. ACM Press, New York (2000)
Gerla, M., Tsai, J.: Multicluster, mobile, multimedia radio network. ACM/Baltzer Journal of Wireless Networks 1(3), 255–265 (1995)
Jia, L., Rajaraman, R., Suel, R.: An Efficient Distributed Algorithm for Constructing Small Dominating Sets. In: Proc. of the 20 th ACM Symposium on Principles of Distributed Computing (PODC), pp. 33–42 (2001)
Jurdzinski, T., Stachowiak, G.: Probabilistic Algorithms for theWakeup 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., Wattenhofer, R.: Constant-Time Distributed Dominating Set Approximation. In: Proc. 22 nd Symp. on Principles of Distributed Computing (PODC), pp. 25–32 (2003)
Kutten, S., Peleg, D.: Fast Distributed Construction of Small k-Dominating Sets and Applications. Journal of Algorithms 28, 40–66 (1998)
Roberts, L.G.: Aloha Packet System with and without Slots and Capture. ACM SIGCOMM, Computer Communication Review 5(2), 28–42 (1975)
Wan, P., Alzoubi, K., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. In: Proceedings of INFOCOM (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuhn, F., Moscibroda, T., Wattenhofer, R. (2004). Radio Network Clustering from Scratch. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_42
Download citation
DOI: https://doi.org/10.1007/978-3-540-30140-0_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23025-0
Online ISBN: 978-3-540-30140-0
eBook Packages: Springer Book Archive