{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:20:25Z","timestamp":1764688825435,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642234897"},{"type":"electronic","value":"9783642234903"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23490-3_20","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T08:35:19Z","timestamp":1313570119000},"page":"223-231","source":"Crossref","is-referenced-by-count":1,"title":["A Maximal Independent Set Based Giant Component Formation in Random Unit-Disk Graphs"],"prefix":"10.1007","author":[{"given":"Pengfei","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Xing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liusheng","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dapeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Wu, J., Li, H.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: DIALM 1999: Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7\u201314 (1999)","key":"20_CR1","DOI":"10.1145\/313239.313261"},{"issue":"2","key":"20_CR2","first-page":"169","volume":"5","author":"J. Wu","year":"2002","unstructured":"Wu, J., Dai, F., Gao, M., Stojmenovic, I.: On calculating power-aware connected dominating set for efficient routing in ad hoc wire- less networks. Journal of Communications and Networks\u00a05(2), 169\u2013178 (2002)","journal-title":"Journal of Communications and Networks"},{"key":"20_CR3","first-page":"70","volume-title":"MobiCom 2001: Proceedings of the 7th Annual International Conference on Mobile Computing and Networking","author":"Y. Xu","year":"2001","unstructured":"Xu, Y., Heidemann, J., Estrin, D.: Geography-informed energy conservation for ad hoc routing. In: MobiCom 2001: Proceedings of the 7th Annual International Conference on Mobile Computing and Networking, pp. 70\u201384. ACM, New York (2001)"},{"issue":"8","key":"20_CR4","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1109\/49.779926","volume":"17","author":"R. Sivakumar","year":"1999","unstructured":"Sivakumar, R., Sinha, P., Bharghavan, V.: Cedar: a core-extraction distributed ad hoc routing algorithm. IEEE Journal on Selected Areas in Communications\u00a017(8), 1454\u20131465 (1999)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/MC.2004.1266294","volume":"37","author":"J. Carle","year":"2004","unstructured":"Carle, J., Simplot-Ryl, D.: Energy-efficient area monitoring for sensor networks. Computer\u00a037(2), 40\u201346 (2004)","journal-title":"Computer"},{"issue":"5","key":"20_CR6","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1023\/A:1016542229220","volume":"8","author":"B. Chen","year":"2002","unstructured":"Chen, B., Jamieson, K., Balakrishnan, H., Morris, R.: Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks. Wirel. Netw.\u00a08(5), 481\u2013494 (2002)","journal-title":"Wirel. Netw."},{"key":"20_CR7","first-page":"329","volume-title":"Handbook of Combinatorial Optimization","author":"M.D.J. Blum","year":"2004","unstructured":"Blum, M.D.J., Cheng, X.: Applications of Connected Dominating Sets in Wireless Networks. In: Handbook of Combinatorial Optimization, pp. 329\u2013369. Kluwer Academic Publisher, Boston (2004)"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/wcm.378","volume":"6","author":"X. Cheng","year":"2006","unstructured":"Cheng, X., Ding, M., Du, D.H., Jia, X.: Virtual backbone construction in multihop ad hoc wireless networks. Wireless Communications and Mobile Computing\u00a06, 183\u2013190 (2006)","journal-title":"Wireless Communications and Mobile Computing"},{"doi-asserted-by":"crossref","unstructured":"Balister, P., Bollobas, B., Sarkar, A.: Percolation, connectivity, coverage and colouring of random geometric graphs. Tech. Report (2009)","key":"20_CR9","DOI":"10.1007\/978-3-540-69395-6_2"},{"unstructured":"Huang, S.C.-H., Sun, M.-T., Liang, Q., Wan, P.-J., Jia, a.X.: Interference-aware, fully-distributed virtual backbone construction and its applications in multi-hop wireless networks. To Appear in IEEE Transactions on Communications","key":"20_CR10"},{"key":"20_CR11","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"},{"key":"20_CR12","first-page":"157","volume-title":"MobiHoc 2002: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking & Computing","author":"K.M. Alzoubi","year":"2002","unstructured":"Alzoubi, K.M., Wan, P.-J., Frieder, O.: Message-optimal connected dominating sets in mobile ad hoc networks. In: MobiHoc 2002: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking & Computing, pp. 157\u2013164. ACM, New York (2002)"},{"unstructured":"Li, Y., Zhu, S., Thai, M.T., Du, D.-Z.: Localized construction of connected dominating set in wireless networks. In: NSF International Workshop on Theoretical Aspects of Wireless Ad Hoc, Sensor and Peer-to-Peer Networks, TAWN 2004 (2004)","key":"20_CR13"},{"doi-asserted-by":"crossref","unstructured":"Cheng, X., Ding, M., Du, D.H., Jia, X.: On the construction of connected dominating set in ad hoc wireless networks. In: Wireless Communications and Mobile Computing, vol.\u00a06, pp. 183\u2013190 (2006)","key":"20_CR14","DOI":"10.1002\/wcm.378"},{"doi-asserted-by":"crossref","unstructured":"Blum, J., Ding, M., Thaeler, A., Cheng, X.: Connected dominating sets in sensor networks and manets. In: Du, D.-Z., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, pp. 329\u2013369 (2004)","key":"20_CR15","DOI":"10.1007\/0-387-23830-1_8"},{"key":"20_CR16","first-page":"297","volume-title":"HICSS 2002: Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS 2002)","author":"K. Alzoubi","year":"2002","unstructured":"Alzoubi, K., Wan, P.-J., Frieder, O.: New distributed algorithm for connected dominating set in wireless ad hoc networks. In: HICSS 2002: Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS 2002), vol.\u00a09, p. 297. IEEE Computer Society, Washington, DC (2002)"},{"doi-asserted-by":"crossref","unstructured":"Alzoubi, K., Wan, P., Frieder, O.: Distributed heuristics for connected dominating set in wireless ad hoc networks. Journal of Communications and Networks\u00a04(1) (2002)","key":"20_CR17","DOI":"10.1109\/JCN.2002.6596929"},{"unstructured":"Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. In: Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), pp. 1597\u20131604 (2002)","key":"20_CR18"},{"unstructured":"Cheng, X.: Routing issues in ad hoc wireless networks. PhD Thesis, Department of Computer Science, University of Minnesota (2002)","key":"20_CR19"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/BFb0056477","volume-title":"Distributed Computing","author":"I. Cidon","year":"1998","unstructured":"Cidon, I., Mokryn, O.: Propagation and leader election in a multihop broadcast environment. In: Kutten, S. (ed.) DISC 1998. LNCS, vol.\u00a01499, pp. 104\u2013118. Springer, Heidelberg (1998)"},{"issue":"4","key":"20_CR21","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S. Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica\u00a020(4), 374\u2013387 (1998)","journal-title":"Algorithmica"},{"issue":"1","key":"20_CR22","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10898-005-8466-1","volume":"35","author":"M. Min","year":"2006","unstructured":"Min, M., Du, H., Jia, X., Huang, C.X., Huang, S.C.-H., Wu, W.: Improving construction for connected dominating set with steiner tree in wireless sensor networks. J. of Global Optimization\u00a035(1), 111\u2013119 (2006)","journal-title":"J. of Global Optimization"},{"key":"20_CR23","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"issue":"4","key":"20_CR24","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"},{"doi-asserted-by":"crossref","unstructured":"Ding, L., Guan, Z.: Modeling wireless sensor networks using random graph theory. Physica A\u00a0(12), 3008\u20133016 (2008)","key":"20_CR25","DOI":"10.1016\/j.physa.2008.01.029"},{"doi-asserted-by":"crossref","unstructured":"Dowell, L.J., Bruno, M.L.: Connectivity of random graphs and mobile networks: validation of monte carlo simulation results. In: Proceedings of the 2001 ACM Symposium on Applied Computing, ser. SAC 2001, pp. 77\u201381 (2001)","key":"20_CR26","DOI":"10.1145\/372202.372280"},{"unstructured":"Venkatesh, S.S.: Connectivity of metric random graphs. Tech. Report (2004)","key":"20_CR27"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23490-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:17:40Z","timestamp":1558297060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23490-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642234897","9783642234903"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23490-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}