{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T11:45:53Z","timestamp":1787312753974,"version":"build-2736575974"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1109\/lcn.2009.5355161","type":"proceedings-article","created":{"date-parts":[[2009,12,24]],"date-time":"2009-12-24T13:26:49Z","timestamp":1261661209000},"page":"436-442","source":"Crossref","is-referenced-by-count":23,"title":["Maximizing the lifetime of wireless sensor networks through domatic partition"],"prefix":"10.1109","author":[{"given":"Kamrul","family":"Islam","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Selim G.","family":"Akl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1132905.1132922"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700380754"},{"key":"ref12","article-title":"On the performance of greedy algorithms for finding maximum r-configurations","author":"fujita","year":"1999","journal-title":"Proc WAC"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2001.936985"},{"key":"ref14","article-title":"Maximal cliques in unit disk graphs: polynomial approximation","author":"gupta","year":"2005","journal-title":"Proc INOC'2005"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0929"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90358-O"},{"key":"ref3","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011811"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872040"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/71.980024"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1145\/513800.513820","article-title":"Message-optimal connected-dominating-set construction for routing in mobile ad hoc networks","author":"alzoubi","year":"2002","journal-title":"Proc MobiHoc"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400758"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2005.276"}],"event":{"name":"2009 IEEE 34th Conference on Local Computer Networks (LCN 2009)","location":"Zurich, Switzerland","start":{"date-parts":[[2009,10,20]]},"end":{"date-parts":[[2009,10,23]]}},"container-title":["2009 IEEE 34th Conference on Local Computer Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5347306\/5354999\/05355161.pdf?arnumber=5355161","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T15:43:14Z","timestamp":1558712594000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5355161\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/lcn.2009.5355161","relation":{},"subject":[],"published":{"date-parts":[[2009,10]]}}}