{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:00:26Z","timestamp":1771700426941,"version":"3.50.1"},"reference-count":19,"publisher":"SAGE Publications","issue":"9","license":[{"start":{"date-parts":[[2012,9,10]],"date-time":"2012-09-10T00:00:00Z","timestamp":1347235200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Distributed Sensor Networks"],"published-print":{"date-parts":[[2012,9,10]]},"abstract":"<jats:p> In wireless sensor networks, since sensor nodes are distributed in inaccessible regions for data gathering, they need to be operated during an assigned time without battery recharging and relocation. For this reason, there has been abundant research on improving energy efficiency. PEGASIS, one of the well-known chain-based routing protocols for improving energy efficiency, builds a chain based on the greedy algorithm. However, due to long communication distance of some sensor nodes in a chain formed by the greedy algorithm, unbalanced energy consumption of sensor nodes occurs. Eventually, the network lifetime from this cause decreases. We propose energy efficient chain formation (EECF) algorithm to resolve the unbalanced energy consumption problem caused by long-distance data transmission of some nodes in a chain formed by the greedy algorithm. The simulation results are used to verify the energy consumption balance of sensor nodes and the whole network lifetime. In simulation, it is shown that EECF produces better results than the greedy algorithm. <\/jats:p>","DOI":"10.1155\/2012\/843413","type":"journal-article","created":{"date-parts":[[2012,9,10]],"date-time":"2012-09-10T21:02:26Z","timestamp":1347310946000},"page":"843413","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":14,"title":["Energy-Efficient Chain Formation Algorithm for Data Gathering in Wireless Sensor Networks"],"prefix":"10.1177","volume":"8","author":[{"given":"Se-Jung","family":"Lim","sequence":"first","affiliation":[{"name":"Department of Computer and Radio Communication Engineering, Korea University, Seoul 136-701, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Myong-Soon","family":"Park","sequence":"additional","affiliation":[{"name":"Department of Computer and Radio Communication Engineering, Korea University, Seoul 136-701, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2012,9,10]]},"reference":[{"key":"B1-2012-843413","doi-asserted-by":"publisher","DOI":"10.1002\/0470095121"},{"key":"B2-2012-843413","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1024422"},{"key":"B3-2012-843413","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2006.283821"},{"key":"B4-2012-843413","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.2000.926982"},{"key":"B5-2012-843413","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808417"},{"key":"B6-2012-843413","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2002.1036066"},{"key":"B7-2012-843413","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2002.804190"},{"key":"B8-2012-843413","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2004.41"},{"key":"B9-2012-843413","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066191"},{"key":"B10-2012-843413","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-005-4443-7"},{"key":"B11-2012-843413","first-page":"24","volume-title":"Proceedings of the 12th International Conference on Networking, VLSI and Signal Processing (ICNVS '10)","volume":"3","author":"Lee Y."},{"key":"B12-2012-843413","first-page":"1125","volume-title":"Proceedings of the IEEE Aerospace Conference","volume":"3","author":"Lindsey S."},{"key":"B13-2012-843413","first-page":"150","volume-title":"Map Generalization: Making Rules For Knowledge Representation","author":"Buttenfield B. P.","year":"1991"},{"key":"B14-2012-843413","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45799-2_4"},{"key":"B15-2012-843413","doi-asserted-by":"publisher","DOI":"10.1109\/ITNG.2006.44"},{"key":"B16-2012-843413","doi-asserted-by":"publisher","DOI":"10.1109\/ICACT.2007.358351"},{"key":"B17-2012-843413","doi-asserted-by":"publisher","DOI":"10.1109\/ISPA.2008.111"},{"issue":"5","key":"B18-2012-843413","volume":"4","author":"Shukla I.","year":"2009","journal-title":"Ubiquitous Computing and Communication Journal"},{"key":"B19-2012-843413","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20975-8_13"}],"container-title":["International Journal of Distributed Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1155\/2012\/843413","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/full-xml\/10.1155\/2012\/843413","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1155\/2012\/843413","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,16]],"date-time":"2021-05-16T17:32:20Z","timestamp":1621186340000},"score":1,"resource":{"primary":{"URL":"http:\/\/journals.sagepub.com\/doi\/10.1155\/2012\/843413"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,10]]},"references-count":19,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2012,9,10]]}},"alternative-id":["10.1155\/2012\/843413"],"URL":"https:\/\/doi.org\/10.1155\/2012\/843413","relation":{},"ISSN":["1550-1477","1550-1477"],"issn-type":[{"value":"1550-1477","type":"print"},{"value":"1550-1477","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,10]]}}}