The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Kawanan dron heterogen ialah gugusan dron hibrid yang besar di mana berbilang dron dengan protokol wayarles berbeza disambungkan oleh beberapa dron penterjemah yang dipanggil GW. Pada masa kini, oleh kerana dron yang murah, seperti dron mainan, telah digunakan secara meluas dalam masyarakat, teknologi untuk membina kumpulan dron yang besar semakin menarik perhatian. Dalam makalah ini, kami mencadangkan algoritma kawalan mobiliti GW autonomi untuk mewujudkan komunikasi yang stabil dan berlengah rendah antara kelompok heterogen, dengan mengandaikan bahawa hanya GW boleh dikawal dan boleh dipindahkan untuk memastikan operasi fleksibel kumpulan dron. Algoritma yang dicadangkan kami terdiri daripada dua sub algoritma bebas - Penstabil Pautan dan Pengoptimum Laluan. Penstabil mengekalkan pautan jiran dan terdiri daripada dua skema: pengelompokan jiran berdasarkan halaju relatif dan pengiraan halaju GW menggunakan model kinetik. Pengoptimum mencipta jalan pintas untuk mengurangkan kelewatan hujung ke hujung untuk komunikasi yang baru ditubuhkan dengan menempatkan semula GW secara dinamik. Kami juga mencadangkan reka bentuk protokol konsep untuk melaksanakan algoritma ini ke dalam kumpulan dron dunia sebenar dengan cara yang diedarkan. Simulasi komputer mendedahkan bahawa Penstabil meningkatkan kestabilan sambungan untuk ketiga-tiga model mobiliti walaupun di bawah mobiliti nod tinggi, dan Pengoptimum mengurangkan kelewatan komunikasi dengan pembentukan pintasan optimum di bawah sebarang keadaan eksperimen dan prestasinya adalah setanding dengan had atas prestasi. diperolehi oleh pencarian brute force.
Taichi MIYA
Tokyo Institute of Technology
Kohta OHSHIMA
Tokyo University of Marine Science and Technology
Yoshiaki KITAGUCHI
Tokyo Institute of Technology
Katsunori YAMAOKA
Tokyo Institute of Technology
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Taichi MIYA, Kohta OHSHIMA, Yoshiaki KITAGUCHI, Katsunori YAMAOKA, "Autonomous Gateway Mobility Control for Heterogeneous Drone Swarms: Link Stabilizer and Path Optimizer" in IEICE TRANSACTIONS on Communications,
vol. E105-B, no. 4, pp. 432-448, April 2022, doi: 10.1587/transcom.2021WWP0010.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2021WWP0010/_p
Salinan
@ARTICLE{e105-b_4_432,
author={Taichi MIYA, Kohta OHSHIMA, Yoshiaki KITAGUCHI, Katsunori YAMAOKA, },
journal={IEICE TRANSACTIONS on Communications},
title={Autonomous Gateway Mobility Control for Heterogeneous Drone Swarms: Link Stabilizer and Path Optimizer},
year={2022},
volume={E105-B},
number={4},
pages={432-448},
abstract={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.},
keywords={},
doi={10.1587/transcom.2021WWP0010},
ISSN={1745-1345},
month={April},}
Salinan
TY - JOUR
TI - Autonomous Gateway Mobility Control for Heterogeneous Drone Swarms: Link Stabilizer and Path Optimizer
T2 - IEICE TRANSACTIONS on Communications
SP - 432
EP - 448
AU - Taichi MIYA
AU - Kohta OHSHIMA
AU - Yoshiaki KITAGUCHI
AU - Katsunori YAMAOKA
PY - 2022
DO - 10.1587/transcom.2021WWP0010
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E105-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2022
AB - 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.
ER -