{"id":"https://openalex.org/W2068514809","doi":"https://doi.org/10.1109/comsnets.2010.5431989","title":"Zone based ant colony routing in mobile ad-hoc network","display_name":"Zone based ant colony routing in mobile ad-hoc network","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2068514809","doi":"https://doi.org/10.1109/comsnets.2010.5431989","mag":"2068514809"},"language":"en","primary_location":{"id":"doi:10.1109/comsnets.2010.5431989","is_oa":false,"landing_page_url":"https://doi.org/10.1109/comsnets.2010.5431989","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","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/A5113627493","display_name":"Maumita Bandyopadhyay","orcid":null},"institutions":[{"id":"https://openalex.org/I170979836","display_name":"Jadavpur University","ror":"https://ror.org/02af4h012","country_code":"IN","type":"education","lineage":["https://openalex.org/I170979836"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Maumita Bandyopadhyay","raw_affiliation_strings":["Department of Information Technology, Jadavpur University, Kolkata, India","Dept of Information Technology. Jadavpur University. Salt Lake Campus., Block-LB, Plot-8, sector-III, Kolkata-700098, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technology, Jadavpur University, Kolkata, India","institution_ids":["https://openalex.org/I170979836"]},{"raw_affiliation_string":"Dept of Information Technology. Jadavpur University. Salt Lake Campus., Block-LB, Plot-8, sector-III, Kolkata-700098, India","institution_ids":["https://openalex.org/I170979836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042877131","display_name":"Parama Bhaumik","orcid":"https://orcid.org/0000-0003-2501-0558"},"institutions":[{"id":"https://openalex.org/I170979836","display_name":"Jadavpur University","ror":"https://ror.org/02af4h012","country_code":"IN","type":"education","lineage":["https://openalex.org/I170979836"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Parama Bhaumik","raw_affiliation_strings":["Department of Information Technology, Jadavpur University, Kolkata, India","Dept of Information Technology. Jadavpur University. Salt Lake Campus., Block-LB, Plot-8, sector-III, Kolkata-700098, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technology, Jadavpur University, Kolkata, India","institution_ids":["https://openalex.org/I170979836"]},{"raw_affiliation_string":"Dept of Information Technology. Jadavpur University. Salt Lake Campus., Block-LB, Plot-8, sector-III, Kolkata-700098, India","institution_ids":["https://openalex.org/I170979836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.3557,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.92485729,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"51","issue":null,"first_page":"1","last_page":"10"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9995999932289124,"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.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7215600609779358},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.625512957572937},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6207329630851746},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6031153202056885},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.5344013571739197},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.48714134097099304},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.4493827223777771},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4270618259906769},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.40273159742355347},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.384170264005661},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3351566195487976},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14258772134780884},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.12771761417388916},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1058235764503479},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.05950722098350525}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7215600609779358},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.625512957572937},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6207329630851746},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6031153202056885},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.5344013571739197},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.48714134097099304},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.4493827223777771},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4270618259906769},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.40273159742355347},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.384170264005661},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3351566195487976},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14258772134780884},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12771761417388916},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1058235764503479},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.05950722098350525},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/comsnets.2010.5431989","is_oa":false,"landing_page_url":"https://doi.org/10.1109/comsnets.2010.5431989","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5099999904632568,"display_name":"Zero hunger","id":"https://metadata.un.org/sdg/2"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W198155944","https://openalex.org/W286303758","https://openalex.org/W1542237099","https://openalex.org/W1924659741","https://openalex.org/W2012987308","https://openalex.org/W2043033601","https://openalex.org/W2072624689","https://openalex.org/W2097151853","https://openalex.org/W2116666750","https://openalex.org/W2117900631","https://openalex.org/W2126518342","https://openalex.org/W2132482054","https://openalex.org/W2148269826","https://openalex.org/W2156028043","https://openalex.org/W2980357062","https://openalex.org/W4249190260","https://openalex.org/W6640238551","https://openalex.org/W6641644358","https://openalex.org/W6679956374"],"related_works":["https://openalex.org/W2353880500","https://openalex.org/W2553274123","https://openalex.org/W4283826969","https://openalex.org/W2620451430","https://openalex.org/W4312197921","https://openalex.org/W2163375631","https://openalex.org/W2542556239","https://openalex.org/W2767761285","https://openalex.org/W2619478018","https://openalex.org/W2132140482"],"abstract_inverted_index":{"Ant":[0,271],"colony":[1,117,173,301,315],"optimization":[2,11,22,118],"(ACO)":[3],"is":[4,23,38,102,136,204,237,254],"a":[5,158,161,257],"stochastic":[6],"approach":[7,273,278],"for":[8,47,223,261],"solving":[9],"combinatorial":[10],"problems":[12],"like":[13,87],"routing":[14,36,48,74,110,120,259,277,302],"in":[15,51,69,98,125,234,317],"computer":[16],"networks.":[17,54],"The":[18,131],"idea":[19],"of":[20,30,43,49,133,140,209,245,270,288],"this":[21,165,187],"based":[24,35,73,114,171,232,276,313],"on":[25,40,115],"the":[26,31,41,56,67,91,95,108,128,137,149,153,183,189,200,207,214,268,293],"food":[27],"accumulation":[28],"methodology":[29],"ant":[32,116,300,314],"community.":[33],"Zone":[34,170,231,275,298],"algorithms":[37,75,111,135,316],"build":[39],"concept":[42,269],"individual":[44],"node's":[45],"position":[46,58],"packets":[50],"mobile":[52,262,319],"ad-hoc":[53],"Here":[55,163],"nodes'":[57],"can":[59],"be":[60,94,146],"further":[61],"utilized":[62],"to":[63,81,85,104,127,145,160,178,196,206,240,281,291],"discover":[64],"routes":[65,154],"by":[66,266],"Ants":[68],"optimized":[70],"way.":[71],"Position":[72],"(POSANT)":[76],"had":[77],"some":[78],"significant":[79],"loopholes":[80],"find":[82,105,119,179],"route":[83,92,181,224,307],"(source":[84],"destination)":[86],"it":[88,101,236,253],"never":[89],"guarantees":[90],"would":[93],"shortest":[96,129,180,250,283],"one,":[97],"cases":[99],"while":[100,248],"able":[103],"it.":[106],"On":[107],"contrary,":[109],"which":[112,176],"are":[113,123,155],"paths":[121],"that":[122,143,297],"close":[124],"length":[126],"paths.":[130],"drawback":[132],"these":[134],"large":[138],"number":[139,287],"control":[141,289],"messages":[142,290],"needs":[144],"sent":[147],"or":[148,191],"long":[150],"delay":[151],"before":[152],"established":[156],"from":[157],"source":[159,190],"destination.":[162],"In":[164],"paper":[166],"we":[167],"have":[168],"used":[169],"ANT":[172],"using":[174,182,279],"Clustering":[175],"assures":[177],"DIR":[184],"principle":[185],"(In":[186],"principle,":[188],"intermediate":[192],"node":[193,201,247],"transmits":[194],"message":[195],"several":[197],"neighbors":[198],"and":[199,226,274],"whose":[202],"direction":[203,208],"closest":[205],"destination":[210],"gets":[211],"selected":[212],"as":[213],"next":[215],"hop":[216],"forwarding":[217],"node.)":[218],"together":[219],"with":[220,285],"minimum":[221],"overhead":[222,309],"discovery":[225],"mobility":[227],"management.":[228],"Unlike":[229],"other":[230,311],"approach,":[233],"clustering":[235,280],"not":[238],"required":[239],"consider":[241],"zone":[242,312],"related":[243],"information":[244],"each":[246],"finding":[249],"path.":[251],"Here,":[252],"being":[255],"proposed":[256],"new":[258],"algorithm":[260,303],"ad":[263],"hoc":[264],"network":[265],"combining":[267],"Colony":[272],"get":[282],"path":[284],"small":[286],"minimize":[292],"overhead.":[294],"Simulations":[295],"show":[296],"Based":[299],"has":[304],"relatively":[305],"short":[306],"establishment":[308],"than":[310],"highly":[318],"scenarios.":[320]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"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":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}