{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T12:48:47Z","timestamp":1784119727728,"version":"3.55.0"},"reference-count":14,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2004,9,1]],"date-time":"2004-09-01T00:00:00Z","timestamp":1093996800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Network"],"published-print":{"date-parts":[[2004,9]]},"DOI":"10.1109\/mnet.2004.1337732","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T18:46:30Z","timestamp":1096915590000},"page":"24-29","source":"Crossref","is-referenced-by-count":160,"title":["Building a reference combinatorial model for MANETs"],"prefix":"10.1109","volume":"18","author":[{"given":"A.","family":"Ferreira","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/26.20105"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832232"},{"key":"ref12","first-page":"121","article-title":"on the complexity of computing minimum energy consumption broadcast subgraphs","author":"clementi","year":"2001","journal-title":"18th Annual Symp Theoretical Aspects of Computer Science LNCS 2010"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1023\/A:1020381720601","article-title":"minimum energy broadcast routing in static ad hoc wireless networks","volume":"8","author":"wan","year":"2002","journal-title":"Wireless Networks"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-8705(03)00013-1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/381677.381683"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.3.419"},{"key":"ref6","article-title":"complexity of minimum spanning tree in evolving graphs and the minimum-energy broadcast routing problem","author":"ferreira","year":"2004","journal-title":"Proc WiOpt 04 &#x2014 Modeling and Optimization in Mobile Ad Hoc and Wireless Networks"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054103001728"},{"key":"ref8","author":"cormen","year":"1990","journal-title":"Introduction to Algorithms"},{"key":"ref7","author":"kotnyek","year":"2003","journal-title":"An Annotated Overview of Dynamic Network Flows"},{"key":"ref2","author":"national science foundation","year":"2003","journal-title":"Report of the National Science Foundation Workshop on Fundamental Research in Networking"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/0471224561"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39611-6_23"}],"container-title":["IEEE Network"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/65\/29508\/01337732.pdf?arnumber=1337732","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:18:39Z","timestamp":1642004319000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1337732\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2004,9]]}},"URL":"https:\/\/doi.org\/10.1109\/mnet.2004.1337732","relation":{},"ISSN":["0890-8044"],"issn-type":[{"value":"0890-8044","type":"print"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}