{"id":"https://openalex.org/W2084625172","doi":"https://doi.org/10.1109/wcnc.2006.1683483","title":"Multipath location aided routing in 2d and 3d","display_name":"Multipath location aided routing in 2d and 3d","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2084625172","doi":"https://doi.org/10.1109/wcnc.2006.1683483","mag":"2084625172"},"language":"en","primary_location":{"id":"doi:10.1109/wcnc.2006.1683483","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2006.1683483","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5102709779","display_name":"Santosh Kumar Nanda","orcid":"https://orcid.org/0000-0002-4112-5059"},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Nanda","raw_affiliation_strings":["Department of Computer Science, Dartmouth College, Hanover, NH, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Dartmouth College, Hanover, NH, USA","institution_ids":["https://openalex.org/I107672454"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037564265","display_name":"Robert S. Gray","orcid":null},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R.S. Gray","raw_affiliation_strings":["Department of Computer Science, Dartmouth College, Hanover, NH, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Dartmouth College, Hanover, NH, USA","institution_ids":["https://openalex.org/I107672454"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I107672454"],"apc_list":null,"apc_paid":null,"fwci":0.7051,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.66056043,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"199","issue":null,"first_page":"311","last_page":"317"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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.9995999932289124,"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.9987999796867371,"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/multipath-routing","display_name":"Multipath routing","score":0.7500492334365845},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7266970872879028},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.589751660823822},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5522984862327576},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5342354774475098},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5310250520706177},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.5243406891822815},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5184097290039062},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.411376416683197},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3699048161506653},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2791644036769867}],"concepts":[{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.7500492334365845},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7266970872879028},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.589751660823822},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5522984862327576},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5342354774475098},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5310250520706177},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.5243406891822815},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5184097290039062},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.411376416683197},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3699048161506653},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2791644036769867}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wcnc.2006.1683483","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2006.1683483","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1513792956","https://openalex.org/W1554193878","https://openalex.org/W1907032667","https://openalex.org/W1991507050","https://openalex.org/W2026197880","https://openalex.org/W2044959725","https://openalex.org/W2099574482","https://openalex.org/W2101963262","https://openalex.org/W2106252042","https://openalex.org/W2114682547","https://openalex.org/W2119710605","https://openalex.org/W2145183200","https://openalex.org/W2149472588","https://openalex.org/W2151492345","https://openalex.org/W2157457404","https://openalex.org/W2160558706","https://openalex.org/W2161457646","https://openalex.org/W2164470020","https://openalex.org/W2166485324","https://openalex.org/W2213553754","https://openalex.org/W2533642963","https://openalex.org/W3043148557","https://openalex.org/W6630875438","https://openalex.org/W6640135883","https://openalex.org/W6648143902","https://openalex.org/W6678046172","https://openalex.org/W6781027917"],"related_works":["https://openalex.org/W3127002380","https://openalex.org/W2555559350","https://openalex.org/W2369989480","https://openalex.org/W2124642421","https://openalex.org/W2607223747","https://openalex.org/W2081964190","https://openalex.org/W1968750272","https://openalex.org/W2361465121","https://openalex.org/W2120361252","https://openalex.org/W2166368933"],"abstract_inverted_index":{"There":[0],"are":[1],"several":[2],"ad":[3],"hoc":[4],"routing":[5,18,29,34,160],"algorithms":[6],"that":[7],"utilize":[8],"position":[9,27,61,132],"information":[10],"in":[11,40,65,111],"two":[12],"dimensional":[13],"(2D)":[14],"coordinates":[15],"to":[16,154],"make":[17],"decisions":[19],"at":[20],"each":[21],"node.":[22],"The":[23],"well":[24,142],"known":[25],"2D":[26,67,113],"based":[28,133,139],"algorithm,":[30,140],"greedy":[31],"perimeter":[32],"stateless":[33],"(GPSR)":[35],"does":[36],"not":[37],"function":[38],"correctly":[39],"three":[41],"dimensions":[42],"(3D).":[43],"We":[44,75,93,124,150],"designed":[45],"MLAR":[46,59,80,104],"(multipath":[47],"location":[48],"aided":[49,57],"routing),":[50],"a":[51,117,126,130,136],"multipath":[52,131,137],"variant":[53],"of":[54,102,119,129],"LAR":[55],"(location":[56],"routing).":[58],"is":[60],"based,":[62],"works":[63],"efficiently":[64],"both":[66,112,145],"and":[68,70,78,85,90,95,100,109,114,121,159],"3D":[69,115,156],"uses":[71],"alternate":[72],"path":[73,148],"routing.":[74],"have":[76],"implemented":[77],"validated":[79],"through":[81],"simulations":[82],"using":[83],"ns-2":[84,153],"studied":[86],"its":[87],"efficiency,":[88],"scalability":[89],"other":[91],"properties.":[92],"evaluated":[94],"compared":[96],"the":[97],"relative":[98],"performance":[99],"benefits":[101],"our":[103],"approach":[105],"versus":[106],"LAR,":[107],"AODV":[108],"AOMDV":[110],"for":[116],"range":[118],"traffic":[120],"mobility":[122,157],"scenarios.":[123],"present":[125],"direct":[127],"comparison":[128],"algorithm":[134],"with":[135,144],"non-position":[138],"as":[141,143],"their":[146],"single":[147],"versions.":[149],"also":[151],"extended":[152],"support":[155],"models":[158],"protocols":[161]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}