{"id":"https://openalex.org/W1991008216","doi":"https://doi.org/10.1145/1860093.1860116","title":"Greedy geographic routing in large-scale sensor networks","display_name":"Greedy geographic routing in large-scale sensor networks","publication_year":2010,"publication_date":"2010-09-20","ids":{"openalex":"https://openalex.org/W1991008216","doi":"https://doi.org/10.1145/1860093.1860116","mag":"1991008216"},"language":"en","primary_location":{"id":"doi:10.1145/1860093.1860116","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1860093.1860116","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing","raw_type":"proceedings-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/A5103414836","display_name":"Anne-Mari Kermarrec","orcid":null},"institutions":[{"id":"https://openalex.org/I4210133778","display_name":"Inria Rennes - Bretagne Atlantique Research Centre","ror":"https://ror.org/04040yw90","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210133778"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Anne-Mari Kermarrec","raw_affiliation_strings":["INRIA, Rennes, France","Inria-Rennes, France#TAB#"],"affiliations":[{"raw_affiliation_string":"INRIA, Rennes, France","institution_ids":["https://openalex.org/I4210133778","https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Inria-Rennes, France#TAB#","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062708755","display_name":"Guang Tan","orcid":"https://orcid.org/0000-0002-0658-8867"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210133778","display_name":"Inria Rennes - Bretagne Atlantique Research Centre","ror":"https://ror.org/04040yw90","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210133778"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Guang Tan","raw_affiliation_strings":["INRIA, Rennes, France","Inria-Rennes, France#TAB#"],"affiliations":[{"raw_affiliation_string":"INRIA, Rennes, France","institution_ids":["https://openalex.org/I4210133778","https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Inria-Rennes, France#TAB#","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103414836"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210133778"],"apc_list":null,"apc_paid":null,"fwci":2.4929,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.89180283,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"161","last_page":"170"},"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9998000264167786,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.7814602851867676},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7161267399787903},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.6932849884033203},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6635799407958984},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5274624824523926},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4690288305282593},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4334760010242462},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.4297768771648407},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.42460256814956665},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36314982175827026},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3515975773334503},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3363012671470642},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20782530307769775},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14392873644828796},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09745529294013977}],"concepts":[{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.7814602851867676},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7161267399787903},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.6932849884033203},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6635799407958984},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5274624824523926},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4690288305282593},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4334760010242462},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.4297768771648407},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.42460256814956665},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36314982175827026},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3515975773334503},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3363012671470642},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20782530307769775},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14392873644828796},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09745529294013977},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1860093.1860116","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1860093.1860116","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1566622904","https://openalex.org/W1656048259","https://openalex.org/W1965703925","https://openalex.org/W1981988453","https://openalex.org/W1982182450","https://openalex.org/W2002974434","https://openalex.org/W2007575140","https://openalex.org/W2054030867","https://openalex.org/W2066577300","https://openalex.org/W2089153919","https://openalex.org/W2101963262","https://openalex.org/W2102465486","https://openalex.org/W2108865768","https://openalex.org/W2113081707","https://openalex.org/W2117768029","https://openalex.org/W2120998323","https://openalex.org/W2122804302","https://openalex.org/W2135378328","https://openalex.org/W2135572590","https://openalex.org/W2136277131","https://openalex.org/W2138822266","https://openalex.org/W2144246237","https://openalex.org/W2152809170","https://openalex.org/W2158969254","https://openalex.org/W2165410586","https://openalex.org/W2166427957","https://openalex.org/W2171347352"],"related_works":["https://openalex.org/W2120137201","https://openalex.org/W1655019438","https://openalex.org/W2123812631","https://openalex.org/W2950120971","https://openalex.org/W2543752581","https://openalex.org/W1975971517","https://openalex.org/W2149136852","https://openalex.org/W2904118576","https://openalex.org/W2163375631","https://openalex.org/W2395854216"],"abstract_inverted_index":{"In":[0],"geographic":[1],"(or":[2,51],"geometric)":[3],"routing,":[4],"messages":[5],"are":[6],"expected":[7],"to":[8,21,28,45,59,65,72,113,163,181],"route":[9],"in":[10,85,123,175,183],"a":[11,19,78,96,100,124,128,164,170,176],"greedy":[12,74,109],"manner:":[13],"the":[14,29,46,92,132,158],"current":[15],"node":[16,24],"always":[17],"forwards":[18],"message":[20],"its":[22,32,145],"neighbor":[23],"that":[25,168],"is":[26,111,142],"closest":[27],"destination.":[30],"Despite":[31],"simplicity":[33],"and":[34,148,179],"general":[35],"efficiency,":[36],"this":[37],"strategy":[38],"alone":[39],"does":[40],"not":[41],"guarantee":[42],"delivery":[43],"due":[44],"existence":[47],"of":[48,81,94,103,140],"local":[49,55],"minima":[50,56],"dead":[52],"ends).":[53],"Overcoming":[54],"requires":[57],"nodes":[58],"maintain":[60],"extra":[61],"non-local":[62,83],"state":[63,84],"or":[64],"use":[66],"auxiliary":[67],"mechanisms.":[68],"We":[69,115,151],"study":[70],"how":[71],"facilitate":[73],"forwarding":[75],"by":[76,118],"using":[77],"minimum":[79,101],"amount":[80],"such":[82],"topologically":[86],"complex":[87],"networks.":[88],"Specifically,":[89],"we":[90],"investigate":[91],"problem":[93],"decomposing":[95],"given":[97,143],"network":[98,186],"into":[99],"number":[102],"Greedily":[104,133],"Routable":[105,134],"Components":[106],"(GRC),":[107],"where":[108],"routing":[110,149,166,171],"guaranteed":[112],"work.":[114],"approach":[116],"it":[117],"considering":[119],"an":[120],"approximate":[121,155],"version":[122],"continuous":[125,177],"domain,":[126,178],"with":[127],"central":[129],"concept":[130],"called":[131],"Region":[135],"(GRR).":[136],"A":[137],"full":[138],"characterization":[139],"GRR":[141],"concerning":[144],"geometric":[146],"properties":[147],"capability.":[150],"then":[152],"develop":[153],"simple":[154],"algorithms":[156],"for":[157],"problem.":[159],"These":[160],"results":[161],"lead":[162],"practical":[165],"protocol":[167],"has":[169],"stretch":[172],"below":[173],"7":[174],"close":[180],"1":[182],"several":[184],"realistic":[185],"settings":[187]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}