{"id":"https://openalex.org/W4389545316","doi":"https://doi.org/10.1109/vtc2023-fall60731.2023.10333664","title":"Finding Node-disjoint Paths Resilient to Channel Failures in Multi-channel Wireless Networks","display_name":"Finding Node-disjoint Paths Resilient to Channel Failures in Multi-channel Wireless Networks","publication_year":2023,"publication_date":"2023-10-10","ids":{"openalex":"https://openalex.org/W4389545316","doi":"https://doi.org/10.1109/vtc2023-fall60731.2023.10333664"},"language":"en","primary_location":{"id":"doi:10.1109/vtc2023-fall60731.2023.10333664","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/vtc2023-fall60731.2023.10333664","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 98th Vehicular Technology Conference (VTC2023-Fall)","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/A5101947926","display_name":"Guangyu Li","orcid":"https://orcid.org/0000-0002-8054-1696"},"institutions":[{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guangyu Li","raw_affiliation_strings":["Nanjing University of Science and Technology,School of Computer Science and Engineering,Nanjing,China","School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanjing University of Science and Technology,School of Computer Science and Engineering,Nanjing,China","institution_ids":["https://openalex.org/I36399199"]},{"raw_affiliation_string":"School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing, China","institution_ids":["https://openalex.org/I36399199"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101535428","display_name":"Lin Chen","orcid":"https://orcid.org/0000-0002-7767-1772"},"institutions":[{"id":"https://openalex.org/I157773358","display_name":"Sun Yat-sen University","ror":"https://ror.org/0064kty71","country_code":"CN","type":"education","lineage":["https://openalex.org/I157773358"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lin Chen","raw_affiliation_strings":["Sun Yat-sen University,School of Computer Science and Engineering,Guangzhou,China","School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sun Yat-sen University,School of Computer Science and Engineering,Guangzhou,China","institution_ids":["https://openalex.org/I157773358"]},{"raw_affiliation_string":"School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China","institution_ids":["https://openalex.org/I157773358"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.21831764,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9987000226974487,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9987000226974487,"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.9987000226974487,"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.9986000061035156,"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.702181339263916},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.6654409170150757},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.6158850193023682},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5963378548622131},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5871002078056335},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5654944181442261},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.540507972240448},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5009324550628662},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4342014491558075},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3311045169830322},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3172345757484436},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31347090005874634},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23302745819091797},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.09490096569061279}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.702181339263916},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.6654409170150757},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.6158850193023682},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5963378548622131},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5871002078056335},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5654944181442261},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.540507972240448},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5009324550628662},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4342014491558075},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3311045169830322},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3172345757484436},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31347090005874634},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23302745819091797},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.09490096569061279},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/vtc2023-fall60731.2023.10333664","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/vtc2023-fall60731.2023.10333664","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 98th Vehicular Technology Conference (VTC2023-Fall)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Climate action","score":0.550000011920929,"id":"https://metadata.un.org/sdg/13"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1865577553","https://openalex.org/W1967565181","https://openalex.org/W2019637647","https://openalex.org/W2038259975","https://openalex.org/W2076850117","https://openalex.org/W2163169902","https://openalex.org/W2171868840","https://openalex.org/W2297903070","https://openalex.org/W2740329872"],"related_works":["https://openalex.org/W2913385138","https://openalex.org/W2543884594","https://openalex.org/W2025050335","https://openalex.org/W1966079129","https://openalex.org/W4234897719","https://openalex.org/W2117839333","https://openalex.org/W1504892637","https://openalex.org/W2099734427","https://openalex.org/W2053393096","https://openalex.org/W3127344537"],"abstract_inverted_index":{"This":[0],"paper":[1],"focuses":[2],"on":[3,93],"the":[4,29,42,71,80,85,89,115,125],"fundamental":[5],"problem":[6,30,75],"of":[7,31,48,70,82,88,120],"finding":[8,32],"disjoint":[9],"paths":[10,35],"that":[11,44],"are":[12,53],"robust":[13],"and":[14,27,84,117],"resilient":[15,36,72],"against":[16,124],"channel":[17,39],"instability":[18],"while":[19],"achieving":[20],"optimal":[21],"or":[22],"near-optimal":[23],"performance.":[24],"We":[25,66,104],"formulate":[26,67],"analyze":[28],"k":[33,90],"nodedisjoint":[34],"to":[37,50,63,111],"c":[38,51],"accidents":[40],"in":[41],"sense":[43],"if":[45],"any":[46],"subset":[47],"up":[49],"channels":[52],"inoperational,":[54],"at":[55],"least":[56],"one":[57],"path":[58],"should":[59],"still":[60],"be":[61],"able":[62],"deliver":[64],"packets.":[65],"two":[68,77],"versions":[69],"multi-path":[73],"optimization":[74],"using":[76],"performance":[78],"metrics,":[79],"sum":[81],"cost":[83,87],"maximal":[86],"paths.":[91],"Focusing":[92],"directed":[94],"acyclic":[95],"graphs,":[96],"we":[97],"develop":[98,106],"approximation":[99,122],"algorithms":[100],"for":[101],"both":[102],"problems.":[103],"also":[105],"adapted":[107],"randomized":[108],"rounding":[109],"scheme":[110],"further":[112],"trade":[113],"off":[114],"time":[116],"space":[118],"complexities":[119],"our":[121],"algorithm":[123],"optimality":[126],"guarantee.":[127]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}