{"id":"https://openalex.org/W1975321841","doi":"https://doi.org/10.1109/cisim.2010.5643654","title":"LAR<sup>2</sup>P: A Location Aided Reactive Routing Protocol for near-optimal route discovery in MANET","display_name":"LAR<sup>2</sup>P: A Location Aided Reactive Routing Protocol for near-optimal route discovery in MANET","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W1975321841","doi":"https://doi.org/10.1109/cisim.2010.5643654","mag":"1975321841"},"language":"en","primary_location":{"id":"doi:10.1109/cisim.2010.5643654","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cisim.2010.5643654","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 International Conference on Computer Information Systems and Industrial Management Applications (CISIM)","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/A5001172312","display_name":"Nabendu Chaki","orcid":"https://orcid.org/0000-0003-3242-680X"},"institutions":[{"id":"https://openalex.org/I106542073","display_name":"University of Calcutta","ror":"https://ror.org/01e7v7w47","country_code":"IN","type":"education","lineage":["https://openalex.org/I106542073"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Nabendu Chaki","raw_affiliation_strings":["University of Calcutta, India","University of Calcutta, , India"],"affiliations":[{"raw_affiliation_string":"University of Calcutta, India","institution_ids":["https://openalex.org/I106542073"]},{"raw_affiliation_string":"University of Calcutta, , India","institution_ids":["https://openalex.org/I106542073"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5001172312"],"corresponding_institution_ids":["https://openalex.org/I106542073"],"apc_list":null,"apc_paid":null,"fwci":0.3561,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.59972423,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"6","issue":null,"first_page":"259","last_page":"264"},"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9970999956130981,"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.996999979019165,"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-network","display_name":"Computer network","score":0.7528188228607178},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7321795225143433},{"id":"https://openalex.org/keywords/flooding","display_name":"Flooding (psychology)","score":0.6145713329315186},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.5799164772033691},{"id":"https://openalex.org/keywords/zone-routing-protocol","display_name":"Zone Routing Protocol","score":0.5239686965942383},{"id":"https://openalex.org/keywords/optimized-link-state-routing-protocol","display_name":"Optimized Link State Routing Protocol","score":0.517943799495697},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.517145574092865},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5062128901481628},{"id":"https://openalex.org/keywords/routing-information-protocol","display_name":"Routing Information Protocol","score":0.49381789565086365},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.45448848605155945},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4527941942214966},{"id":"https://openalex.org/keywords/wireless-routing-protocol","display_name":"Wireless Routing Protocol","score":0.4128260314464569},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3229564428329468},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.0742509663105011}],"concepts":[{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7528188228607178},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7321795225143433},{"id":"https://openalex.org/C186594467","wikidata":"https://www.wikidata.org/wiki/Q1429176","display_name":"Flooding (psychology)","level":2,"score":0.6145713329315186},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.5799164772033691},{"id":"https://openalex.org/C189884158","wikidata":"https://www.wikidata.org/wiki/Q8073926","display_name":"Zone Routing Protocol","level":5,"score":0.5239686965942383},{"id":"https://openalex.org/C204739117","wikidata":"https://www.wikidata.org/wiki/Q1368373","display_name":"Optimized Link State Routing Protocol","level":4,"score":0.517943799495697},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.517145574092865},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5062128901481628},{"id":"https://openalex.org/C7573999","wikidata":"https://www.wikidata.org/wiki/Q207580","display_name":"Routing Information Protocol","level":5,"score":0.49381789565086365},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.45448848605155945},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4527941942214966},{"id":"https://openalex.org/C47318570","wikidata":"https://www.wikidata.org/wiki/Q8026863","display_name":"Wireless Routing Protocol","level":4,"score":0.4128260314464569},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3229564428329468},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0742509663105011},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cisim.2010.5643654","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cisim.2010.5643654","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 International Conference on Computer Information Systems and Industrial Management Applications (CISIM)","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":15,"referenced_works":["https://openalex.org/W1481709731","https://openalex.org/W1969057198","https://openalex.org/W2054175454","https://openalex.org/W2055654205","https://openalex.org/W2099574482","https://openalex.org/W2106747453","https://openalex.org/W2124651399","https://openalex.org/W2136805167","https://openalex.org/W2157457404","https://openalex.org/W2162685648","https://openalex.org/W3045069956","https://openalex.org/W3102722245","https://openalex.org/W4236944153","https://openalex.org/W4243218172","https://openalex.org/W6780784976"],"related_works":["https://openalex.org/W2055056424","https://openalex.org/W2144907052","https://openalex.org/W2151422282","https://openalex.org/W2127462695","https://openalex.org/W2122558727","https://openalex.org/W2390016635","https://openalex.org/W2113081707","https://openalex.org/W2884568852","https://openalex.org/W2172271487","https://openalex.org/W2019368892"],"abstract_inverted_index":{"The":[0],"problem":[1],"being":[2],"addressed":[3],"in":[4,26,32,61,103],"this":[5,107],"work":[6],"is":[7,101],"to":[8,81,134],"design":[9],"a":[10,27,33,46,110],"new,":[11],"location-aided,":[12],"robust,":[13,115],"reactive":[14,76,89,116,136],"routing":[15,66,79,117],"protocol":[16,118],"for":[17,68,75],"discovery":[18],"of":[19,63,87,95,129],"the":[20,40,43,64,88,93,104,124],"shortest":[21],"route":[22,25,99],"or":[23,56,77,142],"near-shortest":[24],"mobile,":[28],"ad-hoc":[29],"network":[30],"with":[31],"small":[34],"set-up":[35,83,125],"period":[36],"by":[37,54],"considering":[38],"only":[39],"nodes":[41],"towards":[42],"destination":[44],"from":[45,92],"give":[47],"source":[48],"node.":[49],"Shortest":[50],"path":[51],"finding":[52],"algorithm":[53],"Dijkstra":[55],"Bellman-Ford":[57],"has":[58,119],"been":[59,120],"used":[60],"many":[62],"existing":[65],"protocols":[67,90,137],"MANET.":[69],"Such":[70],"approaches":[71],"have":[72],"limited":[73],"usage":[74],"on-demand":[78],"due":[80],"high":[82],"time.":[84],"Again,":[85],"most":[86],"suffer":[91],"drawback":[94],"flooding":[96],"as":[97,132],"no":[98],"table":[100],"maintained":[102],"nodes.":[105],"In":[106],"paper,":[108],"LAR2P":[109],"new":[111],"flooding-free,":[112],"location":[113],"aided,":[114],"proposed":[121],"that":[122],"reduces":[123],"time":[126],"and":[127],"number":[128],"control":[130],"messages":[131],"compared":[133],"other":[135],"like":[138],"ORRP,":[139],"DSR,":[140],"LAR":[141],"LBRP.":[143]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}