首页    期刊浏览 2024年09月03日 星期二
登录注册

文章基本信息

  • 标题:Energy Efficient Clustering Protocol for FANETS Using Moth Flame Optimization
  • 本地全文:下载
  • 作者:Salil Bharany ; Sandeep Sharma ; Surbhi Bhatia
  • 期刊名称:Sustainability
  • 印刷版ISSN:2071-1050
  • 出版年度:2022
  • 卷号:14
  • 期号:10
  • 页码:6159
  • DOI:10.3390/su14106159
  • 语种:English
  • 出版社:MDPI, Open Access Journal
  • 摘要:FANET (flying ad-hoc networks) is currently a trending research topic. Unmanned aerial vehicles (UAVs) have two significant challenges: short flight times and inefficient routing due to low battery power and high mobility. Due to these topological restrictions, FANETS routing is considered more complicated than MANETs or VANETs. Clustering approaches based on artificial intelligence (AI) approaches can be used to solve complex routing issues when static and dynamic routings fail. Evolutionary algorithm-based clustering techniques, such as moth flame optimization, and ant colony optimization, can be used to solve these kinds of problems with routes. Moth flame optimization gives excellent coverage while consuming little energy and requiring a minimum number of cluster heads (CHs) for routing. This paper employs a moth flame optimization algorithm for network building and node deployment. Then, we employ a variation of the K-Means Density clustering approach to choosing the cluster head. Choosing the right cluster heads increases the cluster’s lifespan and reduces routing traffic. Moreover, it lowers the number of routing overheads. This step is followed by MRCQ image-based compression techniques to reduce the amount of data that must be transmitted. Finally, the reference point group mobility model is used to send data by the most optimal path. Particle swarm optimization (PSO), ant colony optimization (ACO), and grey wolf optimization (GWO) were put to the test against our proposed EECP-MFO. Several metrics are used to gauge the efficiency of our proposed method, including the number of clusters, cluster construction time, cluster lifespan, consistency of cluster heads, and energy consumption. This paper demonstrates that our proposed algorithm performance is superior to the current state-of-the-art approaches using experimental results.
国家哲学社会科学文献中心版权所有