{"id":"https://openalex.org/W2941048504","doi":"https://doi.org/10.1109/iscid.2018.10110","title":"Solving Network Coding Resource Problem Using Ant Colony Optimization","display_name":"Solving Network Coding Resource Problem Using Ant Colony Optimization","alternate_titles":[],"publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2941048504","doi":"https://doi.org/10.1109/iscid.2018.10110","mag":"2941048504"},"language":"en","primary_location":{"id":"doi:10.1109/iscid.2018.10110","doi":"https://doi.org/10.1109/iscid.2018.10110","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscid.2018.10110","pdf_url":null,"source":{"id":"https://openalex.org/S4306420108","display_name":"International Symposium on Computational Intelligence and Design","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 11th International Symposium on Computational Intelligence and Design (ISCID)","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2941048504"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5100399434","display_name":"Jingyi Li","orcid":"https://orcid.org/0000-0002-3315-1855","observed_orcids":["https://orcid.org/0000-0002-3315-1855","https://orcid.org/0009-0006-3076-875X","https://orcid.org/0009-0005-5269-3720","https://orcid.org/0009-0000-8559-8272","https://orcid.org/0009-0002-9278-2443"]},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Jingyi Li","raw_affiliation_strings":["School of Physics and Mathematics Science, Nanyang Technological University, Singapore City, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Physics and Mathematics Science, Nanyang Technological University, Singapore City, Singapore","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100399434"],"corresponding_institution_ids":["https://openalex.org/I172675005"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"37","last_page":"40"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.7602999806404114,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.7602999806404114,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.06499999761581421,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.054999999701976776,"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/network-coding","display_name":"network coding","score":0.9959999918937683},{"id":"https://openalex.org/keywords/ant-colony-optimization","display_name":"ant colony optimization","score":0.8650000095367432},{"id":"https://openalex.org/keywords/multicast-throughput","display_name":"multicast throughput","score":0.9539999961853027},{"id":"https://openalex.org/keywords/graph-decomposition","display_name":"graph decomposition","score":0.7749999761581421},{"id":"https://openalex.org/keywords/genetic-algorithm-hybridization","display_name":"genetic algorithm hybridization","score":0.621999979019165},{"id":"https://openalex.org/keywords/pheromone-update","display_name":"pheromone updating","score":0.7559999823570251},{"id":"https://openalex.org/keywords/multicast-routing","display_name":"multicast routing","score":0.42800000309944153}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.8371758460998535},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7786155939102173},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7257579565048218},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.7172622084617615},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5617184638977051},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.47004595398902893},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.46073243021965027},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3731837868690491},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34191828966140747},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33830082416534424},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.29997825622558594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16634079813957214},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10719609260559082},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscid.2018.10110","doi":"https://doi.org/10.1109/iscid.2018.10110","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscid.2018.10110","pdf_url":null,"source":{"id":"https://openalex.org/S4306420108","display_name":"International Symposium on Computational Intelligence and Design","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 11th International Symposium on Computational Intelligence and Design (ISCID)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W772835134","https://openalex.org/W1512383952","https://openalex.org/W2002531683","https://openalex.org/W2018476156","https://openalex.org/W2073478661","https://openalex.org/W2103320637","https://openalex.org/W2105831729","https://openalex.org/W2133500866","https://openalex.org/W2143185888","https://openalex.org/W2396774882","https://openalex.org/W4205523767","https://openalex.org/W7100303408"],"related_works":["https://openalex.org/W2013298720","https://openalex.org/W2396774882","https://openalex.org/W2794691895","https://openalex.org/W772835134","https://openalex.org/W2161239093","https://openalex.org/W7100303408","https://openalex.org/W2132110147","https://openalex.org/W2033926405","https://openalex.org/W2081202591"],"abstract_inverted_index":{"The":[0,88,146],"limit":[1],"of":[2,5,37,138,157],"multicast":[3,70],"throughput":[4],"traditional":[6],"routing":[7],"is":[8,73,91],"broken":[9],"by":[10],"network":[11,30,89,158],"coding":[12,31,63,100,107,159],"operations":[13,64],"when":[14],"we":[15,25],"transfer":[16,41],"data":[17,40,69],"information":[18,79],"in":[19,32],"the":[20,33,35,38,48,62,67,120,134],"communication":[21],"networks.":[22],"However,":[23],"if":[24],"assume":[26],"every":[27],"node":[28],"performs":[29],"network,":[34],"efficiency":[36],"whole":[39],"process":[42],"will":[43,51],"be":[44,52],"greatly":[45],"influenced,":[46],"e.g.":[47],"buffering":[49],"resource":[50,160],"heavily":[53],"occupied.":[54],"We":[55,123],"present":[56],"Ant":[57,110,125,139],"Colony":[58,126,140],"Optimization":[59,127,141],"to":[60,82,103,114,142],"minimize":[61],"while":[65],"guarantying":[66],"required":[68],"rate.":[71],"It":[72],"featured":[74],"with":[75,98,129,149],"pheromone":[76],"and":[77,85,132,136,152],"heuristic":[78],"update":[80],"scheme":[81],"exploit":[83],"local":[84],"global":[86],"information.":[87],"graph":[90,97],"decomposed":[92,121],"into":[93],"a":[94],"more":[95],"complex":[96],"all":[99],"possible":[101],"nodes":[102],"function":[104],"separately":[105],"without":[106],"for":[108,154],"simulation.":[109],"groups":[111],"are":[112],"used":[113],"explore":[115],"multiple":[116],"path":[117],"sets":[118],"on":[119],"graph.":[122],"introduce":[124],"together":[128],"Genetic":[130],"Algorithm":[131],"discuss":[133],"probability":[135],"performance":[137],"solve":[143],"this":[144],"problem.":[145,162],"paper":[147],"ends":[148],"main":[150],"conclusions":[151],"recommendations":[153],"further":[155],"study":[156],"minimization":[161]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2941048504","counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2019-05-03T00:00:00"}
