{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:47:25Z","timestamp":1784180845804,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T00:00:00Z","timestamp":1783296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Ministry of Education, Singapore","award":["24-1323-A0001"],"award-info":[{"award-number":["24-1323-A0001"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,6]]},"DOI":"10.1145\/3816782.3819229","type":"proceedings-article","created":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T17:28:33Z","timestamp":1783531713000},"page":"288-300","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0109-2432","authenticated-orcid":false,"given":"Yi-Jun","family":"Chang","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-0426-5926","authenticated-orcid":false,"given":"Yang Ze","family":"Guan","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"A survey on wireless multimedia sensor networks. Computer networks 51, 4","author":"Akyildiz Ian F","year":"2007","unstructured":"Ian F Akyildiz, Tommaso Melodia, and Kaushik R Chowdhury. 2007. A survey on wireless multimedia sensor networks. Computer networks 51, 4 (2007), 921\u2013960."},{"key":"e_1_3_2_1_2_1","volume-title":"William K Moses Jr, and Gopal Pandurangan","author":"Augustine John","year":"2024","unstructured":"John Augustine, William K Moses Jr, and Gopal Pandurangan. 2024. Awake complexity of distributed minimum spanning tree. In International Colloquium on Structural Information and Communication Complexity (SIROCCO). Springer, 45\u201363."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/171540.171571"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2021.10"},{"key":"e_1_3_2_1_5_1","volume-title":"Location-aware routing for data aggregation in sensor networks. Geosensor Networks","author":"Beaver Jonathan","year":"2004","unstructured":"Jonathan Beaver, M Sharaf, Alexandros Labrinidis, and P Chrysanthis. 2004. Location-aware routing for data aggregation in sensor networks. Geosensor Networks (2004), 189\u2013209."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897655"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3798129.3800832"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2003.1213299"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341111"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212774"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405713"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Yi-Jun Chang and Yang Ze Guan. 2026. Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks. arXiv:2605.30546 [cs.DC] https:\/\/arxiv.org\/abs\/2605.30546","DOI":"10.1145\/3816782.3819229"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3662158.3662791"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405718"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","first-page":"1209","DOI":"10.1109\/TC.1987.1676861","article-title":"Tree-based broadcasting in multihop radio networks","volume":"100","author":"Kutten Chlamtac","year":"1987","unstructured":"Chlamtac and Kutten. 1987. Tree-based broadcasting in multihop radio networks. IEEE Trans. Comput. 100, 10 (1987), 1209\u20131223.","journal-title":"IEEE Trans. Comput."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1985.1096245"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3446383"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-022-00426-w"},{"key":"e_1_3_2_1_19_1","volume-title":"36th International Symposium on Distributed Computing (DISC","volume":"246","author":"Dani Varsha","year":"2022","unstructured":"Varsha Dani and Thomas P Hayes. 2022. How to Wake up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks. In 36th International Symposium on Distributed Computing (DISC 2022), Vol. 246. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 16:1\u201316:22."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331604"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594574"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1042"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794261118"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2539940"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538566"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594587"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3662158.3662812"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520026"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933121"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451081"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2002.1022289"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571833"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2006.10.001"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060289.1060303"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-40996-3_31"},{"key":"e_1_3_2_1_36_1","volume-title":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC), Stefano Leonardi and Anupam Gupta (Eds.). ACM, 478\u2013487","author":"Rozhon V\u00e1clav","year":"2022","unstructured":"V\u00e1clav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, and Jason Li. 2022. Undirected (1+\u0454)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC), Stefano Leonardi and Anupam Gupta (Eds.). ACM, 478\u2013487."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142492"},{"key":"e_1_3_2_1_38_1","first-page":"448","article-title":"An energy-efficient data gathering mechanism using traveling wave and spatial interpolation for wireless sensor networks","volume":"7","author":"Taniguchi Yoshiaki","year":"2012","unstructured":"Yoshiaki Taniguchi, Akimitsu Kanzaki, Naoki Wakamiya, and Takahiro Hara. 2012. An energy-efficient data gathering mechanism using traveling wave and spatial interpolation for wireless sensor networks. Information and Media Technologies 7, 1 (2012), 448\u2013457.","journal-title":"Information and Media Technologies"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-006-7798-5"}],"event":{"name":"SPAA '26: 38th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Royal Holloway, University of London London United Kingdom","acronym":"SPAA '26","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","EATCS"]},"container-title":["Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3816782.3819229","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T18:56:40Z","timestamp":1784141800000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3816782.3819229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,6]]},"references-count":39,"alternative-id":["10.1145\/3816782.3819229","10.1145\/3816782"],"URL":"https:\/\/doi.org\/10.1145\/3816782.3819229","relation":{},"subject":[],"published":{"date-parts":[[2026,7,6]]},"assertion":[{"value":"2026-07-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}