{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T18:04:07Z","timestamp":1754157847961,"version":"3.41.2"},"reference-count":17,"publisher":"Emerald","issue":"3","license":[{"start":{"date-parts":[[2007,12,31]],"date-time":"2007-12-31T00:00:00Z","timestamp":1199059200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,2,14]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>The purpose of this paper is to propose an energy\u2010proportional routing (EPR) algorithm, which effectively extends the lifetimes of sensor networks.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>The algorithm makes no specific assumption on network topology and hence is suitable for improving sensor networks with clustering. To optimally utilize energy, light\u2010load units \u2013 nodes or clusters that conserve energy are ideal candidates as intermediate units for forwarding data from others. To balance the load, first, the proposed algorithm predicts energy consumption of each node in each round. Then the algorithm controls the energy consumption of each unit as close as possible to the threshold representing the energy utilization mean value among clusters. Finally the algorithm checks satisfaction of the energy constraints in terms of distances and predicted data amounts. The proposed algorithm performs routing by determining whether a cluster head or a node should either undertake forwarding tasks or transmit data to intermediate hops. In this way, energy dissipation is evenly distributed to all units and the lifetime of the whole wireless sensor network is ultimately extended.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>The algorithm applies hierarchically to different levels of network topology. In addition to experiments, the mathematical proofs of lifetime extension by the proposed routing algorithm are given in accordance with three widely accepted criteria \u2013 total energy dissipation, the number of live nodes in each round and the throughput (data amount per round).<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>A new routing algorithm is proposed.<\/jats:p><\/jats:sec>","DOI":"10.1108\/17427370710856255","type":"journal-article","created":{"date-parts":[[2008,2,16]],"date-time":"2008-02-16T07:03:44Z","timestamp":1203145424000},"page":"304-321","source":"Crossref","is-referenced-by-count":1,"title":["Energy\u2010proportional routing for lifetime extension of clustering\u2010based wireless sensor networks"],"prefix":"10.1108","volume":"3","author":[{"given":"Chao\u2010Lieh","family":"Chen","sequence":"first","affiliation":[]},{"given":"Kuan\u2010Rong","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Yau\u2010Hwang","family":"Kuo","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"key":"key2022021819583981200_b1","unstructured":"Agarwal, P.K. and Procopiuc, C.M. (1998), \u201cExact and approximation algorithms for clustering\u201d, Proceedings of the Ninth Annual ACM\u2010SIAM Symposium on Discrete Algorithms, San Francisco, CA, 25\u20107 January, pp. 658\u201067."},{"key":"key2022021819583981200_b2","doi-asserted-by":"crossref","unstructured":"Akyildiz, I.F., Su, W. et al., (2002), \u201cA survey on sensor networks\u201d, IEEE Communications Magazine, August, pp. 102\u201014.","DOI":"10.1109\/MCOM.2002.1024422"},{"key":"key2022021819583981200_b3","unstructured":"Bhardwaj, M. and Chandrakasan, A.P. (2002), \u201cBounding the lifetime of sensor networks via optimal role assignments\u201d, Proceedings of IEEE INFOCOM, 23\u201027 June 2002, New York, NY, pp. 1587\u201096."},{"key":"key2022021819583981200_b4","doi-asserted-by":"crossref","unstructured":"Goel, S. and Imielinski, T. (2001), \u201cPrediction based monitoring in sensor networks \u2013 taking lessons from MPEG\u201d, Computer Communication Review, No. 5, pp. 82\u201095.","DOI":"10.1145\/1037107.1037117"},{"key":"key2022021819583981200_b5","unstructured":"Gupta, G. and Younis, M. (2003), \u201cLoad\u2010balanced clustering of wireless sensor networks\u201d, Proceedings of the International Conference on Communications, Anchorage, AK, May, Vol. 3, pp. 1848\u201052."},{"key":"key2022021819583981200_b6","unstructured":"Heinzelman, W. (2000), \u201cApplication\u2010specific protocol architectures for wireless networks\u201d, PhD thesis. Massachusetts Institute of Technology, Massachusetts, June."},{"key":"key2022021819583981200_b7","doi-asserted-by":"crossref","unstructured":"Heinzelman, W., Chandrakasan, A., and Balakrishnan, H. (2000a), \u201cEnergy\u2010efficient communication protocol for wireless microsensor networks\u201d, Proceedings of Hawaii Conference on System Sciences, January, pp. 1\u201010.","DOI":"10.1109\/HICSS.2000.926982"},{"key":"key2022021819583981200_b8","doi-asserted-by":"crossref","unstructured":"Heinzelman, W., Sinha, A., Wang, A., and Chandrakasan, A. (2000b), \u201cEnergy\u2010scalable algorithms and protocols for wireless microsensor networks\u201d, Proceedings of International Conference on Acoustics, Speech, and Signal Processing (ICASSP), June, pp. 3722\u20105.","DOI":"10.1109\/ICASSP.2000.860211"},{"key":"key2022021819583981200_b9","doi-asserted-by":"crossref","unstructured":"Heinzelman, W., Chandrakasan, A. and Balakrishnan, H. (2002), \u201cAn application\u2010specific protocol architecture for wireless microsensor networks\u201d, IEEE Transactions on Wireless Communications, Vol. 1 No. 4, October, pp. 660\u201070.","DOI":"10.1109\/TWC.2002.804190"},{"key":"key2022021819583981200_b10","unstructured":"Lindsey, S. and Raghavendra, C. (2002), \u201cPEGASIS: power\u2010efficient gathering in sensor information systems\u201d, IEEE Aerospace Conference Proceedings, Vol. 3, pp. 1125\u201030."},{"key":"key2022021819583981200_b11","doi-asserted-by":"crossref","unstructured":"Lindsey, S., Raghavendra, C. and Sivalingam, K.M. (2002), \u201cData gathering algorithms in sensor networks using energy metrics\u201d, IEEE Transactions on Parallel and Distributed Systems, Vol. 13 No. 9, September, pp. 924\u201035.","DOI":"10.1109\/TPDS.2002.1036066"},{"key":"key2022021819583981200_b12","unstructured":"Mini, R.A.F., Nath, B. and Loureiro, A.A.F. (2002), \u201cA probabilistic approach to predict the energy consumption in wireless sensor networks\u201d, Proceedings of the IV Workshop de Comunica\u00e7eo sem Fio e Computa\u00e7eo M\u00f3vel, Seo Paulo, Brazil, 23\u201025 October 2002."},{"key":"key2022021819583981200_b13","doi-asserted-by":"crossref","unstructured":"Muruganathan, S.D., Ma, D.C.F., Bhasin, R.I. and Fapojuwo, A.O. (2005), \u201cA centralized energy\u2010efficient routing protocol for wireless sensor networks\u201d, IEEE Radio Communications, Vol. 43 No. 3, March, pp. S8\u201013.","DOI":"10.1109\/MCOM.2005.1404592"},{"key":"key2022021819583981200_b14","unstructured":"Ross, S. (1998), A First Course in Probability, 5th ed., Prentice\u2010Hall, Englewood Cliffs, NJ."},{"key":"key2022021819583981200_b15","doi-asserted-by":"crossref","unstructured":"Tan, H.O. and Korpeoglu, I. (2003), \u201cPower efficient data gathering and aggregation in wireless sensor networks\u201d, Proceeding of International Conference Management of Data, Vol. 32 No. 4, December, pp. 66\u201071.","DOI":"10.1145\/959060.959072"},{"key":"key2022021819583981200_b16","unstructured":"Younis, O. and Fahmy, S. (2004), \u201cDistributed clustering in ad\u2010hoc sensor networks: a hybrid, energy\u2010efficient approach\u201d, Proceedings of IEEE INFOCOM, March."},{"key":"key2022021819583981200_b17","doi-asserted-by":"crossref","unstructured":"Younis, O. and Fahmy, S. (2004), \u201cDistributed clustering in ad\u2010hoc sensor networks: a hybrid, energy\u2010efficient approach\u201d, IEEE Transactions on Mobile Computing, Vol. 3 No. 4, October\u2013December, pp. 366\u201079.","DOI":"10.1109\/TMC.2004.41"}],"container-title":["International Journal of Pervasive Computing and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/17427370710856255","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17427370710856255\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17427370710856255\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:22:20Z","timestamp":1753402940000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijpcc\/article\/3\/3\/304-321\/163240"}},"subtitle":[],"editor":[{"given":"Tsung\u2010Chuan","family":"Huang","sequence":"first","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2007,12,31]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,2,14]]}},"alternative-id":["10.1108\/17427370710856255"],"URL":"https:\/\/doi.org\/10.1108\/17427370710856255","relation":{},"ISSN":["1742-7371"],"issn-type":[{"type":"print","value":"1742-7371"}],"subject":[],"published":{"date-parts":[[2007,12,31]]}}}