Home >

news ヘルプ

論文・著書情報


タイトル
和文: 
英文:Adaptive GW Relocation and Strategic Flow Rerouting for Heterogeneous Drone Swarms 
著者
和文: 宮 太地, 大島 浩太, 北口 善明, 山岡 克式.  
英文: Taichi Miya, Kohta Ohshima, KITAGUCHI Yoshiaki, KATSUNORI YAMAOKA.  
言語 English 
掲載誌/書名
和文: 
英文:IEICE Transactions on Communications 
巻, 号, ページ Vol. E106.B    No. 4    pp. 331-351
出版年月 2023年4月 
出版者
和文:一般社団法人 電子情報通信学会 
英文:The Institute of Electronics, Information and Communication Engineers 
会議名称
和文: 
英文: 
開催地
和文: 
英文: 
公式リンク https://search.ieice.org/bin/summary.php?id=e106-b_4_331
 
DOI https://doi.org/10.1587/transcom.2022EBP3091
アブストラクト A drone swarm is a robotic architecture having multiple drones cooperate to accomplish a mission. Nowadays, heterogeneous drone swarms, in which a small number of gateway drones (GWs) act as protocol translators to enable the mixing of multiple swarms that use independent wireless protocols, have attracted much attention from many researchers. Our previous work proposed Path Optimizer — a method to minimize the number of end-to-end path-hops in a remote video monitoring system using heterogeneous drone swarms by autonomously relocating GWs to create a shortcut in the network for each communication request. However, Path Optimizer has limitations in improving communication quality when more video sessions than the number of GWs are requested simultaneously. Path Coordinator, which we propose in this paper, achieves a uniform reduction in end-to-end hops and maximizes the allowable hop satisfaction rate regardless of the number of sessions by introducing the cooperative and synchronous relocation of all GWs. Path Coordinator consists of two phases: first, physical optimization is performed by geographically relocating all GWs (relocation phase), and then logical optimization is achieved by modifying the relaying GWs of each video flow (rerouting phase). Computer simulations reveal that Path Coordinator adapts to various environments and performs as well as we expected. Furthermore, its performance is comparable to the upper limits possible with brute-force search.

©2007 Institute of Science Tokyo All rights reserved.