{"id":"https://openalex.org/W2047846597","doi":"https://doi.org/10.1109/nabic.2009.5393501","title":"MALBACO - a new Multi-Agent Load Balanced Ant Colony Optimization algorithm for MANETs","display_name":"MALBACO - a new Multi-Agent Load Balanced Ant Colony Optimization algorithm for MANETs","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2047846597","doi":"https://doi.org/10.1109/nabic.2009.5393501","mag":"2047846597"},"language":"en","primary_location":{"id":"doi:10.1109/nabic.2009.5393501","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nabic.2009.5393501","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 World Congress on Nature & Biologically Inspired Computing (NaBIC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5044709732","display_name":"Ditipriya Sinha","orcid":"https://orcid.org/0000-0003-3115-4750"},"institutions":[{"id":"https://openalex.org/I4210100231","display_name":"Calcutta Research Group","ror":"https://ror.org/0105syj83","country_code":"IN","type":"other","lineage":["https://openalex.org/I4210100231"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Ditipriya Sinha","raw_affiliation_strings":["Calcutta Institute of Engineering and Management, India","Calcutta Institute of Engg. & Mgmt, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Calcutta Institute of Engineering and Management, India","institution_ids":[]},{"raw_affiliation_string":"Calcutta Institute of Engg. & Mgmt, India","institution_ids":["https://openalex.org/I4210100231"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082851518","display_name":"Rituparna Chaki","orcid":"https://orcid.org/0000-0003-1060-5778"},"institutions":[{"id":"https://openalex.org/I99601430","display_name":"Maulana Abul Kalam Azad University of Technology, West Bengal","ror":"https://ror.org/030tcae29","country_code":"IN","type":"education","lineage":["https://openalex.org/I99601430"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Rituparna Chaki","raw_affiliation_strings":["West Bengal University of Technology, India","West Bengal University of Technology, India#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"West Bengal University of Technology, India","institution_ids":["https://openalex.org/I99601430"]},{"raw_affiliation_string":"West Bengal University of Technology, India#TAB#","institution_ids":["https://openalex.org/I99601430"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8109,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.66574363,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"7","issue":null,"first_page":"861","last_page":"865"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.996999979019165,"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.9945999979972839,"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/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8913575410842896},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.792810320854187},{"id":"https://openalex.org/keywords/mobile-ad-hoc-network","display_name":"Mobile ad hoc network","score":0.5770128965377808},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5631747841835022},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5023117065429688},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4924703538417816},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4665764272212982},{"id":"https://openalex.org/keywords/wireless-ad-hoc-network","display_name":"Wireless ad hoc network","score":0.46436047554016113},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4335479140281677},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.4326302707195282},{"id":"https://openalex.org/keywords/optimized-link-state-routing-protocol","display_name":"Optimized Link State Routing Protocol","score":0.41863495111465454},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3642805218696594},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.33794674277305603},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21386563777923584},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07807320356369019},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.07624197006225586},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.053495973348617554}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8913575410842896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.792810320854187},{"id":"https://openalex.org/C91280400","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Mobile ad hoc network","level":3,"score":0.5770128965377808},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5631747841835022},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5023117065429688},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4924703538417816},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4665764272212982},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.46436047554016113},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4335479140281677},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.4326302707195282},{"id":"https://openalex.org/C204739117","wikidata":"https://www.wikidata.org/wiki/Q1368373","display_name":"Optimized Link State Routing Protocol","level":4,"score":0.41863495111465454},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3642805218696594},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.33794674277305603},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21386563777923584},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07807320356369019},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.07624197006225586},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.053495973348617554},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/nabic.2009.5393501","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nabic.2009.5393501","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 World Congress on Nature & Biologically Inspired Computing (NaBIC)","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":9,"referenced_works":["https://openalex.org/W1573676079","https://openalex.org/W1631888268","https://openalex.org/W1664011265","https://openalex.org/W2118681996","https://openalex.org/W2140283362","https://openalex.org/W2146354236","https://openalex.org/W2160739098","https://openalex.org/W2325468731","https://openalex.org/W4292083457"],"related_works":["https://openalex.org/W2353880500","https://openalex.org/W2553274123","https://openalex.org/W4283826969","https://openalex.org/W2377010080","https://openalex.org/W2749079590","https://openalex.org/W2293776035","https://openalex.org/W1967980825","https://openalex.org/W2049045921","https://openalex.org/W1969392113","https://openalex.org/W2377438927"],"abstract_inverted_index":{"Mobile":[0],"ad":[1],"hoc":[2],"networks":[3],"do":[4],"not":[5],"have":[6],"any":[7],"fixed":[8],"topology.":[9],"Routing":[10],"in":[11,41,71],"such":[12],"network":[13],"is":[14,29,75],"very":[15],"challenging":[16],"and":[17,68],"difficult":[18],"due":[19],"to":[20,35,64,79],"the":[21,24,37,42,65,81,84],"mobility":[22],"of":[23,83],"nodes.":[25],"Ant":[26,55],"colony":[27],"optimization":[28,32],"an":[30],"efficient":[31],"technique":[33],"used":[34],"find":[36],"optimum":[38],"shortest":[39],"route":[40],"adhoc":[43],"network.":[44,72],"This":[45],"paper":[46],"describes":[47],"a":[48],"new":[49],"routing":[50],"algorithm":[51],"for":[52],"MANETs":[53],"using":[54],"Colony":[56],"Optimization":[57],"technique.":[58],"Special":[59],"attention":[60],"has":[61],"been":[62],"given":[63],"load":[66],"balancing":[67],"congestion":[69],"control":[70],"Simulation":[73],"work":[74],"presently":[76],"being":[77],"undertaken":[78],"evaluate":[80],"performance":[82],"model.":[85]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}