DCFH: A dynamic clustering approach based on fire hawk optimizer in flying ad hoc networks
- Authors
- Hosseinzadeh, Mehdi; Ali, Saqib; Ahmad, Husham Jawad; Alanazi, Faisal; Yousefpoor, Mohammad Sadegh; Yousefpoor, Efat; Darwesh, Aso; Rahmani, Amir Masoud; Lee, Sang-Woong
- Issue Date
- Jun-2024
- Publisher
- ELSEVIER
- Keywords
- Artificial intelligence (AI); Clustering; Flying ad hoc networks (FANETs); Optimization algorithms; Unmanned aerial vehicles (UAVs)
- Citation
- VEHICULAR COMMUNICATIONS, v.47
- Journal Title
- VEHICULAR COMMUNICATIONS
- Volume
- 47
- URI
- https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/92030
- DOI
- 10.1016/j.vehcom.2024.100778
- ISSN
- 2214-2096
2214-2096
- Abstract
- In flying ad hoc networks (FANETs), unmanned aerial vehicles (UAVs) communicate with each other without any fixed infrastructure. Because of frequent topological changes, instability of wireless communication, threedimensional movement of UAVs, and limited resources, especially energy, FANETs deal with many challenges, especially the instability of UAV swarms. One solution to address these problems is clustering because it maintains network performance and increases scalability. In this paper, a d ynamic c lustering scheme based on f ire h awk optimizer (DCFH) is proposed for FANETs. In DCFH, each cluster head calculates the period of hello messages in its cluster based on its velocity. Then, a fire hawk optimizer (FHO)-based dynamic clustering operation is carried out to determine the role of each UAV (cluster head (CH) or cluster member (CM)) in the network. To calculate the fitness value of each fire hawk, a fitness function is suggested based on four elements, namely the balance of energy consumption, the number of isolated clusters, the distribution of CHs, and the neighbor degree. To improve cluster stability, each CH manages the movement of its CMs and adjusts it based on its movement in the network. In the last phase, DCFH defines a greedy routing process to determine the next -hop node based on a score, which consists of distance between CHs, energy, and buffer capacity. Finally, DCFH is simulated using the network simulator version 2 (NS2), and its performance is compared with three methods, including the mobility -based weighted cluster routing scheme (MWCRSF), the dynamic clustering mechanism (DCM), and the Grey wolf optimization (GWO)-based clustering protocol. The simulation results show that DCFH well manages the number of clusters in the network. It improves the cluster construction time (about 55.51%), cluster lifetime (approximately 11.13%), energy consumption (about 15.16%), network lifetime (about 2.6%), throughput (approximately 3.9%), packet delivery rate (about 0.61%), and delay (approximately 14.29%). However, its overhead is approximately 8.72% more than MWCRSF.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/92030)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.