{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:29Z","timestamp":1750308149220,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,9,2]],"date-time":"2005-09-02T00:00:00Z","timestamp":1125619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,9,2]]},"DOI":"10.1145\/1080810.1080824","type":"proceedings-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T17:34:39Z","timestamp":1131384879000},"page":"80-88","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["Energy efficient routing with adaptive data fusion in sensor networks"],"prefix":"10.1145","author":[{"given":"Hong","family":"Luo","sequence":"first","affiliation":[{"name":"Beijing Univ. of Posts and Telecommunications, Beijing, China"}]},{"given":"Jun","family":"Luo","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington, Arlington, TX"}]},{"given":"Yonghe","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington, Arlington, TX"}]}],"member":"320","published-online":{"date-parts":[[2005,9,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796454"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354677"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of ACM-SIAM Symposium on Discrete Algorithms","author":"Goel A.","year":"2003","unstructured":"A. Goel and D. Estrin . Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk . In Proceedings of ACM-SIAM Symposium on Discrete Algorithms , Baltimore, MD , Jan. 2003 . A. Goel and D. Estrin. Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, Jan. 2003."},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the {11th ACM-SIAM symposium on Discrete Algorithms","author":"Goel A.","year":"2000","unstructured":"A. Goel and K. Munagala . Balancing steiner trees and shortest path trees online . In Proceedings of the {11th ACM-SIAM symposium on Discrete Algorithms , San Francisco, CA , Jan. 2000 . A. Goel and K. Munagala. Balancing steiner trees and shortest path trees online. In Proceedings of the {11th ACM-SIAM symposium on Discrete Algorithms, San Francisco, CA, Jan. 2000."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/820264.820485"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/850928.851836"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808417"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/646854.708078"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2006.171"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796577"},{"key":"e_1_3_2_1_12_1","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou C.","year":"1998","unstructured":"C. Papadimitriou and K. Steiglitz . Combinatorial Optimization: Algorithms and Complexity . Dover Publications Inc , 1998 . C. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Dover Publications Inc, 1998."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984627"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.808103"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1022630.1022640"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the 4th ACM-SIAM symposium on Discrete Algorithms","author":"Khuller B. R. S.","year":"1993","unstructured":"B. R. S. Khuller and N. Young . Balancing minimum spanning and shortest path trees . In Proceedings of the 4th ACM-SIAM symposium on Discrete Algorithms , Austin, TX , Jan. 1993 . B. R. S. Khuller and N. Young. Balancing minimum spanning and shortest path trees. In Proceedings of the 4th ACM-SIAM symposium on Discrete Algorithms, Austin, TX, Jan. 1993."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/570645.570663"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012235530463"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of IEEE Infocom","author":"Yu Y.","year":"2004","unstructured":"Y. Yu , B. Krishnamachari , and V. Prasanna . Energy-latency tradeoff for data gathering in wireless sensor networks . In Proceedings of IEEE Infocom , Hongkong, China , Mar. 2004 . Y. Yu, B. Krishnamachari, and V. Prasanna. Energy-latency tradeoff for data gathering in wireless sensor networks. In Proceedings of IEEE Infocom, Hongkong, China, Mar. 2004."}],"event":{"name":"Dial M - POMC 05: Joint Workshop on Foundations of Mobile Computing 2005","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing","ACM Association for Computing Machinery"],"location":"Cologne Germany","acronym":"Dial M - POMC 05"},"container-title":["Proceedings of the 2005 joint workshop on Foundations of mobile computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1080810.1080824","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1080810.1080824","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:18:42Z","timestamp":1750263522000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1080810.1080824"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9,2]]},"references-count":18,"alternative-id":["10.1145\/1080810.1080824","10.1145\/1080810"],"URL":"https:\/\/doi.org\/10.1145\/1080810.1080824","relation":{},"subject":[],"published":{"date-parts":[[2005,9,2]]},"assertion":[{"value":"2005-09-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}