Routingefficient CDS construction in DiskContainment Graphs
 Zaixin Lu,
 Lidong Wu,
 Panos M. Pardalos,
 Eugene Maslov,
 Wonjun Lee,
 DingZhu Du
 … show all 6 hide
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Abstract
In wireless networks, Connected Dominating Sets (CDSs) are widely used as virtual backbones for communications. On one hand, reducing the backbone size will reduce the maintenance overhead. So how to minimize the CDS size is a critical issue. On the other hand, when evaluating the performance of a wireless network, the hop distance between two communication nodes, which reflect the energy consumption and response delay, is of great importance. Hence how to minimize the routing cost is also a key problem for constructing the network virtual backbone. In this paper, we study the problem of constructing applicable CDS in wireless networks in terms of size and routing cost. We formulate a wireless network as a DiskContainment Graph (DCG), which is a generalization of the UnitDisk Graph (UDG), and we develop an efficient algorithm to construct CDS in such kind of graphs. The algorithm contains two parts and is flexible to balance the performance between the two metrics. We also analyze the algorithm theoretically. It is shown that our algorithm has provable performance in minimizing the CDS size and reducing the communication distance for routing.
Inside
Within this Article
 Introduction
 Preliminaries
 Related works
 Algorithm
 Theoretical analysis
 Conclusion
 References
 References
Other actions
 Garey, M.R., Johnson, D.S.: Computers and intractability. Freeman, A Guide to the Theory of NPCompleteness, New York (1979)
 Clark, B., Colbourn, C., Johnson, D.: Unit disk graphs. Disc. Math. 86, 165–177 (1990) CrossRef
 Feige, U.: A threshold of $\ln n$ for approximating setcover. Proceedings of the 28th ACM Symposium on Theory of Computing, New york. pp. 314–318 (1996)
 Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20, 374–387 (1998) CrossRef
 Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of domination in graphs. Marcel Dekker Inc., New York (1998)
 Wan, P., Alzoubi, K., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. Proceedings of the 21th Annual Joint Conference of IEEE Communication and Computer Society, pp. 1597–1604 (2002)
 Cheng, X., Huang, X., Li, D., Wu, W., Du, D.Z.: Polynomialtime approximation scheme for minimum connected dominating set in ad hoc wireless networks. Networks 42(4), 202–208 (2003) CrossRef
 Bao, L., GarciaLunaAceves, J.J.: Topology management in ad hoc networks. Proceedings of the 4th ACM international symposium on Mobile ad hoc networking& computing, pp. 129–140 (2003)
 Mohammed, K., Gewali, L., Muthukumar, V.: Generating quality dominating sets for sensor network. Proceedings of the 6th International Conference on Computational Intelligence and Multimedia Applications, pp. 204–211 (2005)
 Dai, F., Wu, J.: On constructing kconnected kdominating set in wireless network. J. Parallel Distrib. Comput. 66(7), 946–958 (2005)
 Wu, W., Du, H., Jia, X., Li, Y., Huang, S.C.H.: Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theor. Comput. Sci. 352(1–3), 1–7 (2006) CrossRef
 Wu, Y., Wang, F., Thai, M.T., Li, Y.: Constructing kconnected mdominating sets in wireless sensor networks. Proceedings of Military Communications Conference, pp. 1–7 (2007)
 Thai, M., Zhang, N., Tiwari, R., Xu, X.: On approximation algorithms of kconnected mdominating sets in disk graphs. Theor. Comput. Sci. 358(1–3), 49–59 (2007) CrossRef
 Thai, M., Wang, F., Liu, D., Zhu, S., Du, D.Z.: Connected dominating sets in wireless networks with different transmission ranges. IEEE Trans. Mobile Comput. 6(7), 721–730 (2007) CrossRef
 Xing, K., Cheng, W., Park, E.K., Rotenstreich, S.: Distributed connected dominating set construction in geometric kdisk graphs. Proceedings of the 28th IEEE International Conference on Distributed, Computing Systems, pp. 673–680 (2008)
 Wang, F., Thai, M.T., Du, D.Z.: 2Connected virtual backbone in wireless network. IEEE Trans. Wirel. Commun. 8(3), 1230–1237 (2009) CrossRef
 Kim, D., Wu, Y., Li, Y., Zou, F., Du, D.Z.: Constructing minimum connected dominating sets with bounded diameters in wireless networks. IEEE Trans. Parallel Distrib. Systems 20(2), 147–157 (2009) CrossRef
 Kim, D., Zhang, Z., Li, X., Wang, W., Wu, W., Du, D.Z.: A better approximation algorithm for computing connected dominating sets in unit ball graphs. IEEE Trans. Mobile Comput. 9(8), 1108–1118 (2010)
 Kim, D., Wang, W., Li, X., Zhang, Z., Wu, W.: A new constant factor approximation for computing 3connected mdominating sets in homogeneous wireless networks. Proceedings of the 29th Annual Joint Conference of IEEE Communication and Computer Society, pp. 2739–2747 (2010)
 Wang, L., Wan, P., Yao, F.F.: Minimum CDS in multihop wireless networks with disparate communication ranges. Proceedings of the 5th International Conference on Wireless algorithms, Systems, and Applications, pp. 47–56 (2010)
 Ding, L., Wu, W., Willson, J., Du, H., Lee, W., Du, D.Z.: Efficient algorithms for topology control problem with routing cost constraints in wireless networks. IEEE Trans. Parallel Distrib. Systems 22(10), 1601–1609 (2011) CrossRef
 Du, H., Ye, Q., Wu, W., Lee, W., Li, D., Du, D.Z., Howard, S.: Constant approximation for virtual backbone construction with guaranteed routing cost in wireleess sensor netowrks. Proceedings of 30th Annual Joint Conference of IEEE Communication and Computer Society, pp. 1737–1744 (2011)
 Ding, L., Wu, W., Willson, J.K., Wu, L., Lu, Z., Lee, W.: Constantapproximation for target coverage problem in wireless sensor networks. Proceedings of 31th Annual Joint Conference of IEEE Communication and Computer Society, pp. 1584–1592 (2012)
 Du, H., Wu, W., Ye, Q., Li, W.D., Xu, X.: CDSbased virtual backbone construction with guaranteed routing cost in wireless sensor networks. IEEE Trans. Parallel Distrib. Systems
 Title
 Routingefficient CDS construction in DiskContainment Graphs
 Journal

Optimization Letters
Volume 8, Issue 2 , pp 425434
 Cover Date
 20140201
 DOI
 10.1007/s1159001205905
 Print ISSN
 18624472
 Online ISSN
 18624480
 Publisher
 Springer Berlin Heidelberg
 Additional Links
 Topics
 Keywords

 Wireless network
 CDS
 Routing efficiency
 Approximation algorithm
 Industry Sectors
 Authors

 Zaixin Lu ^{(1)}
 Lidong Wu ^{(1)}
 Panos M. Pardalos ^{(2)} ^{(3)}
 Eugene Maslov ^{(3)}
 Wonjun Lee ^{(4)}
 DingZhu Du ^{(1)}
 Author Affiliations

 1. Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75080, USA
 2. Department of Industrial and System Engineering and Center for Applied Optimization, University of Florida, Gainesville, FL, 32611, USA
 3. Laboratory of Algorithms and Technologies for Network Analysis (LATNA), Higher School of Economics, National Research University, 136 Rodionova St., Nizhny Novgorod, 603093, Russia
 4. Department of Computer Science and Engineering, Korea University, Reoul, Republic of Korea