{"id":"https://openalex.org/W2750630260","doi":"https://doi.org/10.1109/snpd.2017.8022736","title":"Routing algorithm based on ant colony optimization for mobile social network","display_name":"Routing algorithm based on ant colony optimization for mobile social network","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2750630260","doi":"https://doi.org/10.1109/snpd.2017.8022736","mag":"2750630260"},"language":"en","primary_location":{"id":"doi:10.1109/snpd.2017.8022736","is_oa":false,"landing_page_url":"https://doi.org/10.1109/snpd.2017.8022736","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","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/A5047152698","display_name":"Yanfei Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I185940356","display_name":"Soochow University","ror":"https://ror.org/05kvm7n82","country_code":"TW","type":"education","lineage":["https://openalex.org/I185940356"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yanfei Wu","raw_affiliation_strings":["School of Computer Science and Technology, Soochow University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Soochow University","institution_ids":["https://openalex.org/I185940356"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053495443","display_name":"Yanqin Zhu","orcid":null},"institutions":[{"id":"https://openalex.org/I185940356","display_name":"Soochow University","ror":"https://ror.org/05kvm7n82","country_code":"TW","type":"education","lineage":["https://openalex.org/I185940356"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yanqin Zhu","raw_affiliation_strings":["School of Computer Science and Technology, Soochow University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Soochow University","institution_ids":["https://openalex.org/I185940356"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022401203","display_name":"Zhe Yang","orcid":"https://orcid.org/0000-0003-4980-0343"},"institutions":[{"id":"https://openalex.org/I185940356","display_name":"Soochow University","ror":"https://ror.org/05kvm7n82","country_code":"TW","type":"education","lineage":["https://openalex.org/I185940356"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Zhe Yang","raw_affiliation_strings":["School of Computer Science and Technology, Soochow University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Soochow University","institution_ids":["https://openalex.org/I185940356"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I185940356"],"apc_list":null,"apc_paid":null,"fwci":0.4496,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.53311203,"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":"297","last_page":"302"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant 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/T11896","display_name":"Opportunistic and Delay-Tolerant 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.9972000122070312,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9947999715805054,"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.8280945420265198},{"id":"https://openalex.org/keywords/mobile-social-network","display_name":"Mobile social network","score":0.7673236131668091},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.742290735244751},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6654939651489258},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6260413527488708},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.5400152802467346},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.519612729549408},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.511667013168335},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.46805045008659363},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.45192664861679077},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.42818087339401245},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.42480039596557617},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.4157659113407135},{"id":"https://openalex.org/keywords/mobile-computing","display_name":"Mobile computing","score":0.27974605560302734},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2185942828655243},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09363150596618652}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8280945420265198},{"id":"https://openalex.org/C2780228002","wikidata":"https://www.wikidata.org/wiki/Q2059727","display_name":"Mobile social network","level":3,"score":0.7673236131668091},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.742290735244751},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6654939651489258},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6260413527488708},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.5400152802467346},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.519612729549408},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.511667013168335},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.46805045008659363},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.45192664861679077},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.42818087339401245},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.42480039596557617},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.4157659113407135},{"id":"https://openalex.org/C144543869","wikidata":"https://www.wikidata.org/wiki/Q2738570","display_name":"Mobile computing","level":2,"score":0.27974605560302734},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2185942828655243},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09363150596618652},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"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/snpd.2017.8022736","is_oa":false,"landing_page_url":"https://doi.org/10.1109/snpd.2017.8022736","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.550000011920929}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W141988118","https://openalex.org/W1572481965","https://openalex.org/W1966073241","https://openalex.org/W1971937094","https://openalex.org/W2010634640","https://openalex.org/W2039368130","https://openalex.org/W2046868922","https://openalex.org/W2056944867","https://openalex.org/W2082542889","https://openalex.org/W2112316694","https://openalex.org/W2125957038","https://openalex.org/W2136420233","https://openalex.org/W2157445816","https://openalex.org/W2170904274","https://openalex.org/W3147414854","https://openalex.org/W4234068324","https://openalex.org/W4242656826","https://openalex.org/W4298154464","https://openalex.org/W6664702507"],"related_works":["https://openalex.org/W2540907302","https://openalex.org/W2430455952","https://openalex.org/W2110333561","https://openalex.org/W2145862009","https://openalex.org/W2098287480","https://openalex.org/W2034296768","https://openalex.org/W2189300248","https://openalex.org/W2007580270","https://openalex.org/W2620451430","https://openalex.org/W1968750272"],"abstract_inverted_index":{"Mobile":[0],"social":[1,13,62,123],"network":[2,10,63,124],"(MSN)":[3],"is":[4,28,64,79,108],"a":[5,131],"type":[6],"of":[7,15,57,77,118,126,147,216],"delay":[8],"tolerant":[9],"explicitly":[11],"considering":[12],"characteristics":[14,125],"the":[16,36,40,55,68,71,75,85,89,93,115,122,145,149,153,158,162,169,213],"terminal":[17],"nodes.":[18,182],"The":[19,51,142,194],"existing":[20],"Ad":[21],"Hoc":[22],"routing":[23,94,134,207],"protocols":[24],"assume":[25],"that":[26,202],"there":[27,78],"at":[29],"least":[30],"one":[31],"complete":[32,81],"communication":[33,82],"path":[34,83,155],"between":[35,84,161],"source":[37,86],"node":[38,73,87,150,163,172],"and":[39,88,191],"target":[41,72,90],"node.":[42,91],"So":[43],"they":[44],"cannot":[45],"be":[46],"applied":[47],"to":[48,53,66,70,104,112,156,167,173,180],"MSN":[49,133,206],"directly.":[50],"key":[52],"solve":[54],"problem":[56],"content":[58],"distribution":[59],"in":[60,74,222],"mobile":[61],"how":[65],"transmit":[67],"data":[69,179,192,199,217],"case":[76],"no":[80],"As":[92],"algorithm":[95,135,143],"based":[96,137],"on":[97,121,138,152,197],"ant":[98,139],"colony":[99,140],"optimization":[100],"has":[101],"great":[102],"ability":[103],"adapt":[105],"it,":[106],"it":[107],"an":[109],"effective":[110,175],"method":[111,146],"deal":[113],"with":[114,204,219],"dynamic":[116],"topologies":[117],"MSN.":[119,223],"Based":[120],"MSN,":[127],"this":[128],"paper":[129],"proposes":[130],"new":[132],"ACOMSN":[136,185,209],"optimization.":[141],"uses":[144],"processing":[148],"information":[151,159,176],"transmission":[154,218],"get":[157],"list":[160],"pairs,":[164],"so":[165],"as":[166],"select":[168],"appropriate":[170],"relay":[171],"provide":[174],"when":[177],"forwarding":[178],"other":[181],"In":[183],"addition,":[184],"designs":[186],"methodologies":[187],"for":[188],"pheromone":[189],"updating":[190],"forwarding.":[193],"simulation":[195],"experiments":[196],"real":[198],"sets":[200],"show":[201],"comparing":[203],"typical":[205],"algorithms,":[208],"can":[210],"effectively":[211],"improve":[212],"critical":[214],"performance":[215],"considerable":[220],"overhead":[221]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}