{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:26:22Z","timestamp":1725870382552},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319490489"},{"type":"electronic","value":"9783319490496"}],"license":[{"start":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T00:00:00Z","timestamp":1478649600000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-49049-6_4","type":"book-chapter","created":{"date-parts":[[2016,11,8]],"date-time":"2016-11-08T01:24:58Z","timestamp":1478568298000},"page":"45-59","source":"Crossref","is-referenced-by-count":0,"title":["A Local Search Algorithm for Saving Energy Cost in Duty-Cycle Wireless Sensor Network"],"prefix":"10.1007","author":[{"given":"Huynh Thi Thanh","family":"Binh","sequence":"first","affiliation":[]},{"given":"Vo Khanh","family":"Trung","sequence":"additional","affiliation":[]},{"given":"Ngo Hong","family":"Son","sequence":"additional","affiliation":[]},{"given":"Eryk","family":"Dutkiewicz","sequence":"additional","affiliation":[]},{"given":"Diep N.","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,9]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"J. Wieselthier, G. Nguyen, and A. Ephremides: On the construction of energy-efficient broadcast and multicast trees in wireless networks. in Proc. IEEE INFOCOM (2000) 585\u2013594.","DOI":"10.1109\/INFCOM.2000.832232"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"P.-J. Wan, G. Calinescu, and C.-W. Yi: Minimum-power multicast routing in static ad hoc wireless networks. IEEE\/ACM Trans. Netw., vol. 12, no. 3 (2004) 507\u2013514.","DOI":"10.1109\/TNET.2004.828940"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"W. Liang: Approximate minimum-energy multicasting in wireless ad hoc networks. IEEE Trans. Mobile Comput., vol. 5, no. 4(2006) 377\u2013387.","DOI":"10.1109\/TMC.2006.1599406"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"D. Li, Q. Liu, X. Hu, and X. Jia: Energy efficient multicast routing in ad hoc wireless networks. Computer Communications, vol. 30, no. 18 (2007) 3746\u20133756.","DOI":"10.1016\/j.comcom.2007.09.003"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"K. Han, Y. Liu, and J. Luo: Duty-Cycle-Aware Minimum-Energy Multicasting in Wireless Sensor Networks. IEEE\/ACM Transactions on Networking. vol. 21, no. 3 (2013) 910\u2013923.","DOI":"10.1109\/TNET.2012.2212452"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"L. Su, B. Ding, Y. Yang, T. F. Abdelzaher, G. Cao, and J. C. Hou: ocast: Optimal multicast routing protocol for wireless sensor networks, in Proc. IEEE ICNP (2009)151\u2013160.","DOI":"10.1109\/ICNP.2009.5339689"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"T. D. Nguyen, T. B. Huynh and H. S. Ngo: Group Steiner Tree Model for Energy Efficient Multicast in Duty-Cycle Wireless Sensor Networks, in The Fifth IEEE International Conference on Communications and Electronics (2014) 244\u2013249.","DOI":"10.1109\/CCE.2014.6916710"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"G. Ausiello, A. D\u2019Atri, and M. Protasi: Structure preserving reductions among convex optimization problems, Journal of Computer and System Sciences, vol. 21, no. 1 (1980) 136\u2013153.","DOI":"10.1016\/0022-0000(80)90046-X"},{"key":"4_CR9","unstructured":"B. Awerbuch: Distributed Shortest Paths Algorithms (Extended Abstract), in Proc. ACM STOC (1989) 490\u2013500."},{"key":"4_CR10","unstructured":"M. R. Garey, and D. S. Johnson: Computers and Intractability: A Guide to the Theory of NP Completeness, W. H. Freeman, New York (1979)."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"D. S. Johnson: Approximation algorithms for combinatorial problems. Proc. ACM STOC (1973) 38-49.","DOI":"10.1145\/800125.804034"}],"container-title":["Proceedings in Adaptation, Learning and Optimization","Intelligent and Evolutionary Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49049-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T23:03:05Z","timestamp":1498345385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49049-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,9]]},"ISBN":["9783319490489","9783319490496"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49049-6_4","relation":{},"ISSN":["2363-6084","2363-6092"],"issn-type":[{"type":"print","value":"2363-6084"},{"type":"electronic","value":"2363-6092"}],"subject":[],"published":{"date-parts":[[2016,11,9]]}}}