arrow
返回

Energy Efficient Clustering Protocol for FANETS Using Moth Flame Optimization

delete2022-05-19
delete41
delete
OA
AI
S
Salil Bharany
S
Sandeep Sharma
S
Surbhi Bhatia
M
Mohammad Khalid Imam Rahmani
M
Mohammed Shuaib
S
Saima Anwar Lashari *
DOI:10.3390/su14106159delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
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.
Keyword:
FANETS
energy efficiency
clustering
routing
WSN
Cloud
transmission range
bio-inspired

期刊

Sustainability 封面图
Sustainability
IF:
3.3
论文数:
10.6W
被引数:
28.4W

机构

K
King Faisal University
学者数:
4.4K
论文数: 4.4K
被引数: 5.0K
J
jazan university
学者数:
5.5K
论文数: 4.5K
被引数: 140
G
Guru Nanak Dev University
学者数:
3.0K
论文数: 2.5K
被引数: 3.3K
S
Saudi Electronic University
学者数:
747
论文数: 895
被引数: 9
学者 查看更多机构
引用论文

引用论文

Grey Wolf Optimizer灰狼优化器
err2014-03-01
err1.3W
PREAI
errMirjalili, Seyedali; Mirjalili, Seyed Mohammad; Lewis, Andrew
err分享
err收藏
ROR1 Is Expressed in Human Breast Cancer and Associated with Enhanced Tumor-Cell Growth
err2012-03-05
err0
errOAAI
errSuping Zhang; Liguang Chen; Bing Cui; Han-Yu Chuang; Jianqiang Yu; Jessica Wang-Rodriguez; Li Tang; George Chen; Grzegorz W. Basak; Thomas J. Kipps
err分享
err收藏
KeySplitWatermark: Zero Watermarking Algorithm for Software Protection Against Cyber-AttacksKeySplitWatermark: 针对网络攻击的软件保护的零水印算法
err2020-01-01
err102
errOAAI
errIwendi, Celestine; Jalil, Zunera; Javed, Abdul Rehman; Reddy, Thippa G.; Kaluri, Rajesh; Srivastava, Gautam; Jo, Ohyun
err分享
err收藏
Risk Factors for Autoimmune Diseases Development After Thrombotic Thrombocytopenic Purpura
err2015-10-01
err0
errOAAI
errMélanie Roriz; Mickael Landais; Jonathan Desprez; Christelle Barbet; Elie Azoulay; Lionel Galicier; Alain Wynckel; Jean-Luc Baudel; François Provôt; Frédéric Pène; Jean-Paul Mira; Claire Presne; Pascale Poullin; Yahsou Delmas; Tarik Kanouni; Amélie Seguin; Christiane Mousson; Aude Servais; Dominique Bordessoule; Pierre Perez; Dominique Chauveau; Agnès Veyradier; Jean-Michel Halimi; Mohamed Hamidou; Paul Coppo
err分享
err收藏
err分享
err收藏
Building fast and compact convolutional neural networks for offline handwritten Chinese character recognition
err2017-12-01
err125
errOAAI
errXiao, Xuefeng; Jin, Lianwen; Yang, Yafeng; Yang, Weixin; Sun, Jun; Chang, Tianhai
err分享
err收藏
学者 查看更多内容