Home >

news ヘルプ

論文・著書情報


タイトル
和文: 
英文:Autonomous Gateway Mobility Control for Heterogeneous Drone Swarms: Link Stabilizer and Path Optimizer 
著者
和文: 宮 太地, 大島 浩太, 北口 善明, 山岡 克式.  
英文: Taichi Miya, Kohta Ohshima, KITAGUCHI Yoshiaki, Katsunori Yamaoka.  
言語 English 
掲載誌/書名
和文: 
英文:IEICE Transactions on Communications 
巻, 号, ページ Vol. E105.B    No. 4    pp. 432-448
出版年月 2022年3月 
出版者
和文:一般社団法人 電子情報通信学会 
英文:The Institute of Electronics, Information and Communication Engineers 
会議名称
和文: 
英文: 
開催地
和文: 
英文: 
公式リンク https://search.ieice.org/bin/summary.php?id=e105-b_4_432
 
DOI https://doi.org/10.1587/transcom.2021WWP0010
アブストラクト Heterogeneous drone swarms are large hybrid drone clusters in which multiple drones with different wireless protocols are interconnected by some translator drones called GWs. Nowadays, because inexpensive drones, such as toy drones, have become widely used in society, the technology for constructing huge drone swarms is attracting more and more attention. In this paper, we propose an autonomous GW mobility control algorithm for establishing stabilized and low-delay communication among heterogeneous clusters, assuming that only GWs are controllable and relocatable to ensure the flexible operationality of drone swarms. Our proposed algorithm is composed of two independent sub algorithms - the Link Stabilizer and the Path Optimizer. The Stabilizer maintains the neighbor links and consists of two schemes: the neighbor clustering based on relative velocities and the GW velocity calculation using a kinetic model. The Optimizer creates a shortcut to reduce the end-to-end delay for newly established communication by relocating the GW dynamically. We also propose a conceptual protocol design to implement this algorithm into real-world drone swarms in a distributed manner. Computer simulation reveals that the Stabilizer improved the connection stability for all three mobility models even under the high node mobility, and the Optimizer reduced the communication delay by the optimal shortcut formation under any conditions of the experiments and its performance is comparable to the performance upper limit obtained by the brute-force searching.

©2007 Tokyo Institute of Technology All rights reserved.