LB-OPAR: Load balanced optimized predictive and adaptive routing for cooperative UAV networks

LB-OPAR: Load balanced optimized predictive and adaptive routing for cooperative UAV networks
复制标题

DOI:
10.1016/j.adhoc.2022.102878
复制
发表时间:
2022-05-10
期刊:
影响因子:
4.8
通讯作者:
Bentley, Elizabeth Serena
Bentley, Elizabeth Serena
中科院分区:
计算机科学2区
文献类型:
--
作者:
Gharib, Mohammed;Afghah, Fatemeh;Bentley, Elizabeth Serena

文献摘要

被引文献

相似文献

协作自组织无人机网络已经成为建立通信基础设施不可行的情况下的主要解决方案集。灾后搜索和救援以及情报、监视和侦察(ISR)是无人机节点需要将收集到的数据协同发送到中央决策者单元的两个例子。最近提出的基于sdn的解决方案在管理此类网络的不同方面表现出令人难以置信的性能。然而,高动态无人机网络的路由问题还没有得到充分的解决。为了提高网络性能,需要一种与SDN设计和SDN网络的高动态特性相适应的最优、可靠、自适应的路由算法。提出了一种基于sdn的协同无人机网络路由解决方案——负载均衡优化预测与自适应路由(LB-OPAR)。LB-OPAR是我们最近发布的路由算法(OPAR)的扩展,它可以平衡网络负载,并在吞吐量、成功率和流完成时间(FCT)方面优化网络性能。本文对高动态无人机网络中的路由问题进行了解析建模,并提出了一种轻量级的算法解决方案,以寻找时间复杂度为0 (|E|(2))的最优解,其中|E|为网络链路总数。我们使用ns-3网络模拟器对所提出算法的性能进行了详尽的评估。结果表明,LB-OPAR在FCT上比基准算法提高了20%,平均流量成功率提高了30%,吞吐量提高了400%。(1)
Cooperative ad-hoc UAV networks have been turning into the primary solution set for situations where establishing a communication infrastructure is not feasible. Search-and-rescue after a disaster and intelligence, surveillance, and reconnaissance (ISR) are two examples where the UAV nodes need to send their collected data cooperatively into a central decision maker unit. Recently proposed SDN-based solutions show incredible performance in managing different aspects of such networks. Alas, the routing problem for the highly dynamic UAV networks has not been addressed adequately. An optimal, reliable, and adaptive routing algorithm compatible with the SDN design and highly dynamic nature of such networks is required to improve the network performance. This paper proposes a load-balanced optimized predictive and adaptive routing (LB-OPAR), an SDN-based routing solution for cooperative UAV networks. LB-OPAR is the extension of our recently published routing algorithm (OPAR) that balances the network load and optimizes the network performance in terms of throughput, success rate, and flow completion time (FCT). We analytically model the routing problem in highly dynamic UAV network and propose a lightweight algorithmic solution to find the optimal solution with O(|E|(2)) time complexity where |E| is the total number of network links. We exhaustively evaluate the proposed algorithm's performance using ns-3 network simulator. Results show that LB-OPAR outperforms the benchmark algorithms by 20% in FCT, by 30% in flow success rate on average, and up to 400% in throughput.(1)