{"id":"https://openalex.org/W4386446971","doi":"https://doi.org/10.1109/iccc57788.2023.10233461","title":"A Maximum Flow Routing Algorithm for Multi-Unmanned Surface Vessel Networks","display_name":"A Maximum Flow Routing Algorithm for Multi-Unmanned Surface Vessel Networks","publication_year":2023,"publication_date":"2023-08-10","ids":{"openalex":"https://openalex.org/W4386446971","doi":"https://doi.org/10.1109/iccc57788.2023.10233461"},"language":"en","primary_location":{"id":"doi:10.1109/iccc57788.2023.10233461","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccc57788.2023.10233461","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE/CIC International Conference on Communications in China (ICCC)","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/A5102921879","display_name":"Haocheng Wang","orcid":"https://orcid.org/0000-0001-8078-9475"},"institutions":[{"id":"https://openalex.org/I43313876","display_name":"Dalian Maritime University","ror":"https://ror.org/002b7nr53","country_code":"CN","type":"education","lineage":["https://openalex.org/I43313876"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Haocheng Wang","raw_affiliation_strings":["Dalian Maritime University,School of Information Science and Technology,Dalian,China","School of Information Science and Technology, Dalian Maritime University, Dalian, China"],"affiliations":[{"raw_affiliation_string":"Dalian Maritime University,School of Information Science and Technology,Dalian,China","institution_ids":["https://openalex.org/I43313876"]},{"raw_affiliation_string":"School of Information Science and Technology, Dalian Maritime University, Dalian, China","institution_ids":["https://openalex.org/I43313876"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088968438","display_name":"Bin Lin","orcid":"https://orcid.org/0000-0002-6125-9839"},"institutions":[{"id":"https://openalex.org/I43313876","display_name":"Dalian Maritime University","ror":"https://ror.org/002b7nr53","country_code":"CN","type":"education","lineage":["https://openalex.org/I43313876"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bin Lin","raw_affiliation_strings":["Dalian Maritime University,School of Information Science and Technology,Dalian,China","School of Information Science and Technology, Dalian Maritime University, Dalian, China"],"affiliations":[{"raw_affiliation_string":"Dalian Maritime University,School of Information Science and Technology,Dalian,China","institution_ids":["https://openalex.org/I43313876"]},{"raw_affiliation_string":"School of Information Science and Technology, Dalian Maritime University, Dalian, China","institution_ids":["https://openalex.org/I43313876"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061150224","display_name":"Lin Cai","orcid":"https://orcid.org/0000-0002-1093-4865"},"institutions":[{"id":"https://openalex.org/I180949307","display_name":"Illinois Institute of Technology","ror":"https://ror.org/037t3ry66","country_code":"US","type":"education","lineage":["https://openalex.org/I180949307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lin X. Cai","raw_affiliation_strings":["Illinois Institute of Technology,Department of Electrical and Computer Engineering,Chicago,USA","Department of Electrical and Computer Engineering, Illinois Institute of Technology, Chicago, USA"],"affiliations":[{"raw_affiliation_string":"Illinois Institute of Technology,Department of Electrical and Computer Engineering,Chicago,USA","institution_ids":["https://openalex.org/I180949307"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Illinois Institute of Technology, Chicago, USA","institution_ids":["https://openalex.org/I180949307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101761581","display_name":"Xiaoling Han","orcid":"https://orcid.org/0009-0000-9618-9626"},"institutions":[{"id":"https://openalex.org/I43313876","display_name":"Dalian Maritime University","ror":"https://ror.org/002b7nr53","country_code":"CN","type":"education","lineage":["https://openalex.org/I43313876"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaoling Han","raw_affiliation_strings":["Dalian Maritime University,School of Information Science and Technology,Dalian,China","School of Information Science and Technology, Dalian Maritime University, Dalian, China"],"affiliations":[{"raw_affiliation_string":"Dalian Maritime University,School of Information Science and Technology,Dalian,China","institution_ids":["https://openalex.org/I43313876"]},{"raw_affiliation_string":"School of Information Science and Technology, Dalian Maritime University, Dalian, China","institution_ids":["https://openalex.org/I43313876"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5102921879"],"corresponding_institution_ids":["https://openalex.org/I43313876"],"apc_list":null,"apc_paid":null,"fwci":0.6027,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.68466476,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9993000030517578,"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":0.9993000030517578,"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.9980000257492065,"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/T10714","display_name":"Software-Defined Networks and 5G","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"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.8291846513748169},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7122478485107422},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5322536826133728},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5059394240379333},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.4916699528694153},{"id":"https://openalex.org/keywords/sink","display_name":"Sink (geography)","score":0.48052820563316345},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.46461355686187744},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4630207419395447},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45240622758865356},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4482934772968292},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37519371509552},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.20418068766593933},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.1997423768043518},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18890368938446045},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15448075532913208}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.8291846513748169},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7122478485107422},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5322536826133728},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5059394240379333},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.4916699528694153},{"id":"https://openalex.org/C143050476","wikidata":"https://www.wikidata.org/wiki/Q194502","display_name":"Sink (geography)","level":2,"score":0.48052820563316345},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.46461355686187744},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4630207419395447},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45240622758865356},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4482934772968292},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37519371509552},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.20418068766593933},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.1997423768043518},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18890368938446045},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15448075532913208},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccc57788.2023.10233461","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccc57788.2023.10233461","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE/CIC International Conference on Communications in China (ICCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320337504","display_name":"Research and Development","ror":"https://ror.org/027s68j25"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1746637951","https://openalex.org/W2056093707","https://openalex.org/W2104724137","https://openalex.org/W2149342630","https://openalex.org/W2584829278","https://openalex.org/W2921206069","https://openalex.org/W3014094413","https://openalex.org/W3037819556","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W2375873432","https://openalex.org/W4206915070","https://openalex.org/W2531764854","https://openalex.org/W2098682899","https://openalex.org/W3161514703","https://openalex.org/W2141299097","https://openalex.org/W1851375266","https://openalex.org/W2610002854","https://openalex.org/W3141113327","https://openalex.org/W2353784394"],"abstract_inverted_index":{"Based":[0],"on":[1],"Storage":[2],"Time":[3],"Aggregated":[4],"Graph":[5],"(STAG)":[6],"model":[7],"in":[8,19],"time-varying":[9,21],"graph":[10],"theory,":[11],"we":[12],"investigate":[13],"the":[14,36,41,58,66,75,81,86,94],"single-source-single-sink":[15],"maximum":[16,43,89],"flow":[17,44,90],"problem":[18],"a":[20,46],"Ad":[22],"hoc":[23],"network":[24,95],"comprised":[25],"of":[26,38,40,83,85],"multiple":[27],"unmanned":[28],"surface":[29],"vessels":[30],"(USVs).":[31],"In":[32],"order":[33],"to":[34],"optimize":[35],"number":[37,82],"iterations":[39,84],"STAG-based":[42,88],"algorithm,":[45],"new":[47],"method":[48,63,77],"for":[49],"seeking":[50],"an":[51],"augmenting":[52],"path":[53],"is":[54],"proposed":[55,76],"by":[56],"adopting":[57],"Breadth":[59],"First":[60],"Search":[61],"(BFS)":[62],"combined":[64],"with":[65],"redesigning":[67],"routing":[68],"rules.":[69],"The":[70],"experimental":[71],"results":[72],"show":[73],"that,":[74],"can":[78],"effectively":[79],"reduce":[80],"existing":[87],"algorithms,":[91],"thereby":[92],"reducing":[93],"processing":[96],"delay.":[97]},"counts_by_year":[{"year":2025,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}