{"id":"https://openalex.org/W2165290294","doi":"https://doi.org/10.1109/pccc.2004.1395018","title":"Adaptive gossip-based routing algorithm","display_name":"Adaptive gossip-based routing algorithm","publication_year":2005,"publication_date":"2005-02-22","ids":{"openalex":"https://openalex.org/W2165290294","doi":"https://doi.org/10.1109/pccc.2004.1395018","mag":"2165290294"},"language":"en","primary_location":{"id":"doi:10.1109/pccc.2004.1395018","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pccc.2004.1395018","pdf_url":null,"source":{"id":"https://openalex.org/S4363607904","display_name":"IEEE International Conference on Performance, Computing, and Communications, 2004","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Performance, Computing, and Communications, 2004","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/A5110015370","display_name":"Zhongmin Shi","orcid":null},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Zhongmin Shi","raw_affiliation_strings":["School of Computing Science, Simon Fraser University, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computing Science, Simon Fraser University, Canada","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070128994","display_name":"Hong Shen","orcid":"https://orcid.org/0000-0002-3663-6591"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Hong Shen","raw_affiliation_strings":["School of Computing Science, Simon Fraser University, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computing Science, Simon Fraser University, Canada","institution_ids":["https://openalex.org/I18014758"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110015370"],"corresponding_institution_ids":["https://openalex.org/I18014758"],"apc_list":null,"apc_paid":null,"fwci":0.3131,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.65987632,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"323","last_page":"324"},"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.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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9936000108718872,"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/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.7608596086502075},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7292511463165283},{"id":"https://openalex.org/keywords/ad-hoc-on-demand-distance-vector-routing","display_name":"Ad hoc On-Demand Distance Vector Routing","score":0.7054819464683533},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.6777361035346985},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5244439244270325},{"id":"https://openalex.org/keywords/gossip","display_name":"Gossip","score":0.4729330837726593},{"id":"https://openalex.org/keywords/distance-vector-routing-protocol","display_name":"Distance-vector routing protocol","score":0.45184919238090515},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.4253588318824768},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4161386787891388},{"id":"https://openalex.org/keywords/optimized-link-state-routing-protocol","display_name":"Optimized Link State Routing Protocol","score":0.4110194444656372},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3735421299934387},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.37330561876296997},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3497992753982544},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.1901218593120575},{"id":"https://openalex.org/keywords/psychology","display_name":"Psychology","score":0.07308152318000793}],"concepts":[{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.7608596086502075},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7292511463165283},{"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.7054819464683533},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.6777361035346985},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5244439244270325},{"id":"https://openalex.org/C62989814","wikidata":"https://www.wikidata.org/wiki/Q854648","display_name":"Gossip","level":2,"score":0.4729330837726593},{"id":"https://openalex.org/C202385902","wikidata":"https://www.wikidata.org/wiki/Q1229441","display_name":"Distance-vector routing protocol","level":5,"score":0.45184919238090515},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.4253588318824768},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4161386787891388},{"id":"https://openalex.org/C204739117","wikidata":"https://www.wikidata.org/wiki/Q1368373","display_name":"Optimized Link State Routing Protocol","level":4,"score":0.4110194444656372},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3735421299934387},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.37330561876296997},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3497992753982544},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.1901218593120575},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.07308152318000793},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/pccc.2004.1395018","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pccc.2004.1395018","pdf_url":null,"source":{"id":"https://openalex.org/S4363607904","display_name":"IEEE International Conference on Performance, Computing, and Communications, 2004","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Performance, Computing, and Communications, 2004","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":2,"referenced_works":["https://openalex.org/W2164231975","https://openalex.org/W2623293810"],"related_works":["https://openalex.org/W2375399753","https://openalex.org/W2484759826","https://openalex.org/W1914344382","https://openalex.org/W2131129003","https://openalex.org/W1835431256","https://openalex.org/W1570753465","https://openalex.org/W3033344257","https://openalex.org/W2332170041","https://openalex.org/W2181964266","https://openalex.org/W3141209520"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"investigate":[4],"an":[5],"up-to-date":[6],"gossip-based":[7,43],"ad":[8,21,44],"hoc":[9,22,45],"routing":[10,26,37,46],"algorithm":[11],"(AODV+G)":[12],"[Z.":[13],"J.":[14],"Haas,":[15],"et":[16],"al.,":[17],"2002]":[18],"implemented":[19],"in":[20,63],"on-demand":[23],"distance":[24],"vector":[25],"(AODV)":[27],"and":[28,51],"discuss":[29],"its":[30],"weakness":[31],"with":[32,53],"respect":[33],"to":[34],"overall":[35],"network":[36],"performance.":[38],"An":[39],"enhanced":[40],"approach,":[41],"adaptive":[42],"(AGAR),":[47],"is":[48],"introduced,":[49],"simulated":[50],"compared":[52],"AODV+G.":[54],"We":[55],"expect":[56],"that":[57],"AGAR":[58],"would":[59],"outperform":[60],"more":[61],"significantly":[62],"larger":[64],"scaled":[65],"networks.":[66]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}