{"id":"https://openalex.org/W2055572959","doi":"https://doi.org/10.1145/1835698.1835727","title":"Brief announcement","display_name":"Brief announcement","publication_year":2010,"publication_date":"2010-07-25","ids":{"openalex":"https://openalex.org/W2055572959","doi":"https://doi.org/10.1145/1835698.1835727","mag":"2055572959"},"language":"en","primary_location":{"id":"doi:10.1145/1835698.1835727","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1835698.1835727","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed 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/A5063510852","display_name":"Florian Huc","orcid":null},"institutions":[{"id":"https://openalex.org/I114457229","display_name":"University of Geneva","ror":"https://ror.org/01swzsf04","country_code":"CH","type":"education","lineage":["https://openalex.org/I114457229"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Florian Huc","raw_affiliation_strings":["University of Geneva, Geneva, Switzerland"],"affiliations":[{"raw_affiliation_string":"University of Geneva, Geneva, Switzerland","institution_ids":["https://openalex.org/I114457229"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032568553","display_name":"Aubin Jarry","orcid":null},"institutions":[{"id":"https://openalex.org/I114457229","display_name":"University of Geneva","ror":"https://ror.org/01swzsf04","country_code":"CH","type":"education","lineage":["https://openalex.org/I114457229"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Aubin Jarry","raw_affiliation_strings":["University of Geneva, Geneva, Switzerland"],"affiliations":[{"raw_affiliation_string":"University of Geneva, Geneva, Switzerland","institution_ids":["https://openalex.org/I114457229"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057025680","display_name":"Pierre Leone","orcid":"https://orcid.org/0000-0002-4514-5380"},"institutions":[{"id":"https://openalex.org/I114457229","display_name":"University of Geneva","ror":"https://ror.org/01swzsf04","country_code":"CH","type":"education","lineage":["https://openalex.org/I114457229"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Pierre Leone","raw_affiliation_strings":["University of Geneva, Geneva, Switzerland"],"affiliations":[{"raw_affiliation_string":"University of Geneva, Geneva, Switzerland","institution_ids":["https://openalex.org/I114457229"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045128977","display_name":"Andrea Roli","orcid":"https://orcid.org/0000-0001-9891-5441"},"institutions":[{"id":"https://openalex.org/I114457229","display_name":"University of Geneva","ror":"https://ror.org/01swzsf04","country_code":"CH","type":"education","lineage":["https://openalex.org/I114457229"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Jose Rolim","raw_affiliation_strings":["University of Geneva, Geneva, Switzerland"],"affiliations":[{"raw_affiliation_string":"University of Geneva, Geneva, Switzerland","institution_ids":["https://openalex.org/I114457229"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5063510852"],"corresponding_institution_ids":["https://openalex.org/I114457229"],"apc_list":null,"apc_paid":null,"fwci":0.3561,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.63127198,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"116","last_page":"117"},"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.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.9994999766349792,"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.7298327684402466},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5740377902984619},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.56270831823349},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4989762306213379},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4888541102409363},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.48306185007095337},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.4776698052883148},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4738861918449402},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.4662894904613495},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.45985040068626404},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.42444461584091187},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.42201584577560425},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.3891885280609131},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3366236090660095},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14676794409751892},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1277095377445221},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.09173229336738586}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7298327684402466},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5740377902984619},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.56270831823349},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4989762306213379},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4888541102409363},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.48306185007095337},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.4776698052883148},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4738861918449402},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.4662894904613495},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.45985040068626404},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.42444461584091187},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.42201584577560425},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.3891885280609131},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3366236090660095},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14676794409751892},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1277095377445221},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.09173229336738586},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1835698.1835727","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1835698.1835727","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8999999761581421,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1484729940","https://openalex.org/W1558089154","https://openalex.org/W2101963262","https://openalex.org/W2140667900","https://openalex.org/W2142963885"],"related_works":["https://openalex.org/W2123257532","https://openalex.org/W2898676476","https://openalex.org/W2620451430","https://openalex.org/W2102269193","https://openalex.org/W1655019438","https://openalex.org/W1602184149","https://openalex.org/W2226043842","https://openalex.org/W4225279627","https://openalex.org/W2777052597","https://openalex.org/W2776102956"],"abstract_inverted_index":{"We":[0,66],"study":[1],"the":[2,11,92,95,105,163,166,172,182],"problem":[3],"of":[4,25,94,107,120,155,165,175],"routing":[5,55,138],"messages":[6,59],"in":[7,34,111,122,130,185],"sensor":[8,143],"networks":[9],"where":[10,160],"energy":[12,173],"saving":[13,64],"issue":[14],"is":[15,71,151,162],"essential.":[16],"In":[17],"this":[18],"paper,":[19],"we":[20,78,99,170],"propose":[21],"ROAM2,":[22],"an":[23,73],"improvement":[24],"ROAM":[26,81,116,176],"(Routing":[27],"protocol":[28,38],"with":[29,47,83],"Obstacle":[30],"Avoidance":[31],"Mechanism)":[32],"proposed":[33,184],"[HJL+09].":[35],"This":[36],"distributed":[37],"has":[39,72],"a":[40,54,101,112,147],"light":[41],"obstacle":[42],"detection":[43],"and":[44,50,53,77,187],"avoidance":[45],"component":[46,56],"low":[48],"message":[49],"computation":[51],"overhead":[52],"which":[57,193],"sends":[58],"along":[60],"short":[61],"paths,":[62],"thus":[63],"energy.":[65],"improved":[67],"it":[68,132],"so":[69],"that":[70,80,135],"100%":[74],"delivery":[75],"rate":[76],"prove":[79,100],"finds":[82],"high":[84],"probability":[85],"paths":[86],"whose":[87,149],"lengths":[88],"are":[89,127],"comparable":[90],"to":[91,153],"length":[93,106,150,164],"shortest":[96,167],"paths.":[97],"Furthermore,":[98],"general":[102],"result":[103],"on":[104],"any":[108,142],"path":[109,148],"computed":[110],"greedy":[113],"way.":[114],"Whereas":[115],"uses":[117],"one":[118],"bit":[119],"memory":[121,144],"nodes":[123],"(even":[124],"if":[125],"there":[126],"several":[128],"destinations),":[129],"[KWZ08],":[131],"was":[133],"shown":[134],"no":[136],"geographic":[137],"algorithm":[139,183],"not":[140],"using":[141],"can":[145],"compute":[146],"guaranteed":[152],"be":[154],"order":[156],"less":[157],"than":[158],"O(l2),":[159],"l":[161],"path.":[168],"Finally,":[169],"compare":[171],"efficiency":[174],"against":[177],"GPSR":[178],"(or":[179],"GFG)":[180],"[KK00],":[181],"[MLNR08]":[186],"SLGF":[188],"[JMLW08],":[189],"by":[190],"running":[191],"simulations":[192],"validates":[194],"our":[195],"theoretical":[196],"results":[197]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}