Abstract
A virtual backbone of a wireless network is a connected subset of nodes responsible for routing messages in the network. A node in the subset is likely to be exhausted much faster than the others due to its heavy duties. This situation can be more aggravated if the node uses higher communication power to form the virtual backbone. In this paper, we introduce the minimum total communication power connected dominating set (MTCPCDS) problem, whose goal is to compute a virtual backbone with minimum total communication power. We show this problem is NP-hard and propose two distributed algorithms. Especially, the first algorithm, MST-MTCPCDS, has a worst case performance guarantee. A simulations is conducted to evaluate the performance of our algorithms.
This work was supported in part by the NSFC under Grants No. 61070191 and 91124001, the Fundamental Research Funds for the Central Universities,and the Research Funds of Renmin University of China 12XNH179, and Research Fund for the Doctoral Program of Higher Education of China No. 20100004110001. This work was also supported in part by US National Science Foundation (NSF) CREST No. HRD-0833184 and by US Army Research Office (ARO) No. W911NF-0810510. This work was partially supported by the NSF under Grant No. HRD-0833184, IIS-0513669, CCF-0621829, and CNS-0524429.
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.
References
Guha, S., Khuller, S.: Approximation Algorithms for Connected Dominating Sets. Algorithmica 20, 374–387 (1996)
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 (TOSN) 2(3), 444–453 (2006)
Li, X., Gao, X., Wu, W.: A Better Theoretical Bound to Approximate Connected Dominating Set in Unit Disk Graph. In: Li, Y., Huynh, D.T., Das, S.K., Du, D.-Z. (eds.) WASA 2008. LNCS, vol. 5258, pp. 162–175. Springer, Heidelberg (2008)
Cheng, X., Huang, X., Li, D., Wu, W., Du, D.-Z.: A Polynomial-Time Approximation Scheme for the Minimum-Connected Dominating Set in Ad Hoc Wireless Networks. Networks 42(4), 202–208 (2003)
Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks. ACM Journal on Mobile Networks and Applications (MONET) 9(2), 141–149 (2004)
Wu, J., Dai, F., Gao, M., Stojmenovic, I.: On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks. IEEE/KICS Journal of Communications and Networks 4, 59–70 (2002)
Kim, D., Wu, Y., Li, Y., Zou, F., Du, D.-Z.: Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks. IEEE Transactions on Parallel and Distributed Systems (TPDS) 20(2), 147–157 (2009)
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 Transactions on Mobile Computing (TMC) 9(8), 1108–1118 (2010)
Thai, M.T., Wang, F., Liu, D., Zhu, S., Du, D.-Z.: Connected Dominating Sets in Wireless Networks with Different Transmission Ranges. IEEE Transactions on Mobile Computing (TMC) 6(7), 721–730 (2007)
Guha, S., Khuller, S.: Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. Information and Computation 150(1), 57–74 (1999)
Gao, X., Huang, Y., Zhang, Z., Wu, W.: (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 551–557. Springer, Heidelberg (2008)
Huang, Y., Gao, X., Zhang, Z., Wu, W.: A Better Constant-Factor Approximation for Weighted Dominating Set in Unit Disk Graph. Journal of Combinatorial Optimization (JOCO) 18(2), 179–194 (2009)
Dai, D., Yu, C.: A (5 + ε)-Approximation Algorithm for Minimum Weighted Dominating Set in Unit Disk Graph. Theoretical Computer Science (TCS) 41(8-10), 756–765 (2009)
Clementi, A., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 121–131. Springer, Heidelberg (2001)
Wan, P.J., Calinescu, G., Li, X.Y., Frieder, O.: Minimum-energy Broadcasting in Static Ad Hoc Wireless Networks. Wireless Networks 8(6), 607–617 (2002)
Ambühl, C.: An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1139–1150. Springer, Heidelberg (2005)
Flammini, M., Klasing, R., Navarra, A., Perennes, S.: Improved Approximation Results for the Minimum Energy Broadcasting Problem. Algorithmica 49(4), 318–336 (2007)
Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit Disk Graphs. Discrete Mathematics 86, 165–177 (1990)
Carmi, P., Katz, M.J., Segal, M., Shpungin, H.: Fault-Tolerant Power Assignment and Backbone in Wireless Networks. Ad Hoc & Sensor Wireless Networks 4(4), 355–366 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, D., Kim, D., Zhu, Q., Liu, L., Wu, W. (2012). Minimum Total Communication Power Connected Dominating Set in Wireless Networks. In: Wang, X., Zheng, R., Jing, T., Xing, K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2012. Lecture Notes in Computer Science, vol 7405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31869-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-31869-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31868-9
Online ISBN: 978-3-642-31869-6
eBook Packages: Computer ScienceComputer Science (R0)