{"id":"https://openalex.org/W2169043097","doi":"https://doi.org/10.1109/mahss.2005.1542859","title":"On-demand loop-free routing in ad hoc networks using source sequence numbers","display_name":"On-demand loop-free routing in ad hoc networks using source sequence numbers","publication_year":2005,"publication_date":"2005-12-13","ids":{"openalex":"https://openalex.org/W2169043097","doi":"https://doi.org/10.1109/mahss.2005.1542859","mag":"2169043097"},"language":"en","primary_location":{"id":"doi:10.1109/mahss.2005.1542859","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mahss.2005.1542859","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://escholarship.org/content/qt95n19972/qt95n19972.pdf?t=nu8yit","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055110357","display_name":"H. Rangarajan","orcid":null},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"H. Rangarajan","raw_affiliation_strings":["Computer Engineering Department, University of California, Santa Cruz, Santa Cruz, CA, USA"],"affiliations":[{"raw_affiliation_string":"Computer Engineering Department, University of California, Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065935907","display_name":"J.J. Garcia\u2010Luna\u2010Aceves","orcid":"https://orcid.org/0000-0001-9914-6031"},"institutions":[{"id":"https://openalex.org/I173498003","display_name":"Palo Alto Research Center","ror":"https://ror.org/0529fxt39","country_code":"US","type":"facility","lineage":["https://openalex.org/I173498003","https://openalex.org/I4210132870"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J.J. Garcia-Luna-Aceves","raw_affiliation_strings":["Palo Alto Research Center, Inc.orporated, Palo Alto, CA, USA"],"affiliations":[{"raw_affiliation_string":"Palo Alto Research Center, Inc.orporated, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I173498003"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055110357"],"corresponding_institution_ids":["https://openalex.org/I185103710"],"apc_list":null,"apc_paid":null,"fwci":0.8207,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.80213043,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"3626","issue":null,"first_page":"681","last_page":"690"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc 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/T10246","display_name":"Mobile Ad Hoc 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/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.998199999332428,"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.7488375902175903},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.7106578946113586},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7083977460861206},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.7028778791427612},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.6190813779830933},{"id":"https://openalex.org/keywords/optimized-link-state-routing-protocol","display_name":"Optimized Link State Routing Protocol","score":0.590803861618042},{"id":"https://openalex.org/keywords/ad-hoc-on-demand-distance-vector-routing","display_name":"Ad hoc On-Demand Distance Vector Routing","score":0.5124228596687317},{"id":"https://openalex.org/keywords/wireless-routing-protocol","display_name":"Wireless Routing Protocol","score":0.5083600878715515},{"id":"https://openalex.org/keywords/distance-vector-routing-protocol","display_name":"Distance-vector routing protocol","score":0.5010313987731934},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.48478955030441284},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.45543915033340454},{"id":"https://openalex.org/keywords/zone-routing-protocol","display_name":"Zone Routing Protocol","score":0.4550037384033203},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.42470183968544006},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4223180413246155},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.26952987909317017},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14913195371627808}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7488375902175903},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.7106578946113586},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7083977460861206},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.7028778791427612},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.6190813779830933},{"id":"https://openalex.org/C204739117","wikidata":"https://www.wikidata.org/wiki/Q1368373","display_name":"Optimized Link State Routing Protocol","level":4,"score":0.590803861618042},{"id":"https://openalex.org/C104503742","wikidata":"https://www.wikidata.org/wiki/Q345335","display_name":"Ad hoc On-Demand Distance Vector Routing","level":5,"score":0.5124228596687317},{"id":"https://openalex.org/C47318570","wikidata":"https://www.wikidata.org/wiki/Q8026863","display_name":"Wireless Routing Protocol","level":4,"score":0.5083600878715515},{"id":"https://openalex.org/C202385902","wikidata":"https://www.wikidata.org/wiki/Q1229441","display_name":"Distance-vector routing protocol","level":5,"score":0.5010313987731934},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.48478955030441284},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.45543915033340454},{"id":"https://openalex.org/C189884158","wikidata":"https://www.wikidata.org/wiki/Q8073926","display_name":"Zone Routing Protocol","level":5,"score":0.4550037384033203},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.42470183968544006},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4223180413246155},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.26952987909317017},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14913195371627808}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/mahss.2005.1542859","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mahss.2005.1542859","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","raw_type":"proceedings-article"},{"id":"pmh:qt95n19972","is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/95n19972","pdf_url":"https://escholarship.org/content/qt95n19972/qt95n19972.pdf?t=nu8yit","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Garcia-Luna-Aceves, J.J.(2005). On-demand Loop-Free Routing in Ad hoc Networks Using Source Sequence Numbers. IEEE MASS 2005. UC Santa Cruz: Retrieved from: http://www.escholarship.org/uc/item/95n19972","raw_type":"article"},{"id":"pmh:ADA457400","is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA457400","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC","raw_type":"Text"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt95n19972","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/95n19972","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":{"id":"pmh:qt95n19972","is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/95n19972","pdf_url":"https://escholarship.org/content/qt95n19972/qt95n19972.pdf?t=nu8yit","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Garcia-Luna-Aceves, J.J.(2005). On-demand Loop-Free Routing in Ad hoc Networks Using Source Sequence Numbers. IEEE MASS 2005. UC Santa Cruz: Retrieved from: http://www.escholarship.org/uc/item/95n19972","raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2169043097.pdf"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W1549535141","https://openalex.org/W1726571582","https://openalex.org/W2030824584","https://openalex.org/W2035776116","https://openalex.org/W2099574482","https://openalex.org/W2102258543","https://openalex.org/W2107070159","https://openalex.org/W6659666874"],"related_works":["https://openalex.org/W2375399753","https://openalex.org/W1914344382","https://openalex.org/W2131129003","https://openalex.org/W3033344257","https://openalex.org/W1570753465","https://openalex.org/W2181964266","https://openalex.org/W2336047325","https://openalex.org/W2784472057","https://openalex.org/W2564583567","https://openalex.org/W167441611"],"abstract_inverted_index":{"In":[0],"any":[1],"on-demand":[2,63,88],"routing":[3,64,89],"protocol,":[4],"sources":[5],"flood":[6],"route":[7],"requests":[8],"(RREQ)":[9],"to":[10,13],"build":[11],"routes":[12],"destinations,":[14],"and":[15,32,110,133],"each":[16,52],"new":[17,103,119],"RREQ":[18,40,53],"is":[19,70],"identified":[20],"uniquely":[21],"with":[22,108],"a":[23,33,39,44],"source-sequenced":[24],"label":[25],"(SSL)":[26],"consisting":[27],"of":[28,101],"the":[29,58,83],"source":[30,131],"identifier":[31],"locally":[34],"generated":[35],"sequence":[36],"number.":[37],"As":[38],"propagates,":[41],"it":[42],"creates":[43],"directed":[45],"acyclic":[46],"graph":[47],"(DAG),":[48],"because":[49],"nodes":[50],"relay":[51],"only":[54],"once.":[55],"We":[56],"present":[57],"first":[59],"framework":[60,104],"for":[61,97],"loop-free":[62],"in":[65,85,106],"ad":[66],"hoc":[67,124],"networks":[68],"that":[69,117],"based":[71],"directly":[72],"on":[73,77,125],"SSLs,":[74],"rather":[75],"than":[76],"independent":[78],"mechanisms,":[79],"which":[80,86],"has":[81],"been":[82,92],"way":[84],"prior":[87],"protocols":[90,120],"have":[91],"designed.":[93],"Extensive":[94],"simulation":[95],"results":[96],"simple":[98],"protocol":[99],"instantiations":[100],"our":[102,118],"operating":[105],"scenarios":[107],"50":[109],"100-nodes":[111],"under":[112],"different":[113],"traffic":[114],"patterns":[115],"show":[116],"outperform":[121],"AODV":[122],"(Ad":[123],"demand":[126],"distance":[127],"vector),":[128],"DSR":[129],"(dynamic":[130],"routing),":[132],"OLSR":[134],"(optimized":[135],"link":[136],"state":[137],"routing)":[138]},"counts_by_year":[{"year":2017,"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":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}