{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T05:35:59Z","timestamp":1725773759352},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642545214"},{"type":"electronic","value":"9783642545221"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54522-1_4","type":"book-chapter","created":{"date-parts":[[2014,3,4]],"date-time":"2014-03-04T08:58:04Z","timestamp":1393923484000},"page":"31-40","source":"Crossref","is-referenced-by-count":0,"title":["Virtual Backbone Construction Algorithms Based on Protocol Interference Model"],"prefix":"10.1007","author":[{"given":"Guomin","family":"Yan","sequence":"first","affiliation":[]},{"given":"Jiguo","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Congcong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Lili","family":"Jia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Ni, S.Y., Tseng, Y.C., Chen, Y.S., Sheu, J.P.: The broadcast storm problem in a mobile ad hoc network. In: Proc. 5th ACM\/IEEE International Conf. Mobile Computing Networking (MobiCom), pp. 151\u2013162 (1999)","DOI":"10.1145\/313451.313525"},{"issue":"2","key":"4_CR2","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 construc-tion in multihop ad hoc wireless networks: research articles. Wireless Communications and Mobile Computing\u00a06(2), 183\u2013190 (2006)","journal-title":"Wireless Communications and Mobile Computing"},{"key":"4_CR3","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, San Francisco (1979)"},{"issue":"1-3","key":"4_CR4","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(1-3), 165\u2013177 (1990)","journal-title":"Discrete Mathematics"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Alzoubi, K.M., Wan, P.J., Frieder, O.: Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks. In: ACM Mobihoc, pp. 157\u2013164 (2002)","DOI":"10.1145\/513800.513820"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Wan, P.J., Alzoubi, K.M., Frieder, O.: Distributed Construction of Connected Dominating Set in Wireless Networks. In: Proceedings of IEEE Conference on Computer Communications (INFOCOM), pp. 141\u2013149 (2002)","DOI":"10.1023\/B:MONE.0000013625.87793.13"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-14654-1_2","volume-title":"Wireless Algorithms, Systems, and Applications","author":"J. Yu","year":"2010","unstructured":"Yu, J., Wang, N., Wang, G.: Heuristic Algorithms for Constructing Connected Dominating Sets with Minimum Size and Bounded Diameter in Wireless Networks. In: Pandurangan, G., Anil Kumar, V.S., Ming, G., Liu, Y., Li, Y. (eds.) WASA 2010. LNCS, vol.\u00a06221, pp. 11\u201320. Springer, Heidelberg (2010)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Schmid, S., Wattenhofer, R.: Algorithmic models for sensor networks. In: Proc. of the 14th International Workshop on Parallel and Distributed Real-Time Systems, p. 11 (2006)","DOI":"10.1109\/IPDPS.2006.1639417"},{"issue":"4","key":"4_CR9","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.: 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":"13","key":"4_CR10","first-page":"105","volume":"36","author":"N. Wang","year":"2010","unstructured":"Wang, N., Yu, J., Qi, Y.: Nodes Neighborhood Relation-based Construction Algorithm for Minimum Connected Domination Set. Computer Engineering\u00a036(13), 105\u2013107 (2010)","journal-title":"Computer Engineering"},{"issue":"4","key":"4_CR11","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/j.jcss.2005.04.002","volume":"71","author":"D. Dubhashi","year":"2005","unstructured":"Dubhashi, D., Mei, A., Panconesi, A., Radhakrishnan, J., Srinivasan, A.: Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. J. Computer System Sciences\u00a071(4), 467\u2013479 (2005)","journal-title":"J. Computer System Sciences"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11830924_3","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"C. Amb\u00fchl","year":"2006","unstructured":"Amb\u00fchl, C., Erlebach, T., Mihal\u00e1k, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX and RANDOM 2006. LNCS, vol.\u00a04110, pp. 3\u201314. Springer, Heidelberg (2006)"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10878-008-9146-0","volume":"18","author":"Y. Huang","year":"2008","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\u00a018(2), 179\u2013194 (2008)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"3","key":"4_CR14","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.tcs.2009.06.022","volume":"412","author":"F. Zou","year":"2009","unstructured":"Zou, F., Wang, Y., Xu, X., Li, X., Du, H., Wan, P., Wu, W.: New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs. Theoretical Computer Science\u00a0412(3), 198\u2013208 (2009)","journal-title":"Theoretical Computer Science"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Du, H., Ye, Q., Wu, W., Lee, W., Li, D., Du, D., Howard, S.: Constant approximation for virtual backbone construction with Guaranteed Routing Cost in wireless sensor networks. In: Proc. of INFOCOM, pp. 1737\u20131744 (2011)","DOI":"10.1109\/INFCOM.2011.5934967"},{"issue":"1","key":"4_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.jpdc.2011.07.002","volume":"72","author":"J.G. Yu","year":"2012","unstructured":"Yu, J.G., Wang, N., Wang, G.: Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks. Journal of Parallel Distributed Computing\u00a072(1), 35\u201347 (2012)","journal-title":"Journal of Parallel Distributed Computing"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Scheideler, C., Richa, A., Santi, P.: An O(logn) Dominating Set Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model. In: Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 91\u2013100 (2008)","DOI":"10.1145\/1374618.1374632"},{"issue":"2","key":"4_CR18","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1109\/18.825799","volume":"42","author":"P. Gupta","year":"2000","unstructured":"Gupta, P., Kumar, P.R.: The Capacity of Wireless Networks. IEEE Transactions on Information Theory\u00a042(2), 388\u2013404 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"12","key":"4_CR19","doi-asserted-by":"publisher","first-page":"3550","DOI":"10.1109\/TCOMM.2010.101910.090144","volume":"58","author":"S.C.H. Huang","year":"2010","unstructured":"Huang, S.C.H., Sun, M.T., Liang, Q.L., Wan, P., Jia, X.: Interference-Aware, Fully-Distributed Virtual Backbone Construction and its Application in Multi-Hop Wireless Networks. IEEE Transactions on communications\u00a058(12), 3550\u20133560 (2010)","journal-title":"IEEE Transactions on communications"},{"key":"4_CR20","unstructured":"West, D.: Introduction to Graph Theory, 2nd edn., pp. 107\u2013109. Prentice Hall (2001)"},{"key":"4_CR21","unstructured":"Bunke, H.: Graph Matching: Theoretical Foundations. Algorithms, and Applications. In: Proc. VI 2003, pp. 82\u201388 (2000)"}],"container-title":["Communications in Computer and Information Science","Advances in Wireless Sensor Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54522-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T06:39:32Z","timestamp":1558852772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54522-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642545214","9783642545221"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54522-1_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]}}}