{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:30:08Z","timestamp":1725892208811},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642318689"},{"type":"electronic","value":"9783642318696"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31869-6_11","type":"book-chapter","created":{"date-parts":[[2012,8,10]],"date-time":"2012-08-10T07:29:19Z","timestamp":1344583759000},"page":"132-141","source":"Crossref","is-referenced-by-count":4,"title":["Minimum Total Communication Power Connected Dominating Set in Wireless Networks"],"prefix":"10.1007","author":[{"given":"Deying","family":"Li","sequence":"first","affiliation":[]},{"given":"Donghyun","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Qinghua","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Lin","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S. Guha","year":"1996","unstructured":"Guha, S., Khuller, S.: Approximation Algorithms for Connected Dominating Sets. Algorithmica\u00a020, 374\u2013387 (1996)","journal-title":"Algorithmica"},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/1167935.1167941","volume":"2","author":"S. Funke","year":"2006","unstructured":"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)\u00a02(3), 444\u2013453 (2006)","journal-title":"ACM Transactions on Sensor Networks (TOSN)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-88582-5_18","volume-title":"Wireless Algorithms, Systems, and Applications","author":"X. Li","year":"2008","unstructured":"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.\u00a05258, pp. 162\u2013175. Springer, Heidelberg (2008)"},{"issue":"4","key":"11_CR4","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1002\/net.10097","volume":"42","author":"X. Cheng","year":"2003","unstructured":"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\u00a042(4), 202\u2013208 (2003)","journal-title":"Networks"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/B:MONE.0000013625.87793.13","volume":"9","author":"P.-J. Wan","year":"2004","unstructured":"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)\u00a09(2), 141\u2013149 (2004)","journal-title":"ACM Journal on Mobile Networks and Applications (MONET)"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1109\/JCN.2002.6596934","volume":"4","author":"J. Wu","year":"2002","unstructured":"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\u00a04, 59\u201370 (2002)","journal-title":"IEEE\/KICS Journal of Communications and Networks"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TPDS.2008.74","volume":"20","author":"D. Kim","year":"2009","unstructured":"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)\u00a020(2), 147\u2013157 (2009)","journal-title":"IEEE Transactions on Parallel and Distributed Systems (TPDS)"},{"issue":"8","key":"11_CR8","doi-asserted-by":"publisher","first-page":"1108","DOI":"10.1109\/TMC.2010.55","volume":"9","author":"D. Kim","year":"2010","unstructured":"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)\u00a09(8), 1108\u20131118 (2010)","journal-title":"IEEE Transactions on Mobile Computing (TMC)"},{"issue":"7","key":"11_CR9","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TMC.2007.1034","volume":"6","author":"M.T. Thai","year":"2007","unstructured":"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)\u00a06(7), 721\u2013730 (2007)","journal-title":"IEEE Transactions on Mobile Computing (TMC)"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1006\/inco.1998.2754","volume":"150","author":"S. Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. Information and Computation\u00a0150(1), 57\u201374 (1999)","journal-title":"Information and Computation"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-540-69733-6_54","volume-title":"Computing and Combinatorics","author":"X. Gao","year":"2008","unstructured":"Gao, X., Huang, Y., Zhang, Z., Wu, W.: (6 + \u03b5)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol.\u00a05092, pp. 551\u2013557. Springer, Heidelberg (2008)"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10878-008-9146-0","volume":"18","author":"Y. Huang","year":"2009","unstructured":"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)\u00a018(2), 179\u2013194 (2009)","journal-title":"Journal of Combinatorial Optimization (JOCO)"},{"issue":"8-10","key":"11_CR13","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.tcs.2008.11.015","volume":"41","author":"D. Dai","year":"2009","unstructured":"Dai, D., Yu, C.: A (5\u2009+\u2009\u03b5)-Approximation Algorithm for Minimum Weighted Dominating Set in Unit Disk Graph. Theoretical Computer Science (TCS)\u00a041(8-10), 756\u2013765 (2009)","journal-title":"Theoretical Computer Science (TCS)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44693-1_11","volume-title":"STACS 2001","author":"A. Clementi","year":"2001","unstructured":"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.\u00a02010, pp. 121\u2013131. Springer, Heidelberg (2001)"},{"issue":"6","key":"11_CR15","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1023\/A:1020381720601","volume":"8","author":"P.J. Wan","year":"2002","unstructured":"Wan, P.J., Calinescu, G., Li, X.Y., Frieder, O.: Minimum-energy Broadcasting in Static Ad Hoc Wireless Networks. Wireless Networks\u00a08(6), 607\u2013617 (2002)","journal-title":"Wireless Networks"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1007\/11523468_92","volume-title":"Automata, Languages and Programming","author":"C. Amb\u00fchl","year":"2005","unstructured":"Amb\u00fchl, 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.\u00a03580, pp. 1139\u20131150. Springer, Heidelberg (2005)"},{"issue":"4","key":"11_CR17","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/s00453-007-9077-7","volume":"49","author":"M. Flammini","year":"2007","unstructured":"Flammini, M., Klasing, R., Navarra, A., Perennes, S.: Improved Approximation Results for the Minimum Energy Broadcasting Problem. Algorithmica\u00a049(4), 318\u2013336 (2007)","journal-title":"Algorithmica"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B.N. Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit Disk Graphs. Discrete Mathematics\u00a086, 165\u2013177 (1990)","journal-title":"Discrete Mathematics"},{"issue":"4","key":"11_CR19","first-page":"355","volume":"4","author":"P. Carmi","year":"2007","unstructured":"Carmi, P., Katz, M.J., Segal, M., Shpungin, H.: Fault-Tolerant Power Assignment and Backbone in Wireless Networks. Ad Hoc & Sensor Wireless Networks\u00a04(4), 355\u2013366 (2007)","journal-title":"Ad Hoc & Sensor Wireless Networks"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31869-6_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:49:40Z","timestamp":1620114580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31869-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642318689","9783642318696"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31869-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}