{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T05:23:41Z","timestamp":1777440221173,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,9,1]],"date-time":"2011-09-01T00:00:00Z","timestamp":1314835200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2011,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Wireless sensor networks have been assumed to consist of a single sink and multiple sensor nodes which do not have mobility. In these networks, sensor nodes near the sink dissipate their energy so fast due to their many-to-one traffic pattern, and finally they die early. This uneven energy depletion phenomenon known as the hot spot problem becomes more serious as the number of sensor nodes (i.e., their scale) increases. Recently, multi-sink wireless sensor networks have been envisioned to solve the hot spot problem. Gradient routing protocols are known to be appropriate for the networks in that network traffic is evenly distributed to multiple sinks to prolong network lifetime and they are scalable. Each node maintains its gradient representing the direction toward a neighbor node to reach one of the sinks. In particular, existing protocols allow a sensor node to construct its gradient using the cumulative traffic load of a path for load balancing. However, they have a critical drawback that a sensor node cannot efficiently avoid using the path with the most overloaded node. Hence, this paper introduces a new Gradient routing protocol for LOad-BALancing (GLOBAL) with a new gradient model to maximize network lifetime.<\/jats:p>\n          <jats:p>The proposed gradient model considers both of the cumulative path load and the traffic load of the most overloaded node over the path in calculating each node's gradient value. Therefore, packets are forwarded over the least-loaded path, which avoids the most overloaded node. In addition, it is known that assigning a unique address to each sensor node causes much communication overhead. Since the overhead increases as the network scales, routing protocols using an address to indicate the receiver in forwarding a packet are not scalable. Thus, GLOBAL also includes an addressing-free data forwarding strategy. Through ns-2 simulation, we verify that GLOBAL achieves better performance than the shortest path routing and load-aware gradient routing ones.<\/jats:p>","DOI":"10.1186\/1687-1499-2011-85","type":"journal-article","created":{"date-parts":[[2011,9,1]],"date-time":"2011-09-01T21:17:47Z","timestamp":1314911867000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A scalable multi-sink gradient-based routing protocol for traffic load balancing"],"prefix":"10.1186","volume":"2011","author":[{"given":"Hongseok","family":"Yoo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moonjoo","family":"Shim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongkyun","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,9,1]]},"reference":[{"key":"91_CR1","volume-title":"Proceedings of MobiQuitous","author":"M Perillo","year":"2005","unstructured":"Perillo M, Cheng Z, Heinzelman W: Strategies for Mitigating the Sensor Network Hot Spot Problem. Proceedings of MobiQuitous 2005."},{"key":"91_CR2","volume-title":"Proceedings of IEEE WCNC","author":"D Puccinelli","year":"2008","unstructured":"Puccinelli D, Haenggi M: Arbutus: Network-Layer Load Balancing for Wireless Sensor Networks. Proceedings of IEEE WCNC 2008."},{"key":"91_CR3","volume-title":"Proceedings of IEEE WCNC","author":"I Slama","year":"2008","unstructured":"Slama I, Jouaber B, Zeghlache D: Energy Efficient Scheme for Large Scale Wireless Sensor Networks with Multiple Sinks. Proceedings of IEEE WCNC 2008."},{"key":"91_CR4","volume-title":"Proceedings of IEEE ICCCN","author":"F Ye","year":"2001","unstructured":"Ye F, Chen A, Lu S, Zhang L: A Saclable Solution to Minimum Cost Forwarding in Large Sensor Networlks. Proceedings of IEEE ICCCN 2001."},{"issue":"6","key":"91_CR5","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/MWC.2004.1368893","volume":"11","author":"JN Al-Karaki","year":"2004","unstructured":"Al-Karaki JN, Kamal AE: Routing techniques in wireless sensor networks: a survey. IEEE Wirel Commun 2004, 11(6):6-28. 10.1109\/MWC.2004.1368893","journal-title":"IEEE Wirel Commun"},{"issue":"2","key":"91_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1498915.1498920","volume":"5","author":"P Huang","year":"2009","unstructured":"Huang P, Chen H, Xing G, Tan Y: SGF: a state-free gradient-based forwarding protocol for wireless sensor networks. ACM Trans Sen Netw 2009, 5(2):1-25.","journal-title":"ACM Trans Sen Netw"},{"key":"91_CR7","volume-title":"Proceedings of ACM SIGCOMM","author":"A Basu","year":"2003","unstructured":"Basu A, Lin A, Ramanathan S: Routing Using Potentials: A Dynamic Traffic-Aware Routing Algorithm. Proceedings of ACM SIGCOMM 2003."},{"key":"91_CR8","volume-title":"Proceedings of IEEE APSCC","author":"RH Cheng","year":"2008","unstructured":"Cheng RH, Peng SY, Huang C: A Gradient-Based Dtnamic Load Balance Data Forwarding Method for Multi-Sink Wireless Snesor Networks. Proceedings of IEEE APSCC 2008."},{"key":"91_CR9","volume-title":"Proceedings of IFIP Networking","author":"H Liu","year":"2007","unstructured":"Liu H, Zhang ZL, Srivastava J, Firoiu V: PWave: A Multi-Source Multi-Sink Anycast Routing Framework for Wireless Sensor Networks. Proceedings of IFIP Networking 2007."},{"key":"91_CR10","volume-title":"Proceedings of IEEE WCNC","author":"RC Shah","year":"2002","unstructured":"Shah RC, Rabaey JM: Energy Aware Routing for Low Energy Ad Hoc Sensor Networks. Proceedings of IEEE WCNC 2002."},{"key":"91_CR11","volume-title":"Proceedings of IEEE PIMRC","author":"J Suhonen","year":"2006","unstructured":"Suhonen J, kuorilehto M, Hannikainen M, Hamalainen TD: Cost-Aware Dynamic Routing Protocol for Wireless Sensor Networks--Design and Prototype Experiments. Proceedings of IEEE PIMRC 2006."},{"key":"91_CR12","volume-title":"Proceedings of IEEE WCNC","author":"M Fyffe","year":"2006","unstructured":"Fyffe M, Sun M, Ma X: Traffic-Adapted Load Balancing in Sensor Networks Employing Geographic Routing. Proceedings of IEEE WCNC 2006."},{"key":"91_CR13","volume-title":"Proceedings of ACM\/IEEE MobiCom","author":"S Singh","year":"1998","unstructured":"Singh S, Woo M, Raghavendra CS: Power-Aware Routing in Mobile Ad Hoc Networks. Proceedings of ACM\/IEEE MobiCom 1998."},{"key":"91_CR14","volume-title":"Proceedings of ACM\/IEEE MobiCom","author":"R Draves","year":"2004","unstructured":"Draves R, Padhye J, Zill B: Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks. Proceedings of ACM\/IEEE MobiCom 2004."},{"issue":"3","key":"91_CR15","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s11276-005-6612-9","volume":"11","author":"F Ye","year":"2005","unstructured":"Ye F, Zhoung G, Lu S, Zhang L: GRAdient broadcast: a robust data delivery protocol for large scale sensor networks. Wirel Netw 2005, 11(3):285-298. 10.1007\/s11276-005-6612-9","journal-title":"Wirel Netw"},{"key":"91_CR16","volume-title":"Proceedings of IEEE WCNC","author":"T Roosta","year":"2008","unstructured":"Roosta T, Liao WC, Teng WC, Sastry S: Testbed Implementation of a Secure Flooding Time Synchronization Protocol. Proceedings of IEEE WCNC 2008."},{"key":"91_CR17","volume-title":"Proceedings of IEEE ICCCN","author":"K Wu","year":"2001","unstructured":"Wu K, Harms J: Load-Sensitive Routing for Mobile Ad Hoc Networks. Proceedings of IEEE ICCCN 2001."},{"issue":"2","key":"91_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1109\/TMC.2003.1217236","volume":"2","author":"D Kim","year":"2003","unstructured":"Kim D, Garcia-Luna-Aceves JJ, Obraczka K, Cano J-C, Manzoni P: Routing mechanisms for mobile ad hoc networks based on the energy drain rate. IEEE Trans Mob Comput 2003, 2(2):161-173. 10.1109\/TMC.2003.1217236","journal-title":"IEEE Trans Mob Comput"},{"key":"91_CR19","volume-title":"Proceedings of ACM MobiSys","author":"GW Challen","year":"2010","unstructured":"Challen GW, Waterman J, Welsh M: Idea: Integrated Distributed Energy Awareness for Wireless Sensor Networks. Proceedings of ACM MobiSys 2010."},{"key":"91_CR20","volume-title":"Proceedings of IEEE IPSN","author":"P Basu","year":"2004","unstructured":"Basu P, Redi J: Effect of Overhearing Transmissions on Energy Efficiency in Dense Sensor Networks. Proceedings of IEEE IPSN 2004."},{"key":"91_CR21","volume-title":"Proceedings of IEEE GLOBECOM","author":"H Dai","year":"2003","unstructured":"Dai H, Han R: A Node-Centric Load Balancing Algorithm for Wireless Sensor Networks. Proceedings of IEEE GLOBECOM 2003."},{"key":"91_CR22","doi-asserted-by":"publisher","first-page":"976","DOI":"10.1109\/LCOMM.2005.11010","volume":"9","author":"Y Chen","year":"2005","unstructured":"Chen Y, Zhao Q: On the lifetime of wireless sensor networks. IEEE Commun Lett 2005, 9: 976-978. 10.1109\/LCOMM.2005.11010","journal-title":"IEEE Commun Lett"},{"key":"91_CR23","volume-title":"Proceedings of OSDI","author":"R Fonseca","year":"2008","unstructured":"Fonseca R, Dutta P, Levis P, Stoica I: Quanto: Tracking Energy in Networked Embedded Systems. Proceedings of OSDI 2008."},{"key":"91_CR24","volume-title":"Proceedings of IEEE IPSN","author":"P Dutta","year":"2008","unstructured":"Dutta P, Feldmeier M, Paradiso J, culler D: Energy Metering for Free: Augmenting Switching Regulators for Real-Time Monitoring. Proceedings of IEEE IPSN 2008."},{"key":"91_CR25","volume-title":"Proceedings of ACM SenSys","author":"K Lorincz","year":"2008","unstructured":"Lorincz K, Chen B, Waterman J, Werner-Allen G, Welsh M: Resource Aware Programming in the Pixie os. Proceedings of ACM SenSys 2008."}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1687-1499-2011-85.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1687-1499-2011-85\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1687-1499-2011-85.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T18:07:12Z","timestamp":1630519632000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/1687-1499-2011-85"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,1]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["91"],"URL":"https:\/\/doi.org\/10.1186\/1687-1499-2011-85","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,1]]},"assertion":[{"value":"15 June 2010","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2011","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2011","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"85"}}