{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,18]],"date-time":"2026-09-18T05:29:56Z","timestamp":1789709396459,"version":"4.0.1"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/infcom.2011.5934947","type":"proceedings-article","created":{"date-parts":[[2011,7,7]],"date-time":"2011-07-07T14:59:10Z","timestamp":1310050750000},"page":"1566-1574","source":"Crossref","is-referenced-by-count":70,"title":["Maximizing lifetime for the shortest path aggregation tree in wireless sensor networks"],"prefix":"10.1109","author":[{"given":"Dijun","family":"Luo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaojun","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaobing","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guihai","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2006.116"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.9"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1236360.1236365"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-005-4443-7"},{"key":"ref14","article-title":"Realistic and efficient multichannel communications in wireless sensor networks","author":"wu","year":"2008","journal-title":"INFOCOM"},{"key":"ref15","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in networks with power estimation","volume":"11","author":"dinic","year":"1970","journal-title":"Soviet Mathematics Doklady"},{"key":"ref16","author":"cormen","year":"2004","journal-title":"Introduction to Algorithms"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/345910.345920"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1644038.1644040"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843543"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.80"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1644038.1644041"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45078-8_26"},{"key":"ref7","article-title":"Faster algorithms for semi-matching problems","author":"fakcharoenphol","year":"2010","journal-title":"ICALP"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/570738.570751"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1031495.1031498"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1142\/9789812776730_0055"}],"event":{"name":"IEEE INFOCOM 2011 - IEEE Conference on Computer Communications","location":"Shanghai, China","start":{"date-parts":[[2011,4,10]]},"end":{"date-parts":[[2011,4,15]]}},"container-title":["2011 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5888673\/5934870\/05934947.pdf?arnumber=5934947","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T07:15:46Z","timestamp":1490080546000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5934947\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/infcom.2011.5934947","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}