{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T10:29:23Z","timestamp":1673605763504},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2013,2,7]],"date-time":"2013-02-07T00:00:00Z","timestamp":1360195200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s11276-012-0512-6","type":"journal-article","created":{"date-parts":[[2013,2,6]],"date-time":"2013-02-06T04:00:40Z","timestamp":1360123240000},"page":"969-984","source":"Crossref","is-referenced-by-count":11,"title":["Construction and maintenance of virtual backbone in wireless networks"],"prefix":"10.1007","volume":"19","author":[{"given":"K. K.","family":"Shukla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Sah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,7]]},"reference":[{"key":"512_CR1","first-page":"134","volume-title":"Construction of minimum connected dominating set in 3-D wireless network, LNCS 5258","author":"F Zoul","year":"2008","unstructured":"Zoul, F., Li, X., Kim, D., & Wu, W. (2008). Construction of minimum connected dominating set in 3-D wireless network, LNCS 5258 (pp. 134\u2013140). New York: Springer."},{"key":"512_CR2","volume-title":"Computer networks","author":"A Tanenbaum","year":"1996","unstructured":"Tanenbaum, A. (1996). Computer networks. Englewood Cliffs: Prentice Hall."},{"issue":"1","key":"512_CR3","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/PROC.1987.13705","volume":"75","author":"A Ephremides","year":"1987","unstructured":"Ephremides, A., Wieselthier, J., & Baker, D. A. (1987). Design concept for reliable mobile radio networks with frequency hopping signalling. IEEE Proceedings, 75(1), 56\u201373.","journal-title":"IEEE Proceedings"},{"issue":"2","key":"512_CR4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TPDS.2008.74","volume":"20","author":"D Kim","year":"2009","unstructured":"Kim, D., Wu, Y., Li, Y., & Du, D. (2009). Constructing minimum connected dominating sets with bounded diameters in wireless networks. IEEE Transactions on Parallel and Distributed System, 20(2), 147\u2013157.","journal-title":"IEEE Transactions on Parallel and Distributed System"},{"key":"512_CR5","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1978","unstructured":"Garey, M. R., & Johnson, D. S. (1978). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman."},{"issue":"4","key":"512_CR6","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha, S., & Khuller, S. (1998). Approximation algorithms for connected dominating sets. Algorithmica, 20(4), 374\u2013387.","journal-title":"Algorithmica"},{"key":"512_CR7","unstructured":"Butenko, S., Cheng, X., Oliveira, C. A. S., & Pardalos, P. M. (2005). A new heuristic for the minimum connected dominating set problem on wireless ad-hoc networks). In R. Murphey & P. M. Pardalos (Eds.), Cooperative control & optimization (pp. 61\u201373). Norwell: Kluwer Academic Press."},{"issue":"2","key":"512_CR8","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1002\/wcm.125","volume":"3","author":"J Wu","year":"2003","unstructured":"Wu, J., Wu, B., & Stojmenovic, I. (2003). Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets. Wireless Communication and Mobile Computing, 3(2), 425\u2013438.","journal-title":"Wireless Communication and Mobile Computing"},{"issue":"1\u20133","key":"512_CR9","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.tcs.2004.08.013","volume":"329","author":"L Ruan","year":"2004","unstructured":"Ruan, L., Du, H., Jia, X., Wu, W., Li, Y., & Ko, K. I. (2004). A greedy approximation for minimum connected dominating sets. Theoretical Computer Science Archive, 329(1\u20133), 325\u2013330.","journal-title":"Theoretical Computer Science Archive"},{"key":"512_CR10","first-page":"1597","volume":"3","author":"R Sivakumar","year":"1998","unstructured":"Sivakumar, R., Das, B., & Bharghavan, V. (1998). An improved spine based infrastructure for routing in ad-hoc networks. Third IEEE Symposium on Computers and Communication, 3, 1597\u20131604.","journal-title":"Third IEEE Symposium on Computers and Communication"},{"issue":"5","key":"512_CR11","first-page":"658","volume":"18","author":"PJ Wan","year":"2002","unstructured":"Wan, P. J., Alzoubi, K. M., & Frieder, O. (2002). Distributed construction of connected dominating set in wireless ad hoc networks. IEEE Transactions on Parallel and Distributed System, 18(5), 658\u2013671.","journal-title":"IEEE Transactions on Parallel and Distributed System"},{"key":"512_CR12","doi-asserted-by":"crossref","unstructured":"Butenko, S., Cheng, X., Du, D. Z., & Pardalos, P. (2003).On the construction of virtual backbone for ad-hoc wireless networks. In 2nd conference on cooperative control and optimization, pp. 68\u201374.","DOI":"10.1007\/978-1-4757-3758-5_3"},{"key":"512_CR13","unstructured":"Blum, J., Andrew, M. D., & Cheng, T. X. (2004). Connected dominating set in sensor networks and MANETs. In D.-Z. Du & P. Pardalos (Eds.), Handbook of combinatorial optimization (pp. 329\u2013369). Dordrecht: Kluwer Academic Publishers."},{"key":"512_CR14","doi-asserted-by":"crossref","unstructured":"Wu, J., & Li, H. (1999). On calculating connected dominating set for efficient routing in ad wireless networks. In 3rd international workshop on discrete algorithms and methods for mobile computing and communications ACM, USA, pp. 7\u201314.","DOI":"10.1145\/313239.313261"},{"key":"512_CR15","doi-asserted-by":"crossref","unstructured":"Li, Y., Peng, S., & Chu, W. (2006). An efficient algorithm for finding an almost connected dominating set of small size on wireless ad hoc networks. In Paper presented, IEEE international conference on communications, Japan, pp. 120\u2013131.","DOI":"10.1109\/MOBHOC.2006.278557"},{"key":"512_CR16","unstructured":"Zhou, D., & Wang, F., et al. (2005). A timer based protocol for CDS construction, SAINT 2005, IEEE 0-7695-2262-9"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-012-0512-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-012-0512-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-012-0512-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T05:38:42Z","timestamp":1562650722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-012-0512-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,7]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["512"],"URL":"https:\/\/doi.org\/10.1007\/s11276-012-0512-6","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,7]]}}}