{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T11:25:34Z","timestamp":1722943534098},"reference-count":15,"publisher":"Engineering and Technology Publishing","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["jcm"],"published-print":{"date-parts":[[2016]]},"DOI":"10.12720\/jcm.11.4.365-373","type":"journal-article","created":{"date-parts":[[2016,8,5]],"date-time":"2016-08-05T02:46:41Z","timestamp":1470365201000},"source":"Crossref","is-referenced-by-count":1,"title":["Maximizing Lifetime of CDS-Based Wireless Ad Hoc Networks"],"prefix":"10.12720","author":[{"name":"College of Computer Science and Technology, Jilin University, Changchun, China","sequence":"first","affiliation":[]},{"given":"Xiaohui","family":"Wei","sequence":"first","affiliation":[]},{"given":"Yuanyuan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Bai","sequence":"additional","affiliation":[]}],"member":"4977","published-online":{"date-parts":[[2016]]},"reference":[{"key":"ref0","unstructured":"[1] D. Z. Du and P. J. Wan, Connected Dominating set: Theory and Applications, Springer Science & Business Media, 2012, vol. 77."},{"key":"ref1","doi-asserted-by":"crossref","unstructured":"[2] D. Kim, Y. Wu, Y. Li, F. Zou, and D. Z. Du, \"Constructing minimum connected dominating sets with bounded diameters in wireless networks,\" IEEE Trans. Parallel and Distributed Systems, vol. 20, no. 2, pp. 147-157, Jan. 2009.","DOI":"10.1109\/TPDS.2008.74"},{"key":"ref2","doi-asserted-by":"crossref","unstructured":"[3] J. Yu, N. Wang, G. Wang, and D. Yu, \"Connected dominating sets in wireless ad hoc and sensor networks\u2013A comprehensive survey,\" Computer Communications, vol. 36, no. 2, pp. 121-134, Jan. 2013.","DOI":"10.1016\/j.comcom.2012.10.005"},{"key":"ref3","doi-asserted-by":"crossref","unstructured":"[4] Y. L. Du and H. W. Du, \"A new bound on maximum independent set and minimum connected dominating set in unit disk graphs,\" Journal of Combinatorial Optimization, vol. 30, no. 4, pp. 1-7, Dec. 2013.","DOI":"10.1007\/s10878-013-9690-0"},{"key":"ref4","doi-asserted-by":"crossref","unstructured":"[5] Z. Wang, W. Wang, J. M. Kim, B. Thuraisingham, and W. Wu, \"PTAS for the minimum weighted dominating set in growth bounded graphs,\" Journal of Global Optimization, vol. 54, no. 3, pp. 641-648, Nov. 2012.","DOI":"10.1007\/s10898-011-9795-x"},{"key":"ref5","doi-asserted-by":"crossref","unstructured":"[6] L. Wang, P. J. Wan, and F. Yao, \"Minimum cds in multihop wireless networks with disparate communication ranges,\" IEEE Trans. Mobile Computing, vol. 12, no. 5, pp. 909-916, Mar. 2013.","DOI":"10.1109\/TMC.2012.58"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"[7] P. J. Wan, K. M. Alzoubi, and O. Frieder, \"Distributed construction of connected dominating set in wireless ad hoc networks,\" Mobile Networks and Applications, vol. 9, no. 2, pp. 141-149, Apr. 2004.","DOI":"10.1023\/B:MONE.0000013625.87793.13"},{"key":"ref7","doi-asserted-by":"crossref","unstructured":"[8] W. Weili, \"Minimum connected dominating sets and maximal independent sets in unit disk graphs,\" Theoretical Computer Science, vol. 352, no. 1-3, pp. 1\u20137, Mar. 2006.","DOI":"10.1016\/j.tcs.2005.08.037"},{"key":"ref8","doi-asserted-by":"crossref","unstructured":"[9] M. Li, P. J. Wan, and F. Yao, \"Tighter approximation bounds for minimum CDS in wireless ad hoc networks,\" Algorithms and Computation, vol. 5878, pp. 699-709, Dec. 2009.","DOI":"10.1007\/978-3-642-10631-6_71"},{"key":"ref9","doi-asserted-by":"crossref","unstructured":"[11] L. Ding, X. Gao, W. Wu, W. Lee, X. Zhu, and D. Z. Du, \"Distributed construction of connected dominating sets with minimum routing cost in wireless networks,\" in Proc. IEEE 30th International Conf. Distributed Computing Systems, 2010, pp. 448-457.","DOI":"10.1109\/ICDCS.2010.17"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"[12] L. Ding, W. Wu, J. Willson, H. Du, and W. Lee, \"Efficient virtual backbone construction with routing cost constraint in wireless networks using directional antennas,\" IEEE Trans. Mobile Computing, vol. 11, no. 7, pp. 1102-1112, Jul. 2012.","DOI":"10.1109\/TMC.2011.129"},{"key":"ref11","doi-asserted-by":"crossref","unstructured":"[13] H. Du, W. Wu, Q. Ye, D. Li, W. Lee, and X. Xu, \"CDS-based virtual backbone construction with guaranteed routing cost in wireless sensor networks,\" IEEE Trans. Parallel and Distributed Systems, vol. 24, no. 4, pp. 652-661, Apr 2013.","DOI":"10.1109\/TPDS.2012.177"},{"key":"ref12","doi-asserted-by":"crossref","unstructured":"[14] J. S. He, S. Ji, Y. Pan, and Z. Cai, \"Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks,\" Theoretical Computer Science, vol. 507, pp. 2-16, Oct. 2013.","DOI":"10.1016\/j.tcs.2012.11.020"},{"key":"ref13","doi-asserted-by":"crossref","unstructured":"[15] Y. Li, Y. Wu, C. Ai, and R. Beyah, \"On the construction of k-connected m-dominating sets in wireless networks,\" Journal of combinatorial optimization, vol. 23, no. 1, pp. 118-139, Jan. 2012.","DOI":"10.1007\/s10878-010-9346-2"},{"key":"ref14","doi-asserted-by":"crossref","unstructured":"[16] N. Ahn and S. Park, \"An optimization algorithm for the minimum k-connected m-dominating set problem in wireless sensor networks,\" Wireless Networks, vol. 21, no. 3, pp. 783-792, Sep. 2014.","DOI":"10.1007\/s11276-014-0819-6"}],"container-title":["Journal of Communications"],"original-title":[],"link":[{"URL":"http:\/\/www.jocm.us\/uploadfile\/2016\/0421\/20160421030614347.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T05:14:30Z","timestamp":1568265270000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.jocm.us\/index.php?m=content&c=index&a=show&catid=160&id=963"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":15,"URL":"https:\/\/doi.org\/10.12720\/jcm.11.4.365-373","relation":{},"ISSN":["2374-4367"],"issn-type":[{"type":"print","value":"2374-4367"}],"subject":[],"published":{"date-parts":[[2016]]}}}