{"id":"https://openalex.org/W1965915535","doi":"https://doi.org/10.1093/comjnl/bxn007","title":"Ant-based Energy-aware Disjoint Multipath Routing Algorithm for MANETs","display_name":"Ant-based Energy-aware Disjoint Multipath Routing Algorithm for MANETs","publication_year":2008,"publication_date":"2008-02-08","ids":{"openalex":"https://openalex.org/W1965915535","doi":"https://doi.org/10.1093/comjnl/bxn007","mag":"1965915535"},"language":"en","primary_location":{"id":"doi:10.1093/comjnl/bxn007","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxn007","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-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/A5100381605","display_name":"Zhilin Wu","orcid":"https://orcid.org/0000-0003-0899-628X"},"institutions":[{"id":"https://openalex.org/I31683504","display_name":"Beijing Forestry University","ror":"https://ror.org/04xv2pc41","country_code":"CN","type":"education","lineage":["https://openalex.org/I1327237609","https://openalex.org/I31683504","https://openalex.org/I4210127390"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Z.-Y. Wu","raw_affiliation_strings":["Department of Computer Science and Technology, College of Information Science and Technology, Beijing Forestry University, Beijing 100083, PR China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, College of Information Science and Technology, Beijing Forestry University, Beijing 100083, PR China","institution_ids":["https://openalex.org/I31683504"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101122265","display_name":"Haijing Song","orcid":null},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"H.-T. Song","raw_affiliation_strings":["School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, PR China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, PR China","institution_ids":["https://openalex.org/I125839683"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100381605"],"corresponding_institution_ids":["https://openalex.org/I31683504"],"apc_list":{"value":2635,"currency":"GBP","value_usd":3232},"apc_paid":null,"fwci":1.0998,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.79483662,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"53","issue":"2","first_page":"166","last_page":"176"},"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/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9984999895095825,"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.8098461627960205},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.7905685305595398},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5873575210571289},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5856298208236694},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.5346355438232422},{"id":"https://openalex.org/keywords/swarm-intelligence","display_name":"Swarm intelligence","score":0.5277861952781677},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5071914196014404},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.4928884506225586},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4793458878993988},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4626193344593048},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4545251131057739},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4505968689918518},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.39616331458091736},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36233705282211304},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.1527579128742218},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.06471574306488037}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8098461627960205},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.7905685305595398},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5873575210571289},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5856298208236694},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.5346355438232422},{"id":"https://openalex.org/C119487961","wikidata":"https://www.wikidata.org/wiki/Q863960","display_name":"Swarm intelligence","level":3,"score":0.5277861952781677},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5071914196014404},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.4928884506225586},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4793458878993988},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4626193344593048},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4545251131057739},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4505968689918518},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.39616331458091736},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36233705282211304},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.1527579128742218},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.06471574306488037},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1093/comjnl/bxn007","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxn007","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8899999856948853,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W148978318","https://openalex.org/W286303758","https://openalex.org/W1513792956","https://openalex.org/W1572829022","https://openalex.org/W1587263632","https://openalex.org/W1664011265","https://openalex.org/W2014550373","https://openalex.org/W2048910294","https://openalex.org/W2104915079","https://openalex.org/W2105962684","https://openalex.org/W2110690569","https://openalex.org/W2111317726","https://openalex.org/W2114775386","https://openalex.org/W2121172963","https://openalex.org/W2140283362","https://openalex.org/W2160739098","https://openalex.org/W2533642963","https://openalex.org/W3217029243"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W3127002380","https://openalex.org/W2068473861","https://openalex.org/W757657516","https://openalex.org/W2351878639","https://openalex.org/W2539097916","https://openalex.org/W2136173851","https://openalex.org/W2555559350","https://openalex.org/W2607223747","https://openalex.org/W2361465121"],"abstract_inverted_index":{"Ant-based":[0],"routing":[1,20,50,63,88,93],"protocols":[2],"for":[3],"mobile":[4],"ad":[5],"hoc":[6],"networks":[7],"(MANETs)":[8],"have":[9],"been":[10],"widely":[11],"explored,":[12],"but":[13],"most":[14],"of":[15,101],"them":[16],"are":[17],"essentially":[18],"single-path":[19],"methods":[21],"that":[22,98],"tend":[23],"to":[24,38,51],"impose":[25],"a":[26,91],"heavy":[27],"burden":[28],"on":[29,71,76],"the":[30,33,77,99],"hosts":[31],"along":[32],"shortest":[34],"path":[35],"from":[36],"source":[37],"destination.":[39],"In":[40],"this":[41],"paper,":[42],"we":[43],"combine":[44],"swarm":[45,72],"intelligence":[46,73],"and":[47,74],"node-disjoint":[48,87],"multipath":[49,62],"alleviate":[52],"these":[53],"problems.":[54],"A":[55],"novel":[56],"approach":[57],"called":[58],"ant-based":[59],"energy-aware":[60,86],"disjoint":[61],"algorithm":[64],"(AEADMRA)":[65],"is":[66,69],"proposed.":[67],"AEADMRA":[68,82,102],"based":[70],"especially":[75],"ant":[78],"colony-based":[79],"meta":[80],"heuristic.":[81],"can":[83],"discover":[84],"multiple":[85],"paths":[89],"with":[90],"low":[92],"overhead.":[94],"Simulation":[95],"results":[96],"indicate":[97],"performance":[100],"outperforms":[103],"other":[104],"pertinent":[105],"algorithms.":[106]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}