{"id":"https://openalex.org/W2121441899","doi":"https://doi.org/10.1109/glocom.2003.1258297","title":"A node-centric load balancing algorithm for wireless sensor networks","display_name":"A node-centric load balancing algorithm for wireless sensor networks","publication_year":2004,"publication_date":"2004-07-08","ids":{"openalex":"https://openalex.org/W2121441899","doi":"https://doi.org/10.1109/glocom.2003.1258297","mag":"2121441899"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2003.1258297","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2003.1258297","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102809764","display_name":"Hui Dai","orcid":"https://orcid.org/0000-0001-5174-8121"},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hui Dai","raw_affiliation_strings":["Department of Computer Science, University of Colorado Boulder, Boulder, CO, USA","Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Colorado Boulder, Boulder, CO, USA","institution_ids":["https://openalex.org/I188538660"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA","institution_ids":["https://openalex.org/I188538660"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085205626","display_name":"Richard Han","orcid":"https://orcid.org/0000-0002-2161-8622"},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Han","raw_affiliation_strings":["Department of Computer Science, University of Colorado Boulder, Boulder, CO, USA","Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Colorado Boulder, Boulder, CO, USA","institution_ids":["https://openalex.org/I188538660"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA","institution_ids":["https://openalex.org/I188538660"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I188538660"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":150,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"548","last_page":"552"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9865000247955322,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7629023790359497},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6945424675941467},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.6578168869018555},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.5560488104820251},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4481276571750641},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44131651520729065},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.43685078620910645},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.41923969984054565},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.41219207644462585},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3913530111312866},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.36461693048477173},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2666087746620178},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14032790064811707},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.13552269339561462},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12025022506713867},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.0915670096874237}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7629023790359497},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6945424675941467},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.6578168869018555},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.5560488104820251},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4481276571750641},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44131651520729065},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.43685078620910645},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.41923969984054565},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.41219207644462585},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3913530111312866},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.36461693048477173},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2666087746620178},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14032790064811707},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.13552269339561462},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12025022506713867},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0915670096874237},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2003.1258297","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2003.1258297","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.8999999761581421}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W339149510","https://openalex.org/W1508951650","https://openalex.org/W1805023694","https://openalex.org/W1848594422","https://openalex.org/W2003042089","https://openalex.org/W2020162591","https://openalex.org/W2098529424","https://openalex.org/W2104532741","https://openalex.org/W2122179278","https://openalex.org/W2135401919","https://openalex.org/W2145156538","https://openalex.org/W2155864758","https://openalex.org/W2155947520","https://openalex.org/W2167396179","https://openalex.org/W2168452204","https://openalex.org/W4243443630","https://openalex.org/W4248301666","https://openalex.org/W4252430522","https://openalex.org/W6611475392","https://openalex.org/W6630331596","https://openalex.org/W6674772581","https://openalex.org/W6681464139"],"related_works":["https://openalex.org/W2990531685","https://openalex.org/W2886722595","https://openalex.org/W2578319993","https://openalex.org/W2761711678","https://openalex.org/W2375661673","https://openalex.org/W2170980056","https://openalex.org/W2379804627","https://openalex.org/W4221129498","https://openalex.org/W4310124294","https://openalex.org/W2359532380"],"abstract_inverted_index":{"By":[0],"spreading":[1],"the":[2,14,19,23,55,58,79],"workload":[3],"across":[4],"a":[5,31,36,47],"sensor":[6,15,24,40],"network,":[7],"load":[8],"balancing":[9],"reduces":[10],"hot":[11],"spots":[12],"in":[13,39],"network":[16],"and":[17,86],"increases":[18],"energy":[20],"lifetime":[21],"of":[22,42,57],"network.":[25],"In":[26],"this":[27],"paper,":[28],"we":[29],"design":[30],"node-centric":[32],"algorithm":[33,69],"that":[34,67,73],"constructs":[35],"load-balanced":[37],"tree":[38],"networks":[41],"asymmetric":[43],"architecture.":[44],"We":[45,65],"utilize":[46],"Chebyshev":[48],"Sum":[49],"metric":[50],"to":[51],"evaluate":[52],"via":[53],"simulation":[54],"balance":[56],"routing":[59,71,80],"trees":[60,72],"produced":[61],"by":[62,89],"our":[63,68],"algorithm.":[64,91],"find":[66],"achieves":[70],"are":[74],"more":[75],"effectively":[76],"balanced":[77],"than":[78],"based":[81],"on":[82],"breadth-first":[83],"search":[84],"(BFS)":[85],"shortest-path":[87],"obtained":[88],"Dijkstra's":[90]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":10}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}