{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T04:11:51Z","timestamp":1749096711414,"version":"3.41.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319428352"},{"type":"electronic","value":"9783319428369"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-42836-9_28","type":"book-chapter","created":{"date-parts":[[2016,8,3]],"date-time":"2016-08-03T02:30:38Z","timestamp":1470191438000},"page":"305-317","source":"Crossref","is-referenced-by-count":9,"title":["Minimum-Delay Data Aggregation Schedule in Duty-Cycled Sensor Networks"],"prefix":"10.1007","author":[{"given":"Xiaoting","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongwei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoliang","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,4]]},"reference":[{"key":"28_CR1","unstructured":"Ren, M., Li, J., Guo, L., Cai, Z.: Data collection with probabilistic guarantees in opportunistic wireless networks. Int. J. Sensor Netw. (accepted)"},{"key":"28_CR2","doi-asserted-by":"crossref","first-page":"3527","DOI":"10.1016\/j.comcom.2006.01.032","volume":"29","author":"H Du","year":"2006","unstructured":"Du, H., Hu, X., Jia, X.: Energy efficient routing and scheduling for real-time data aggregation in WSNs. Comput. Commun. 29, 3527\u20133535 (2006)","journal-title":"Comput. Commun."},{"key":"28_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-27848-8_621-1","volume-title":"Encyclopedia of Algorithms","author":"H Du","year":"2014","unstructured":"Du, H., Luo, H.: Routing-cost constrained connected dominating set. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms, pp. 1\u20135. Springer, New York (2014)"},{"issue":"4","key":"28_CR4","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1109\/TPDS.2012.177","volume":"24","author":"H Du","year":"2013","unstructured":"Du, H., Wu, W., Ye, Q., Li, D., Lee, W., Xu, X.: CDS-based virtual backbone construction with guaranteed routing cost in wireless sensor networks. IEEE Trans. Parallel Distrib. Syst. 24(4), 652\u2013661 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"28_CR5","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.tcs.2011.10.010","volume":"447","author":"H Du","year":"2011","unstructured":"Du, H., Ye, Q., Zhong, J., Wang, Y., Lee, W., Park, H.: Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks. Theor. Comput. Sci. 447, 38\u201343 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Du, H., Ye, Q., Wu, W., Lee, W., Li, D., Du, D., et al.: Constant approximation for virtual backbone construction with guaranteed routing cost in wireless sensor networks. In: Proceedings - IEEE INFOCOM, vol. 28, pp. 1737\u20131744 (2011)","DOI":"10.1109\/INFCOM.2011.5934967"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/11599463_25","volume-title":"Mobile Ad-hoc and Sensor Networks","author":"X Chen","year":"2005","unstructured":"Chen, X., Xu, M.: A geographical cellular-like architecture for wireless sensor networks. In: Jia, X., Wu, J., He, Y. (eds.) MSN 2005. LNCS, vol. 3794, pp. 249\u2013258. Springer, Heidelberg (2005)"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Huang, S.C., Wan, P.J., Vu, C.T., Li, S., Yao, F.: Nearly constant approximation for data aggregation scheduling in wireless sensor networks. In: Proceedings - IEEE INFOCOM, pp. 366\u2013372 (2007)","DOI":"10.1109\/INFCOM.2007.50"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Wan, P.J., Huang, C.H., Wang, L., Wan, Z., Jia, X.: Minimum-latency aggregation scheduling in multihop wireless networks. In: Proceedings - MOBIHOC, pp. 185\u2013194 (2009)","DOI":"10.1145\/1530748.1530773"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Nguyen, T.D., Zalyubovskiy, V., Choo, H.: Efficient Time Latency of Data Aggregation Based on Neighboring Dominators in WSNs. In: GLOBECOM, pp. 1\u20136 (2011)","DOI":"10.1109\/GLOCOM.2011.6133827"},{"issue":"4","key":"28_CR11","doi-asserted-by":"crossref","first-page":"1653","DOI":"10.1007\/s10898-012-9939-7","volume":"56","author":"H Du","year":"2013","unstructured":"Du, H., Zhang, Z., Wu, W., Wu, L., Xing, K.: Constant-approximation for optimal data aggregation with physical interference. J. Global Optim. 56(4), 1653\u20131666 (2013)","journal-title":"J. Global Optim."},{"key":"28_CR12","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/j.tcs.2015.07.056","volume":"607","author":"Z He","year":"2015","unstructured":"He, Z., Cai, Z., Cheng, S., Wang, X.: Approximate aggregation for tracking quantiles and range countings in wireless sensor networks. Theor. Comput. Sci. 607, 381\u2013390 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"28_CR13","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1007\/s11390-011-1193-9","volume":"26","author":"B Yu","year":"2011","unstructured":"Yu, B., Li, J.Z.: Minimum-time aggregation scheduling in dutycycled wireless sensor networks. J. Comput. Sci. Technol. 26(6), 962\u2013970 (2011)","journal-title":"J. Comput. Sci. Technol."},{"issue":"7","key":"28_CR14","doi-asserted-by":"crossref","first-page":"1729","DOI":"10.1007\/s11276-014-0706-1","volume":"20","author":"S Xiao","year":"2014","unstructured":"Xiao, S., Huang, J., Pan, L., Cheng, Y., Liu, J.: On centralized and distributed algorithms for minimizing data aggregation time in duty-cycled wireless sensor networks. Wireless Netw. 20(7), 1729\u20131741 (2014)","journal-title":"Wireless Netw."},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Chen, Q., Gao, H., Cheng, S., Cai, Z.: Approximate scheduling and constructing algorithms for minimum-energy multicasting in duty-cycled sensor networks. In: IIKI, pp. 163\u2013168 (2015)","DOI":"10.1109\/IIKI.2015.42"},{"issue":"12","key":"28_CR16","doi-asserted-by":"crossref","first-page":"1741","DOI":"10.1109\/TMC.2010.266","volume":"10","author":"Y Gu","year":"2011","unstructured":"Gu, Y., He, T.: Dynamic switching-based data forwarding for low-duty-cycle wireless sensor networks. IEEE Trans. Mob. Comput. 10(12), 1741\u20131754 (2011)","journal-title":"IEEE Trans. Mob. Comput."}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42836-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T11:45:08Z","timestamp":1749037508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42836-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319428352","9783319428369"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42836-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}