Years and Authors of Summarized Original Work
2005; Wang, Wang, Li
Problem Definition
This problem is concerned with a weighted version of the classical minimum connected dominating set problem. This problem has numerous motivations including wireless networks and distributed systems. Previous work [1, 2, 4, 5, 6, 14] in wireless networks focuses on designing efficient distributed algorithms to construct the connected dominating set which can be used as the virtual backbone for the network. Most of the proposed methods try to minimize the number of nodes in the backbone (i.e., the number of clusterheads). However, in many applications, minimizing the size of the backbone is not sufficient. For example, in wireless networks different wireless nodes may have different costs for serving as a clusterhead, due to device differences, power capacities, and information loads to be processed. Thus, by assuming each node has a cost to being in the backbone, there is a need to study distributed...
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 subscriptionsRecommended Reading
Alzoubi K, Wan P-J, Frieder O (2002) New distributed algorithm for connected dominating set in wireless ad hoc networks. In: Proceedings of IEEE 35th Hawaii international conference on system sciences (HICSS-35), Hawaii, 7–10 Jan 2002
Alzoubi K, Li X-Y, Wang Y, Wan P-J, Frieder O (2003) Geometric spanners for wireless ad hoc networks. IEEE Trans Parallel Distrib Process 14:408–421
Ambuhl C, Erlebach T, Mihalak M, Nunkesser M (2006) Constant factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Proceedings of the 9th international workshop on approximation algorithms for combinatorial optimization problems (APPROX 2006), Barcelona, 28–30 Aug 2006. LNCS, vol 4110. Springer, Berlin/Heidelberg, pp 3–14
Bao L, Garcia–Aceves JJ (2003) Topology management in ad hoc networks. In: Proceedings of the 4th ACM international symposium on mobile ad hoc networking & computing, Annapolis, 1–3 June 2003. ACM Press, New York, pp 129–140
Chatterjee M, Das S, Turgut D (2002) WCA: a weighted clustering algorithm for mobile ad hoc networks. J Clust Comput 5:193–204
Das B, Bharghavan V (1997) Routing in ad-hoc networks using minimum connected dominating sets. In: Proceedings of IEEE international conference on communications (ICC'97), Montreal, 8–12 June 1997, vol 1, pp 376–380
Guhaa S, Khuller S (1999) Improved methods for approximating node weighted Steiner trees and connected dominating sets. Inf Comput 150:57–74
Kachirski O, Guha R (2002) Intrusion detection using mobile agents in wireless ad hoc networks. In: Proceedings of IEEE workshop on knowledge media networking, Kyoto, 10–12 July 2002
Klein P, Ravi R (1995) A nearly best-possible approximation algorithm for node-weighted Steiner trees. J Algorithms 19:104–115
Kuhn F, Moscibroda T, Wattenhofer R (2004) What cannot be computed locally! In: Proceedings of the 23rd ACM symposium on the principles of distributed computing (PODC), St. John's, July 2004
Li X-Y, Wan P-J (2005) Theoretically good distributed CDMA/OVSF code assignment for wireless ad hoc networks. In: Proceedings of 11th international computing and combinatorics conference (COCOON), Kunming, 16–19 Aug 2005
Wang Y, Wang W, Li X-Y (2005) Efficient distributed low-cost backbone formation for wireless networks. In: Proceedings of 6th ACM international symposium on mobile ad hoc networking and computing (MobiHoc 2005), Urbana-Champaign, 25–27 May 2005
Wang Y, Wang W, Li X-Y (2006) Efficient distributed low cost backbone formation for wireless networks. IEEE Trans Parallel Distrib Syst 17:681–693
Wu J, Li H (2001) A dominating-set-based routing scheme in ad hoc wireless networks. Spec Iss Wirel Netw Telecommun Syst J 3:63–84
Zheng R, He G, Gupta I, Sha L (2004) Time indexing in sensor networks. In: Proceedings of 1st IEEE international conference on mobile ad-hoc and sensor systems (MASS), Fort Lauderdale, 24–27 Oct 2004
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Wang, Y., Wang, W., Li, XY. (2016). Weighted Connected Dominating Set. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_476
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_476
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering