{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:43:43Z","timestamp":1740123823348,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2016,8,29]],"date-time":"2016-08-29T00:00:00Z","timestamp":1472428800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61174179"],"award-info":[{"award-number":["61174179"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s11276-016-1337-5","type":"journal-article","created":{"date-parts":[[2016,8,29]],"date-time":"2016-08-29T04:12:12Z","timestamp":1472443932000},"page":"2469-2483","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A time efficient aggregation convergecast scheduling algorithm for wireless sensor networks"],"prefix":"10.1007","volume":"22","author":[{"given":"Cheng","family":"Pan","sequence":"first","affiliation":[]},{"given":"Hesheng","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,29]]},"reference":[{"issue":"2","key":"1337_CR1","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s11276-010-0282-y","volume":"17","author":"B Malhotra","year":"2011","unstructured":"Malhotra, B., Nikolaidis, I., & Nascimento, M. A. (2011). Aggregation convergecast scheduling in wireless sensor networks. Wireless Networks, 17(2), 319\u2013335.","journal-title":"Wireless Networks"},{"issue":"3","key":"1337_CR2","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1109\/TPDS.2010.93","volume":"22","author":"L Hong","year":"2011","unstructured":"Hong, L., Huixiang, T., Huadong, M., & Das, S. K. (2011). Data fusion with desired reliability in wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems, 22(3), 501\u2013513.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"1337_CR3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.jnca.2011.03.001","volume":"35","author":"T Srisooksai","year":"2012","unstructured":"Srisooksai, T., Keamarungsi, K., Lamsrichan, P., & Araki, K. (2012). Practical data compression in wireless sensor networks: A survey. Journal of Network and Computer Applications, 35(1), 37\u201359.","journal-title":"Journal of Network and Computer Applications"},{"key":"1337_CR4","doi-asserted-by":"crossref","unstructured":"Madden, S., Franklin, M. J., Hellerstein, J. M., Wei, H., & Usenix, U. (2002). TAG: A tiny aggregation service for ad-hoc sensor networks. In Usenix Association Proceedings of the Fifth Symposium on Operating Systems Design and Implementation (pp. 131\u2013146).","DOI":"10.1145\/1060289.1060303"},{"key":"1337_CR5","first-page":"2159","volume":"1\u20135","author":"B Yu","year":"2009","unstructured":"Yu, B., Li, J., Li, Y., & Ieee, (2009). Distributed data aggregation scheduling in wireless sensor networks. Proceedings of IEEE Conference on Computer Communications, 1\u20135, 2159\u20132167.","journal-title":"Proceedings of IEEE Conference on Computer Communications"},{"key":"1337_CR6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/11599463_14","volume":"3794","author":"XJ Chen","year":"2005","unstructured":"Chen, X. J., Hu, X. D., & Zhu, J. M. (2005). Minimum data aggregation time problem in wireless sensor networks. Proceedings of Mobile Ad-Hoc and Sensor Networks, 3794, 133\u2013142.","journal-title":"Proceedings of Mobile Ad-Hoc and Sensor Networks"},{"issue":"8","key":"1337_CR7","doi-asserted-by":"crossref","first-page":"2391","DOI":"10.1016\/j.adhoc.2013.06.004","volume":"11","author":"E Souza de","year":"2013","unstructured":"de Souza, E., & Nikolaidis, I. (2013). An exploration of aggregation convergecast scheduling. Ad Hoc Networks, 11(8), 2391\u20132407.","journal-title":"Ad Hoc Networks"},{"issue":"1","key":"1337_CR8","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/TMC.2011.22","volume":"11","author":"OD Incel","year":"2012","unstructured":"Incel, O. D., Ghosh, A., Krishnamachari, B., & Chintalapudi, K. (2012). Fast data collection in tree-based wireless sensor networks. IEEE Transactions on Mobile Computing, 11(1), 86\u201399.","journal-title":"IEEE Transactions on Mobile Computing"},{"issue":"1","key":"1337_CR9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.jalgor.2005.01.003","volume":"59","author":"NJA Harvey","year":"2006","unstructured":"Harvey, N. J. A., Ladner, R. E., Lov\u00e1sz, L., & Tamir, T. (2006). Semi-matchings for bipartite graphs and load balancing. Journal of Algorithms, 59(1), 53\u201378.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"1337_CR10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/B:MONE.0000013625.87793.13","volume":"9","author":"PJ Wan","year":"2004","unstructured":"Wan, P. J., Alzoubi, K. M., & Frieder, O. (2004). Distributed construction of connected dominating set in wireless ad hoc networks. Mobile Networks and Applications, 9(2), 141\u2013149.","journal-title":"Mobile Networks and Applications"},{"key":"1337_CR11","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Huang, S. C. H., Wang, L., Wan, Z., & Jia, X. (2009). Minimum-latency aggregation scheduling in multihop wireless networks. In Proceedings of the Tenth Acm International Symposium on Mobile Ad Hoc Networking and Computing (pp. 185\u2013193).","DOI":"10.1145\/1530748.1530773"},{"key":"1337_CR12","doi-asserted-by":"crossref","unstructured":"Li, Y., Guo, L., & Prasad, S. K. (2010). An energy-efficient distributed algorithm for minimum-latency aggregation scheduling in wireless sensor networks. In Proceedings of 2010 international conference on distributed computing systems ICDCS 2010 (pp. 827\u2013836).","DOI":"10.1109\/ICDCS.2010.11"},{"issue":"1","key":"1337_CR13","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1109\/TPDS.2010.80","volume":"22","author":"X Xu","year":"2011","unstructured":"Xu, X., Li, X.-Y., Mao, X., Tang, S., & Wang, S. (2011). A delay-efficient algorithm for data aggregation in multihop wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems, 22(1), 163\u2013175.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"4","key":"1337_CR14","doi-asserted-by":"crossref","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71","author":"J Edmonds","year":"1967","unstructured":"Edmonds, J. (1967). Optimum branchings. Journal of Research of the National Bureau of Standards B, 71(4), 233\u2013240.","journal-title":"Journal of Research of the National Bureau of Standards B"},{"issue":"2","key":"1337_CR15","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1109\/18.825799","volume":"46","author":"P Gupta","year":"2000","unstructured":"Gupta, P., & Kumar, P. R. (2000). The capacity of wireless networks. Information Theory, IEEE Transactions on, 46(2), 388\u2013404.","journal-title":"Information Theory, IEEE Transactions on"},{"issue":"6","key":"1337_CR16","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R. C. (1957). Shortest connection networks and some generalizations. Bell System Technical Journal, 36(6), 1389\u20131401.","journal-title":"Bell System Technical Journal"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-016-1337-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-016-1337-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-016-1337-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:32:39Z","timestamp":1498325559000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-016-1337-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,29]]},"references-count":16,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["1337"],"URL":"https:\/\/doi.org\/10.1007\/s11276-016-1337-5","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"type":"print","value":"1022-0038"},{"type":"electronic","value":"1572-8196"}],"subject":[],"published":{"date-parts":[[2016,8,29]]}}}