{"title":"大规模故障后基于分布式无人机中继的渐进式自组织路由重建","authors":"C. Shin, So-Yeon Park, Jinyi Yoon, Hyungjune Lee","doi":"10.1109/WCNC.2018.8377012","DOIUrl":null,"url":null,"abstract":"In this paper, we address a route reconstruction problem using Unmanned Aerial Vehicles (UAVs) after a large-scale disaster where stationary ad-hoc networks are severely destructed. The main goal of this paper is to improve routing performance in a progressive manner by reconnecting partitioned networks through dispatched UAV relays. Our proposed algorithm uses two types of UAVs: global and local UAVs to collaboratively find the best deployment position in a dynamically changing environment. To obtain terrestrial network connectivity information and extract high-level network topology, we exploit the concept of strongly connected component in graph theory. Based on the understanding from a global point view, global UAVs recommend the most effective deployment positions to local UAVs so that they are deployed as relays in more critically disrupted areas. Simulation-based experiments validate that our distributed route reconstruction algorithm outperforms a counterpart algorithm in terms of steady-state and dynamic routing performance.","PeriodicalId":360054,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Progressive ad-hoc route reconstruction using distributed UAV relays after a large-scale failure\",\"authors\":\"C. Shin, So-Yeon Park, Jinyi Yoon, Hyungjune Lee\",\"doi\":\"10.1109/WCNC.2018.8377012\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we address a route reconstruction problem using Unmanned Aerial Vehicles (UAVs) after a large-scale disaster where stationary ad-hoc networks are severely destructed. The main goal of this paper is to improve routing performance in a progressive manner by reconnecting partitioned networks through dispatched UAV relays. Our proposed algorithm uses two types of UAVs: global and local UAVs to collaboratively find the best deployment position in a dynamically changing environment. To obtain terrestrial network connectivity information and extract high-level network topology, we exploit the concept of strongly connected component in graph theory. Based on the understanding from a global point view, global UAVs recommend the most effective deployment positions to local UAVs so that they are deployed as relays in more critically disrupted areas. Simulation-based experiments validate that our distributed route reconstruction algorithm outperforms a counterpart algorithm in terms of steady-state and dynamic routing performance.\",\"PeriodicalId\":360054,\"journal\":{\"name\":\"2018 IEEE Wireless Communications and Networking Conference (WCNC)\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Wireless Communications and Networking Conference (WCNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCNC.2018.8377012\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Wireless Communications and Networking Conference (WCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC.2018.8377012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Progressive ad-hoc route reconstruction using distributed UAV relays after a large-scale failure
In this paper, we address a route reconstruction problem using Unmanned Aerial Vehicles (UAVs) after a large-scale disaster where stationary ad-hoc networks are severely destructed. The main goal of this paper is to improve routing performance in a progressive manner by reconnecting partitioned networks through dispatched UAV relays. Our proposed algorithm uses two types of UAVs: global and local UAVs to collaboratively find the best deployment position in a dynamically changing environment. To obtain terrestrial network connectivity information and extract high-level network topology, we exploit the concept of strongly connected component in graph theory. Based on the understanding from a global point view, global UAVs recommend the most effective deployment positions to local UAVs so that they are deployed as relays in more critically disrupted areas. Simulation-based experiments validate that our distributed route reconstruction algorithm outperforms a counterpart algorithm in terms of steady-state and dynamic routing performance.