{"id":"https://openalex.org/W2012247215","doi":"https://doi.org/10.1145/2240092.2240099","title":"A case for hierarchical routing in low-power wireless embedded networks","display_name":"A case for hierarchical routing in low-power wireless embedded networks","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2012247215","doi":"https://doi.org/10.1145/2240092.2240099","mag":"2012247215"},"language":"en","primary_location":{"id":"doi:10.1145/2240092.2240099","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2240092.2240099","pdf_url":null,"source":{"id":"https://openalex.org/S170502224","display_name":"ACM Transactions on Sensor Networks","issn_l":"1550-4859","issn":["1550-4859","1550-4867"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Sensor Networks","raw_type":"journal-article"},"type":"article","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/A5025556487","display_name":"Konrad Iwanicki","orcid":"https://orcid.org/0000-0002-5380-6337"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Konrad Iwanicki","raw_affiliation_strings":["University of Warsaw, Warszawa, Poland","Univ. of Warsaw, Warszawa, Poland#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Warsaw, Warszawa, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"Univ. of Warsaw, Warszawa, Poland#TAB#","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027678871","display_name":"Maarten van Steen","orcid":"https://orcid.org/0000-0002-5113-2746"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maarten Van Steen","raw_affiliation_strings":["VU University Amsterdam, Netherlands"],"affiliations":[{"raw_affiliation_string":"VU University Amsterdam, Netherlands","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025556487"],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":null,"apc_paid":null,"fwci":1.1176,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.78934703,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"8","issue":"3","first_page":"1","last_page":"34"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9998999834060669,"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":0.9998999834060669,"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.9997000098228455,"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/T11392","display_name":"Energy Harvesting in Wireless Networks","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.7752334475517273},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7714415192604065},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.744146466255188},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.7270986437797546},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.7230311036109924},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.6981281042098999},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6527819633483887},{"id":"https://openalex.org/keywords/hierarchical-routing","display_name":"Hierarchical routing","score":0.5548909306526184},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.533013641834259},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5249119997024536},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.49074944853782654},{"id":"https://openalex.org/keywords/wireless-routing-protocol","display_name":"Wireless Routing Protocol","score":0.4499717950820923},{"id":"https://openalex.org/keywords/zone-routing-protocol","display_name":"Zone Routing Protocol","score":0.4282549023628235},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.37256473302841187},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.24429452419281006}],"concepts":[{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.7752334475517273},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7714415192604065},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.744146466255188},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.7270986437797546},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.7230311036109924},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.6981281042098999},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6527819633483887},{"id":"https://openalex.org/C177818476","wikidata":"https://www.wikidata.org/wiki/Q12878103","display_name":"Hierarchical routing","level":5,"score":0.5548909306526184},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.533013641834259},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5249119997024536},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.49074944853782654},{"id":"https://openalex.org/C47318570","wikidata":"https://www.wikidata.org/wiki/Q8026863","display_name":"Wireless Routing Protocol","level":4,"score":0.4499717950820923},{"id":"https://openalex.org/C189884158","wikidata":"https://www.wikidata.org/wiki/Q8073926","display_name":"Zone Routing Protocol","level":5,"score":0.4282549023628235},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.37256473302841187},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.24429452419281006}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2240092.2240099","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2240092.2240099","pdf_url":null,"source":{"id":"https://openalex.org/S170502224","display_name":"ACM Transactions on Sensor Networks","issn_l":"1550-4859","issn":["1550-4859","1550-4867"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Sensor Networks","raw_type":"journal-article"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/d3e6c8b8-7704-4ddd-a574-8bce23d794f7","is_oa":false,"landing_page_url":"https://research.vu.nl/en/publications/d3e6c8b8-7704-4ddd-a574-8bce23d794f7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Iwanicki, K S & van Steen, M R 2012, 'A Case for Hierarchical Routing in in Low-Power Wireless Embedded Networks', ACM Transactions on Sensor Networks, vol. 8, no. 3. https://doi.org/10.1145/2240092.2240099","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.701.7739","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.701.7739","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.distributed-systems.net/papers/2012.tosn.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.714.2243","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.714.2243","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mimuw.edu.pl/%7Eiwanicki/publications/2012/TOSN/iwanicki-TOSN2012.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6109050105","display_name":null,"funder_award_id":"HOMING PLUS/2010-2/4","funder_id":"https://openalex.org/F4320321042","funder_display_name":"Fundacja na rzecz Nauki Polskiej"}],"funders":[{"id":"https://openalex.org/F4320321042","display_name":"Fundacja na rzecz Nauki Polskiej","ror":"https://ror.org/048zd9m77"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W168095906","https://openalex.org/W1500787554","https://openalex.org/W1569456568","https://openalex.org/W1582880497","https://openalex.org/W1656048259","https://openalex.org/W1804046865","https://openalex.org/W1840128750","https://openalex.org/W1983598160","https://openalex.org/W1993248613","https://openalex.org/W2004662500","https://openalex.org/W2012987308","https://openalex.org/W2014411916","https://openalex.org/W2044959725","https://openalex.org/W2047282676","https://openalex.org/W2054030867","https://openalex.org/W2063480992","https://openalex.org/W2067416704","https://openalex.org/W2085463780","https://openalex.org/W2086824628","https://openalex.org/W2088632464","https://openalex.org/W2098596524","https://openalex.org/W2099448229","https://openalex.org/W2099528373","https://openalex.org/W2099574482","https://openalex.org/W2101963262","https://openalex.org/W2108598902","https://openalex.org/W2118592651","https://openalex.org/W2121639549","https://openalex.org/W2122788699","https://openalex.org/W2150039965","https://openalex.org/W2152809170","https://openalex.org/W2157457404","https://openalex.org/W2167465093","https://openalex.org/W2169458211","https://openalex.org/W2170977078","https://openalex.org/W2504845233","https://openalex.org/W2795997391","https://openalex.org/W4236590519","https://openalex.org/W4238462577"],"related_works":["https://openalex.org/W2013396782","https://openalex.org/W4207055581","https://openalex.org/W2012247215","https://openalex.org/W2104919611","https://openalex.org/W2102749905","https://openalex.org/W2347220145","https://openalex.org/W1980185352","https://openalex.org/W1616553398","https://openalex.org/W2968712851","https://openalex.org/W60672769"],"abstract_inverted_index":{"Hierarchical":[0],"routing":[1,10,58,103,114,120,136,140,150,156,194,206,213,216,238,281],"has":[2,32],"often":[3],"been":[4,33],"mentioned":[5],"as":[6,105,107],"an":[7,158,222],"appealing":[8],"point-to-point":[9],"technique":[11,141],"for":[12,197],"wireless":[13],"sensor":[14],"networks":[15],"(sensornets).":[16],"While":[17],"there":[18,31],"is":[19,137,242],"a":[20,53,63,84,94,138,164,259,266],"volume":[21],"of":[22,55,70,87,112,118,160,167,181,212,224,237,245,247,268,273],"analytical":[23],"and":[24,49,73,92,127,163,230,271],"high-level":[25],"simulation":[26],"results":[27,132],"demonstrating":[28],"its":[29,240],"merits,":[30],"little":[34],"work":[35],"evaluating":[36],"it":[37,152],"in":[38,90,143,185,210,235,250],"actual":[39],"sensornet":[40,85,199,277],"settings.":[41],"This":[42],"article":[43],"bridges":[44],"the":[45,67,71,79,88,110,116,175,179,186,189,204,232],"gap":[46],"between":[47],"theory":[48],"practice.":[50,144],"Having":[51],"analyzed":[52],"number":[54,267],"proposed":[56],"hierarchical":[57,102,113,135,193,215,280],"protocols,":[59],"we":[60,263,275],"have":[61],"developed":[62],"framework":[64,89],"that":[65,101,134,246],"captures":[66],"common":[68],"characteristics":[69],"protocols":[72,80],"identifies":[74],"design":[75],"points":[76],"at":[77,220,231],"which":[78,274],"differ.":[81],"We":[82],"use":[83],"implementation":[86],"TOSSIM":[91],"on":[93],"60-node":[95],"testbed":[96],"to":[97,108,183,203,258],"study":[98],"various":[99],"trade-offs":[100,190],"introduces,":[104],"well":[106],"compare":[109],"performance":[111,117,241,253],"with":[115],"other":[119,205],"techniques,":[121],"namely":[122],"shortest-path":[123],"routing,":[124,126,229],"compact":[125,228,248],"beacon":[128],"vector":[129],"routing.":[130],"The":[131],"show":[133],"compelling":[139],"also":[142,171,264],"In":[145],"particular,":[146],"despite":[147],"only":[148],"logarithmic":[149],"state,":[151,214],"can":[153,170,217,254],"offer":[154,218],"small":[155],"stretch:":[157],"average":[159],"\u223c":[161],"1.25":[162],"99th":[165],"percentile":[166],"2.":[168],"It":[169],"be":[172,256,283],"robust,":[173],"minimizing":[174],"maintenance":[176],"traffic":[177],"or":[178],"latency":[180],"reacting":[182],"changes":[184],"network.":[187],"Moreover,":[188],"offered":[191],"by":[192],"are":[195],"attractive":[196],"many":[198],"applications":[200],"when":[201],"compared":[202],"techniques.":[207],"For":[208],"example,":[209],"terms":[211,236],"scalability":[219],"least":[221],"order":[223],"magnitude":[225],"better":[226],"than":[227],"same":[233],"time,":[234],"stretch,":[239],"within":[243],"10--15%":[244],"routing;":[249],"addition,":[251],"this":[252],"further":[255],"tuned":[257],"particular":[260],"application.":[261],"Finally,":[262],"identify":[265],"practical":[269],"issues":[270],"limitations":[272],"believe":[276],"developers":[278],"adopting":[279],"should":[282],"aware.":[284]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}