Abstract
Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless ad hoc networks have been proposed in the literature. The majority of these algorithms follow a general two-phased approach. The first phase constructs a dominating set, and the second phase selects additional nodes to interconnect the nodes in the dominating set. In the performance analyses of these two-phased algorithms, the relation between the independence number α and the connected domination number γ c of a unit-disk graph plays the key role. The best-known relation between them is \(\alpha\leq3\frac{2}{3}\gamma_{c}+1\). In this paper, we prove that α ≤ 3.4306γ c + 4.8185. This relation leads to tighter upper bounds on the approximation ratios of two approximation algorithms proposed in the literature.
This work was partially supported by Research Grants Council of Hong Kong SAR under Project No. CityU 122807 and No. CityU 117408, and National Basic Research Program of China Grant 2007CB807900 and 2007CB807901. Peng-Jun Wan was supported in part by National Science Foundation of USA under grants CNS-0831831 and CNS-0916666.
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
Alzoubi, K.M., Wan, P.-J., Frieder, O.: Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks. In: ACM Mobihoc (2002)
Bharghavan, V., Das, B.: Routing in Ad Hoc Networks Using Minimum Connected Dominating Sets. In: IEEE ICC (1997)
Blum, J., Ding, M., Cheng, X.: Applications of Connected Dominating Sets in Wireless Networks. In: Du, D.-Z., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, pp. 329–369. Kluwer Academic Publisher, Dordrecht (2004)
Cadei, M., Cheng, X., Du, D.-Z.: Connected Domination in Ad Hoc Wireless Networks. In: Proc. 6th International Conference on Computer Science and Informatics (2002)
Chvátal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operation Research 4(3), 233–235 (1979)
Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit Disk Graphs. Discrete Mathematics 86, 165–177 (1990)
Funke, S., Kesselman, A., Meyer, U., Segal, M.: A simple improved distributed algorithm for minimum CDS in unit disk graphs. ACM Transactions on Sensor Networks 2(3), 444–453 (2006)
Li, Y.S., Thai, M.T., Wang, F., Yi, C.-W., Wan, P.-J., Du, D.-Z.: On Greedy Construction of Connected Dominating Sets in Wireless Networks. Journal on Wireless Communications and Mobile Computing 5(8), 927–932 (2005)
Lin, F., Yang, X. (eds.): Geometric Measure Theory: An Introduction. International Press (2003)
Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. In: Proc. IEEE Hawaii Int. Conf. on System Sciences (January 2001)
Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Network. ACM/Springer Mobile Networks and Applications 9(2), 141–149 (2004); A preliminary version of this paper appeared in IEEE INFOCOM (2002)
Wan, P.-J., Wang, L., Yao, F.: Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks. In: IEEE ICDCS 2008, pp. 337–344 (2008)
Wu, W., Du, H., Jia, X., Li, Y., Huang, S.C.-H.: Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theoretical Computer Science 352(1-3), 1–7 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, M., Wan, PJ., Yao, F. (2009). Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_71
Download citation
DOI: https://doi.org/10.1007/978-3-642-10631-6_71
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10630-9
Online ISBN: 978-3-642-10631-6
eBook Packages: Computer ScienceComputer Science (R0)