{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:42:36Z","timestamp":1740141756852,"version":"3.37.3"},"reference-count":16,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-0721980","PO 4000056349"],"award-info":[{"award-number":["CNS-0721980","PO 4000056349"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["CNS-0721980","PO 4000056349"],"award-info":[{"award-number":["CNS-0721980","PO 4000056349"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Distributed Sensor Networks"],"published-print":{"date-parts":[[2010,1,1]]},"abstract":"<jats:p> Data transmission from sensor nodes to a base station or a sink node often incurs significant energy consumption, which critically affects network lifetime. We generalize and solve the problem of deploying multiple base stations to maximize network lifetime in terms of two different metrics under one-hop and multihop communication models. In the one-hop communication model, the sensors far away from base stations always deplete their energy much faster than others. We propose an optimal solution and a heuristic approach based on the minimal enclosing circle algorithm to deploy a base station at the geometric center of each cluster. In the multihop communication model, both base station location and data routing mechanism need to be considered in maximizing network lifetime. We propose an iterative algorithm based on rigorous mathematical derivations and use linear programming to compute the optimal routing paths for data transmission. Simulation results show the distinguished performance of the proposed deployment algorithms in maximizing network lifetime. <\/jats:p>","DOI":"10.1155\/2010\/563156","type":"journal-article","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T14:36:31Z","timestamp":1278340591000},"page":"563156","source":"Crossref","is-referenced-by-count":5,"title":["On Deployment of Multiple Base Stations for Energy-Efficient Communication in Wireless Sensor Networks"],"prefix":"10.1177","volume":"6","author":[{"given":"Yunyue","family":"Lin","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Memphis, Memphis, TN 38152, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qishi","family":"Wu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Memphis, Memphis, TN 38152, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoshan","family":"Cai","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Memphis, Memphis, TN 38152, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojiang","family":"Du","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Sciences, Temple University, Philadelphia, PA 19122, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ki-Hyeon","family":"Kwon","sequence":"additional","affiliation":[{"name":"Department of Information and Communication Engineering, Kangwon National University, Samcheok, Gangwon 245-711, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2010,7,1]]},"reference":[{"key":"B11-2010-563156","doi-asserted-by":"publisher","DOI":"10.1137\/0212052"},{"key":"B13-2010-563156","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2005.68"},{"key":"B14-2010-563156","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2007.4292863"},{"key":"B15-2010-563156","doi-asserted-by":"publisher","DOI":"10.1109\/PERSER.2007.4283889"},{"key":"B2-2010-563156","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2006.05.004"},{"key":"B8-2010-563156","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2005.09.002"},{"key":"B12-2010-563156","first-page":"3663","volume-title":"Proceedings of the IEEE International Conference on Communications","volume":"6","author":"Oyman E. I."},{"first-page":"575","volume-title":"Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM \u203204)","author":"Bogdanov A.","key":"B1-2010-563156"},{"first-page":"377","volume-title":"Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM \u203203)","author":"Gandham S. R.","key":"B5-2010-563156"},{"key":"B7-2010-563156","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.2000.926982"},{"first-page":"685","volume-title":"Proceedings of the IEEE International Conference on Networking (ICN \u203202)","author":"Kalpakis K.","key":"B10-2010-563156"},{"first-page":"70","volume-title":"Proceedings of the 7th Annual International Conference on Mobile Computing and Networking (MOBICOM \u203201)","author":"Xu Y.","key":"B16-2010-563156"},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","year":"1979","author":"Garey M.","key":"B6-2010-563156"},{"key":"B4-2010-563156","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90111-3"},{"key":"B9-2010-563156","doi-asserted-by":"publisher","DOI":"10.1007\/BF01185335"},{"issue":"8","key":"B3-2010-563156","first-page":"741","volume":"35","author":"Drezner Z.","year":"1984","journal-title":"Journal of the Operational Research Society"}],"container-title":["International Journal of Distributed Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1155\/2010\/563156","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/full-xml\/10.1155\/2010\/563156","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1155\/2010\/563156","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,6]],"date-time":"2020-11-06T07:55:13Z","timestamp":1604649313000},"score":1,"resource":{"primary":{"URL":"http:\/\/journals.sagepub.com\/doi\/10.1155\/2010\/563156"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1,1]]}},"alternative-id":["10.1155\/2010\/563156"],"URL":"https:\/\/doi.org\/10.1155\/2010\/563156","relation":{},"ISSN":["1550-1477","1550-1477"],"issn-type":[{"type":"print","value":"1550-1477"},{"type":"electronic","value":"1550-1477"}],"subject":[],"published":{"date-parts":[[2010,1,1]]}}}