A delay aware routing approach for FANET based on emperor penguins colony algorithm

IF 3.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Mahyar Sadrishojaei
{"title":"A delay aware routing approach for FANET based on emperor penguins colony algorithm","authors":"Mahyar Sadrishojaei","doi":"10.1007/s12083-024-01764-1","DOIUrl":null,"url":null,"abstract":"<p>Many drones work together in an ad hoc manner to form flying ad hoc networks. While these networks have opened up new possibilities for a wide range of applications like the commercial, and residential, they have also presented several problems, including high-speed nodes, limited density, and abrupt dynamic topology. Therefore, routing is a complex problem in such networks. The optimized link state routing protocol served as an inspiration for this plan. This article proposes a delay-conscious routing protocol for flying ad hoc networks and offers a new method for calculating the link lifespan among two unmanned aerial vehicles based on factors such as their distance apart, relative speed, and the direction in which they travel. An approach is presented in which the emperor penguin colony algorithm is used to select multi-point relay nodes. A node's ability to serve as a multi-point relay node is based on its remaining energy, link lifespan, neighboring degree, and eagerness. In sum up, the suggested approach generates paths between nodes taking energy and lifespan into account. The performance evaluation of the proposed routing is done against ML-OLSR and MP-OLSR. At a minimum, a 15% and 32% increase in latency and energy consumption were achieved by implementing the proposed technique.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"17 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Peer-To-Peer Networking and Applications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s12083-024-01764-1","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Many drones work together in an ad hoc manner to form flying ad hoc networks. While these networks have opened up new possibilities for a wide range of applications like the commercial, and residential, they have also presented several problems, including high-speed nodes, limited density, and abrupt dynamic topology. Therefore, routing is a complex problem in such networks. The optimized link state routing protocol served as an inspiration for this plan. This article proposes a delay-conscious routing protocol for flying ad hoc networks and offers a new method for calculating the link lifespan among two unmanned aerial vehicles based on factors such as their distance apart, relative speed, and the direction in which they travel. An approach is presented in which the emperor penguin colony algorithm is used to select multi-point relay nodes. A node's ability to serve as a multi-point relay node is based on its remaining energy, link lifespan, neighboring degree, and eagerness. In sum up, the suggested approach generates paths between nodes taking energy and lifespan into account. The performance evaluation of the proposed routing is done against ML-OLSR and MP-OLSR. At a minimum, a 15% and 32% increase in latency and energy consumption were achieved by implementing the proposed technique.

Abstract Image

基于帝企鹅群算法的 FANET 延迟感知路由方法
许多无人机以临时方式共同组成飞行临时网络。虽然这些网络为商业和住宅等广泛应用提供了新的可能性,但也带来了一些问题,包括高速节点、有限的密度和突然的动态拓扑。因此,在这类网络中,路由选择是一个复杂的问题。优化链路状态路由协议为本计划提供了灵感。本文提出了一种适用于飞行 ad hoc 网络的具有延迟意识的路由协议,并提供了一种根据两架无人飞行器之间的距离、相对速度和行进方向等因素计算其链路寿命的新方法。本文介绍了一种使用帝企鹅殖民地算法选择多点中继节点的方法。节点作为多点中继节点的能力取决于其剩余能量、链路寿命、邻接度和热心程度。总之,建议的方法在生成节点间路径时考虑了能量和寿命。建议路由的性能评估是对照 ML-OLSR 和 MP-OLSR 进行的。通过实施所建议的技术,延迟和能耗至少分别增加了 15% 和 32%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Peer-To-Peer Networking and Applications
Peer-To-Peer Networking and Applications COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
8.00
自引率
7.10%
发文量
145
审稿时长
12 months
期刊介绍: The aim of the Peer-to-Peer Networking and Applications journal is to disseminate state-of-the-art research and development results in this rapidly growing research area, to facilitate the deployment of P2P networking and applications, and to bring together the academic and industry communities, with the goal of fostering interaction to promote further research interests and activities, thus enabling new P2P applications and services. The journal not only addresses research topics related to networking and communications theory, but also considers the standardization, economic, and engineering aspects of P2P technologies, and their impacts on software engineering, computer engineering, networked communication, and security. The journal serves as a forum for tackling the technical problems arising from both file sharing and media streaming applications. It also includes state-of-the-art technologies in the P2P security domain. Peer-to-Peer Networking and Applications publishes regular papers, tutorials and review papers, case studies, and correspondence from the research, development, and standardization communities. Papers addressing system, application, and service issues are encouraged.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信