{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T07:34:10Z","timestamp":1729668850208,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/mahss.2005.1542770","type":"proceedings-article","created":{"date-parts":[[2005,12,13]],"date-time":"2005-12-13T20:55:52Z","timestamp":1134507352000},"page":"24-31","source":"Crossref","is-referenced-by-count":3,"title":["Reducing the energy drain in multihop ad hoc networks"],"prefix":"10.1109","author":[{"given":"G.","family":"Allard","sequence":"first","affiliation":[]},{"given":"B.","family":"Mans","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916634"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/381677.381685"},{"key":"11","first-page":"156","article-title":"Power control in ad hoc networks: Theory, architecture, algorithm and implementation of the COMPOW protocol","author":"narayanaswamy","year":"2002","journal-title":"Proc of the European Wireless Conference - Next Generation Wireless Networks Technologies Protocols Services and Applications"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2002.1188035"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/381677.381686"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-004-4754-9"},{"key":"1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1142\/S012905410300173X","article-title":"Maximal independent set, weakly-connected dominating set, and induced spanners in wireless ad hoc networks","volume":"14","author":"alzoubi","year":"2003","journal-title":"International Journal of Foundations of Computer Science"},{"journal-title":"On the Complexity of Reducing the Energy Drain in Mobile Ad Hoc Networks","year":"2004","author":"mans","key":"10"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916651"},{"journal-title":"Graph Theory","year":"2000","author":"diestel","key":"5"},{"key":"4","first-page":"121","article-title":"On the complexity of computing minimum energy consumption broadcast subgraphs","volume":"2010","author":"clementi","year":"2001","journal-title":"LNCS"},{"key":"9","first-page":"317","article-title":"Polynomially bounded minimization problems that are hard to approximate","volume":"1","author":"kann","year":"1994","journal-title":"Nordic Journal of Computing"},{"year":"0","key":"8"}],"event":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","location":"N\/A"},"container-title":["IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10355\/32951\/01542770.pdf?arnumber=1542770","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T01:41:13Z","timestamp":1497663673000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1542770\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/mahss.2005.1542770","relation":{},"subject":[]}}