{"id":"https://openalex.org/W2113877778","doi":"https://doi.org/10.1109/icccn.2004.1401581","title":"Path based routing algorithm for ad hoc networks","display_name":"Path based routing algorithm for ad hoc networks","publication_year":2005,"publication_date":"2005-03-21","ids":{"openalex":"https://openalex.org/W2113877778","doi":"https://doi.org/10.1109/icccn.2004.1401581","mag":"2113877778"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2004.1401581","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2004.1401581","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","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/A5111913610","display_name":"Weilin Zeng","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Weilin Zeng","raw_affiliation_strings":["School of Information and Computer Science, Irvine, CA, USA","Sch. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA"],"affiliations":[{"raw_affiliation_string":"School of Information and Computer Science, Irvine, CA, USA","institution_ids":[]},{"raw_affiliation_string":"Sch. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5106175045","display_name":"Tatsuya Suda","orcid":"https://orcid.org/0000-0002-2006-6803"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"T. Suda","raw_affiliation_strings":["School of Information and Computer Science, Irvine, CA, USA","Sch. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA"],"affiliations":[{"raw_affiliation_string":"School of Information and Computer Science, Irvine, CA, USA","institution_ids":[]},{"raw_affiliation_string":"Sch. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111913610"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2595,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.65108742,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"37","last_page":"43"},"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9991000294685364,"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.9987000226974487,"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/computer-science","display_name":"Computer science","score":0.797028124332428},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7028356790542603},{"id":"https://openalex.org/keywords/flooding","display_name":"Flooding (psychology)","score":0.6760998964309692},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.6536009907722473},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6233291625976562},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.528608500957489},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.514593243598938},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5003762245178223},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4985671043395996},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.47075560688972473},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4686782956123352},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.42715543508529663},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4087362587451935}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.797028124332428},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7028356790542603},{"id":"https://openalex.org/C186594467","wikidata":"https://www.wikidata.org/wiki/Q1429176","display_name":"Flooding (psychology)","level":2,"score":0.6760998964309692},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.6536009907722473},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6233291625976562},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.528608500957489},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.514593243598938},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5003762245178223},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4985671043395996},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.47075560688972473},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4686782956123352},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.42715543508529663},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4087362587451935},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccn.2004.1401581","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2004.1401581","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.44999998807907104,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1493583993","https://openalex.org/W2017333190","https://openalex.org/W2026635021","https://openalex.org/W2040883277","https://openalex.org/W2077035969","https://openalex.org/W2099574482","https://openalex.org/W2109150708","https://openalex.org/W2119710605","https://openalex.org/W2132932625","https://openalex.org/W2139096736","https://openalex.org/W2157457404","https://openalex.org/W3103987592","https://openalex.org/W4229814467","https://openalex.org/W6678046172"],"related_works":["https://openalex.org/W2555559350","https://openalex.org/W2108305519","https://openalex.org/W1242343826","https://openalex.org/W2081964190","https://openalex.org/W1971663816","https://openalex.org/W2113362813","https://openalex.org/W2607223747","https://openalex.org/W1976978163","https://openalex.org/W4241849776","https://openalex.org/W2182195922"],"abstract_inverted_index":{"In":[0],"reactive":[1,125],"routing":[2,69,80,108,126],"protocols":[3,127],"for":[4],"ad":[5],"hoc":[6],"networks,":[7],"the":[8,43,56,63,102],"network":[9],"wide":[10],"flooding":[11],"generates":[12],"a":[13,31,40,60,90,97],"significant":[14],"amount":[15],"of":[16,21,58],"traffic":[17],"overhead.":[18,28],"The":[19,74],"goal":[20],"This":[22],"work":[23],"is":[24,71],"to":[25,42,62],"reduce":[26],"this":[27],"We":[29,52],"propose":[30,89],"path":[32,61,67,75,78,99,103,106],"based":[33,68,79,100,107],"route":[34,41,50,91],"discovery":[35,109],"scheme":[36,93],"which":[37,94],"can":[38,95],"find":[39],"destination":[44,64],"with":[45],"lower":[46],"overhead":[47],"than":[48,123],"flooding-based":[49],"discovery.":[51],"also":[53],"showed":[54,114],"that":[55,115],"probability":[57],"finding":[59],"by":[65],"using":[66],"request":[70,81],"not":[72],"negligible.":[73],"obtained":[76],"through":[77],"may":[82],"be":[83],"far":[84],"from":[85],"optimal.":[86],"Thus,":[87],"we":[88,113],"expanding":[92],"discover":[96],"better":[98,121],"on":[101],"discovered":[104],"in":[105],"phase.":[110],"By":[111],"simulation,":[112],"integrating":[116],"these":[117],"two":[118],"schemes":[119],"has":[120],"performance":[122],"existing":[124],"like":[128],"DSR.":[129]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}