{"id":"https://openalex.org/W2080833835","doi":"https://doi.org/10.1145/2185216.2185336","title":"Cache based ant colony routing algorithm for mobile ad hoc networks","display_name":"Cache based ant colony routing algorithm for mobile ad hoc networks","publication_year":2011,"publication_date":"2011-12-18","ids":{"openalex":"https://openalex.org/W2080833835","doi":"https://doi.org/10.1145/2185216.2185336","mag":"2080833835"},"language":"en","primary_location":{"id":"doi:10.1145/2185216.2185336","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2185216.2185336","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief","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/A5110285730","display_name":"Sailesh Sathish","orcid":null},"institutions":[{"id":"https://openalex.org/I141431873","display_name":"Periyar University","ror":"https://ror.org/05crs8s98","country_code":"IN","type":"education","lineage":["https://openalex.org/I141431873"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"S. Sathish","raw_affiliation_strings":["Periyar University, Salem, India"],"affiliations":[{"raw_affiliation_string":"Periyar University, Salem, India","institution_ids":["https://openalex.org/I141431873"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109431109","display_name":"K. Thangavel","orcid":null},"institutions":[{"id":"https://openalex.org/I141431873","display_name":"Periyar University","ror":"https://ror.org/05crs8s98","country_code":"IN","type":"education","lineage":["https://openalex.org/I141431873"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"K. Thangavel","raw_affiliation_strings":["Periyar University, Salem, India"],"affiliations":[{"raw_affiliation_string":"Periyar University, Salem, India","institution_ids":["https://openalex.org/I141431873"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051485406","display_name":"V. Vaidehi","orcid":"https://orcid.org/0000-0002-2293-4934"},"institutions":[{"id":"https://openalex.org/I141431873","display_name":"Periyar University","ror":"https://ror.org/05crs8s98","country_code":"IN","type":"education","lineage":["https://openalex.org/I141431873"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"V. Vaidehi","raw_affiliation_strings":["Periyar University, Salem, India"],"affiliations":[{"raw_affiliation_string":"Periyar University, Salem, India","institution_ids":["https://openalex.org/I141431873"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5110285730"],"corresponding_institution_ids":["https://openalex.org/I141431873"],"apc_list":null,"apc_paid":null,"fwci":0.3501,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.63153158,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"473","last_page":"476"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9983000159263611,"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.998199999332428,"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.8085469007492065},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7537176012992859},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.6816340684890747},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6784700751304626},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5679962635040283},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5580259561538696},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.46744880080223083},{"id":"https://openalex.org/keywords/adaptive-quality-of-service-multi-hop-routing","display_name":"Adaptive quality of service multi-hop routing","score":0.4632244408130646},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.46273359656333923},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4504642188549042},{"id":"https://openalex.org/keywords/wireless-routing-protocol","display_name":"Wireless Routing Protocol","score":0.4154142737388611},{"id":"https://openalex.org/keywords/optimized-link-state-routing-protocol","display_name":"Optimized Link State Routing Protocol","score":0.41322070360183716},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3264980912208557},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3236783742904663},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24155262112617493}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8085469007492065},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7537176012992859},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.6816340684890747},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6784700751304626},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5679962635040283},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5580259561538696},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.46744880080223083},{"id":"https://openalex.org/C32244324","wikidata":"https://www.wikidata.org/wiki/Q4680755","display_name":"Adaptive quality of service multi-hop routing","level":5,"score":0.4632244408130646},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.46273359656333923},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4504642188549042},{"id":"https://openalex.org/C47318570","wikidata":"https://www.wikidata.org/wiki/Q8026863","display_name":"Wireless Routing Protocol","level":4,"score":0.4154142737388611},{"id":"https://openalex.org/C204739117","wikidata":"https://www.wikidata.org/wiki/Q1368373","display_name":"Optimized Link State Routing Protocol","level":4,"score":0.41322070360183716},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3264980912208557},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3236783742904663},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24155262112617493}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2185216.2185336","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2185216.2185336","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6399999856948853,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W148978318","https://openalex.org/W1546727254","https://openalex.org/W1984025008","https://openalex.org/W2030824584","https://openalex.org/W2089670420","https://openalex.org/W2118573797","https://openalex.org/W2153040688","https://openalex.org/W2160739098","https://openalex.org/W2168761858","https://openalex.org/W4239193943"],"related_works":["https://openalex.org/W50672539","https://openalex.org/W2282107067","https://openalex.org/W2430455952","https://openalex.org/W1995089019","https://openalex.org/W11368780","https://openalex.org/W286292322","https://openalex.org/W1968388765","https://openalex.org/W2807323596","https://openalex.org/W2126215413","https://openalex.org/W2099339647"],"abstract_inverted_index":{"Mobile":[0],"adhoc":[1],"networks":[2,90],"are":[3,24],"formed":[4],"dynamically":[5],"without":[6],"any":[7],"infrastructure":[8],"and":[9,48,68,95],"each":[10],"node":[11],"is":[12],"responsible":[13],"for":[14,31,86,91],"routing":[15,85,99],"information":[16],"among":[17],"them.":[18],"Ant":[19],"colony":[20,84],"optimization":[21],"(ACO)":[22],"algorithms":[23],"used":[25],"to":[26,43,52,62],"find":[27],"an":[28],"optimized":[29,60],"solution":[30],"various":[32],"problems.":[33],"The":[34,54],"change":[35],"in":[36],"topology":[37],"makes":[38],"the":[39,59,72],"route":[40,64,67],"from":[41],"source":[42,97],"destination":[44],"as":[45],"dynamic":[46],"fixed":[47],"changes":[49],"with":[50],"respect":[51],"time.":[53],"nature":[55],"of":[56],"network":[57],"requires":[58],"algorithm":[61],"perform":[63],"discovery,":[65],"maintain":[66],"detect":[69],"failure":[70],"along":[71],"path":[73],"between":[74],"two":[75],"nodes.":[76],"This":[77],"paper":[78],"proposes":[79],"a":[80],"cache":[81],"based":[82],"ant":[83],"mobile":[87],"ad":[88],"hoc":[89],"building":[92],"highly":[93],"adaptive":[94],"on-demand":[96],"initiated":[98],"algorithm.":[100]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
