Abstract
An important problem in wireless ad hoc networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Connected dominating set (CDS) has been proposed to approximate the virtual backbone. Although computing minimum CDS is known to be NP-hard, many distributed protocols have been presented to construct small CDS. However, these protocols are either too complicated, need non-local information or have slow convergence speed, are not adaptive to topology changes. In this paper, we propose a new pure localized algorithm for computing the approximate solution to the minimum CDS problem. The algorithm starts with a feasible and near-optimal CDS solution via marking process based on classification of neighbors, and removes vertices from this solution by redundancy elimination, until an approximate CDS is found. Both analytical and experimental results demonstrate that our algorithm has better performance than other distributed algorithms.
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
Das, B., Sivakumar, R., Bharghavan, V.: Routing in ad hoc networks using a spine. In: Proc. Int. Conf. Comput. and Commun. Networks, Las Vegas, NV (1997)
Kozat, U.C., Kondylis, G., Ryu, B., Marina, M.K.: Virtual Dynamic Backbone for Mobile Ad Hoc Networks. In: IEEE International Conference on Communications (ICC), Helsinki, Finland (2001)
Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proc Of 11th Canadian Conf. on Computational, Geometry, Vancouver (1999)
Sivakumar, R., Das, B., Bharghavan, V.: An improved spine-based infrastructure for routing in ad hoc networks. In: Proc. IEEE Symp. Comput. And Commun., Athens, Greece (1998)
Wu, J., Li, H.: A dominating-set-based routing scheme in ad hoc wireless networks. Telecomm. System, special issue on wireless networks 18, 13–36 (2001)
Dai, F., Wu, J.: Distributed dominant pruning in ad hoc wireless networks. In: Proc. Of IEEE International Conference on Communications (ICC) (2003)
Alber, J., Fellows, M.R., Miedermeier, R.: Polynomial-time data reduction for dominating set. Journal of the ACM (JACM) 51, 363–384 (2004)
Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20, 374–387 (1998)
Alzoubi, K.M., Wan, P.-J., Frieder, O.: Distributed heuristics for connected dominating sets in wireless ad hoc networks. J. Comm. And Networks 4, 22–29 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, H., Pan, Y., Stojmenovic, I. (2006). A Pure Localized Algorithm for Finding Connected Dominating Set in MANETs by Classification of Neighbors. In: Cheng, X., Li, W., Znati, T. (eds) Wireless Algorithms, Systems, and Applications. WASA 2006. Lecture Notes in Computer Science, vol 4138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814856_36
Download citation
DOI: https://doi.org/10.1007/11814856_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37189-2
Online ISBN: 978-3-540-37190-8
eBook Packages: Computer ScienceComputer Science (R0)