{"id":"https://openalex.org/W2109587885","doi":"https://doi.org/10.1109/icccn.2009.5235361","title":"A Low-Cost Anonymous Routing Protocol in MANETs","display_name":"A Low-Cost Anonymous Routing Protocol in MANETs","publication_year":2009,"publication_date":"2009-08-01","ids":{"openalex":"https://openalex.org/W2109587885","doi":"https://doi.org/10.1109/icccn.2009.5235361","mag":"2109587885"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2009.5235361","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2009.5235361","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Proceedings of 18th International Conference on Computer Communications and Networks","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/A5109009885","display_name":"Lianyu Zhao","orcid":null},"institutions":[{"id":"https://openalex.org/I78715868","display_name":"University of Arkansas at Fayetteville","ror":"https://ror.org/05jbt9m15","country_code":"US","type":"education","lineage":["https://openalex.org/I78715868"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lianyu Zhao","raw_affiliation_strings":["Department of Computer Science and Computer Engineering, University of Arkansas, Fayetteville, AR, USA","[Dept. of Comput. Sci. & Comput. Eng., Univ. of Arkansas, Fayetteville, AR, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Computer Engineering, University of Arkansas, Fayetteville, AR, USA","institution_ids":["https://openalex.org/I78715868"]},{"raw_affiliation_string":"[Dept. of Comput. Sci. & Comput. Eng., Univ. of Arkansas, Fayetteville, AR, USA]","institution_ids":["https://openalex.org/I78715868"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064217355","display_name":"Haiying Shen","orcid":"https://orcid.org/0000-0002-7681-6255"},"institutions":[{"id":"https://openalex.org/I78715868","display_name":"University of Arkansas at Fayetteville","ror":"https://ror.org/05jbt9m15","country_code":"US","type":"education","lineage":["https://openalex.org/I78715868"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Haiying Shen","raw_affiliation_strings":["Department of Computer Science and Computer Engineering, University of Arkansas, Fayetteville, AR, USA","[Dept. of Comput. Sci. & Comput. Eng., Univ. of Arkansas, Fayetteville, AR, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Computer Engineering, University of Arkansas, Fayetteville, AR, USA","institution_ids":["https://openalex.org/I78715868"]},{"raw_affiliation_string":"[Dept. of Comput. Sci. & Comput. Eng., Univ. of Arkansas, Fayetteville, AR, USA]","institution_ids":["https://openalex.org/I78715868"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109009885"],"corresponding_institution_ids":["https://openalex.org/I78715868"],"apc_list":null,"apc_paid":null,"fwci":0.3428,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.63356654,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"8","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998000264167786,"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.9998000264167786,"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.9977999925613403,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9972000122070312,"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.791638970375061},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7876925468444824},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.6968610286712646},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.6754792928695679},{"id":"https://openalex.org/keywords/zone-routing-protocol","display_name":"Zone Routing Protocol","score":0.6280806660652161},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6060415506362915},{"id":"https://openalex.org/keywords/wireless-routing-protocol","display_name":"Wireless Routing Protocol","score":0.583942174911499},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.5645542740821838},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5620360970497131},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.5614583492279053},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4839094579219818},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.4717448651790619},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4117574989795685},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.2799674868583679}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.791638970375061},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7876925468444824},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.6968610286712646},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.6754792928695679},{"id":"https://openalex.org/C189884158","wikidata":"https://www.wikidata.org/wiki/Q8073926","display_name":"Zone Routing Protocol","level":5,"score":0.6280806660652161},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6060415506362915},{"id":"https://openalex.org/C47318570","wikidata":"https://www.wikidata.org/wiki/Q8026863","display_name":"Wireless Routing Protocol","level":4,"score":0.583942174911499},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.5645542740821838},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5620360970497131},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.5614583492279053},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4839094579219818},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.4717448651790619},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4117574989795685},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.2799674868583679}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccn.2009.5235361","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2009.5235361","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Proceedings of 18th International Conference on Computer Communications and Networks","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":30,"referenced_works":["https://openalex.org/W1485030181","https://openalex.org/W1880384800","https://openalex.org/W1994799172","https://openalex.org/W2037797252","https://openalex.org/W2052567196","https://openalex.org/W2072463110","https://openalex.org/W2091522963","https://openalex.org/W2098736052","https://openalex.org/W2103369002","https://openalex.org/W2108459510","https://openalex.org/W2109501682","https://openalex.org/W2124597473","https://openalex.org/W2124651399","https://openalex.org/W2126818112","https://openalex.org/W2140470776","https://openalex.org/W2157283388","https://openalex.org/W2157457404","https://openalex.org/W2158467152","https://openalex.org/W2159024459","https://openalex.org/W2165199484","https://openalex.org/W2165861038","https://openalex.org/W2168812739","https://openalex.org/W2174056151","https://openalex.org/W2290650232","https://openalex.org/W4236944153","https://openalex.org/W4237279298","https://openalex.org/W6628955636","https://openalex.org/W6659835352","https://openalex.org/W6678367003","https://openalex.org/W6684269364"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W4253436398","https://openalex.org/W2068473861","https://openalex.org/W1538003338","https://openalex.org/W2364686261","https://openalex.org/W2556128816","https://openalex.org/W3125210154","https://openalex.org/W2351878639","https://openalex.org/W3046124320","https://openalex.org/W2607223747"],"abstract_inverted_index":{"With":[0],"the":[1,57,93],"wide":[2],"use":[3],"of":[4,92,95],"mobile":[5,8],"devices":[6],"in":[7],"ad":[9],"hoc":[10],"networks,":[11],"maintaining":[12],"anonymity":[13],"is":[14],"becoming":[15],"an":[16],"increasingly":[17],"important":[18],"issue.":[19],"Existing":[20],"routing":[21,44,52,64,77,86,110],"algorithms":[22],"either":[23],"rely":[24],"on":[25],"hop-by-hop":[26],"encryption":[27],"or":[28],"local":[29],"broadcasting":[30],"for":[31,112],"anonymous":[32,43],"routing,":[33],"which":[34,46],"lead":[35],"to":[36,62,79,98],"high":[37],"overhead.":[38],"We":[39],"propose":[40],"a":[41],"low-cost":[42],"algorithm,":[45],"can":[47],"provide":[48],"both":[49],"source/destination":[50],"and":[51,66],"anonymity.":[53],"It":[54],"dynamically":[55],"divides":[56],"network":[58],"into":[59],"hierarchical":[60],"zones":[61],"obscure":[63],"path":[65,78],"randomly":[67],"chooses":[68],"nodes":[69],"as":[70],"intermediate":[71],"relay":[72],"nodes.":[73],"Therefore":[74],"it":[75],"splits":[76],"multiple":[80],"steps":[81],"that":[82,105],"contains":[83],"no":[84],"specific":[85],"pattern.":[87],"Furthermore,":[88],"we":[89],"present":[90],"analysis":[91],"ability":[94],"our":[96,106],"algorithm":[97,107],"withstand":[99],"certain":[100],"attacks.":[101],"Experiment":[102],"results":[103],"show":[104],"trades":[108],"some":[109],"efficiency":[111],"anonymity,":[113],"but":[114],"gains":[115],"better":[116],"delivery":[117],"rate":[118],"than":[119],"GPSR":[120],"under":[121],"short":[122],"transmission":[123],"range.":[124]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"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"}