{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T23:47:54Z","timestamp":1770335274349,"version":"3.49.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/icc.2004.1313228","type":"proceedings-article","created":{"date-parts":[[2004,11,13]],"date-time":"2004-11-13T00:14:14Z","timestamp":1100304854000},"page":"3673-3678 Vol.6","source":"Crossref","is-referenced-by-count":43,"title":["Grid-based approach for working node selection in wireless sensor networks"],"prefix":"10.1109","author":[{"given":"H.","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.-F.","family":"Tzeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832171"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1109\/ICC.2001.936985","article-title":"Power efficient organization of wireless networks","volume":"2","author":"slijepcevic","year":"2001","journal-title":"Proc of IEEE International Conference on Communications"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/778435.778438"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/313451.313525"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/MOBHOC.2000.869221"},{"key":"ref15","article-title":"Computing optimal local cover set for broadcast in ad hoc network","author":"sun","year":"2002","journal-title":"Proc of IEEE Int'l Conf on Communications"},{"key":"ref16","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref17","article-title":"CMU","year":"0","journal-title":"linear programming model to solve set-covering problem"},{"key":"ref18","article-title":"netlib.org","year":"0","journal-title":"linear programming solving tool lpsolve"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/98.878533"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2000.905001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CNNA.2002.1035062"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2001.965964"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019408"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/778415.778439"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/778415.778436"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1024422"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2002.993370"}],"event":{"name":"2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)","location":"Paris, France","start":{"date-parts":[[2004,6,24]]},"end":{"date-parts":[[2004,6,24]]}},"container-title":["2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9179\/29123\/01313228.pdf?arnumber=1313228","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T09:38:02Z","timestamp":1545385082000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1313228\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/icc.2004.1313228","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}