.png){kind=icon}
返回
An Energy-Efficient Routing Algorithm for UAV Formation Based on Time-Aggregated Graph
.png){kind=icon}
PRE
AI
DOI：10.23919/JCC.fa.2024-0214.202411.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The limited energy and high mobility ofunmanned aerial vehicles (UAVs) lead to drastic topol-ogy changes in UAV formation. The existing rout-ing protocols necessitate a large number of messagesfor route discovery and maintenance, greatly increas-ing network delay and control overhead. A energy-efficient routing method based on the discrete time-aggregated graph (TAG) theory is proposed since UAVformation is a defined time-varying network. The net-work is characterized using the TAG, which utilizesthe prior knowledge in UAV formation. An energy-efficient routing algorithm is designed based on TAG,considering the link delay, relative mobility, and resid-ual energy of UAVs. The routing path is determinedwith global network information before requestingcommunication. Simulation results demonstrate thatthe routing method can improve the end-to-end de-lay, packet delivery ratio, routing control overhead,and residual energy. Consequently, introducing time-varying graphs to design routing algorithms is moreeffective for UAV formation.
Keyword:
energy-efficient route
time-aggregated graph
UAV formation
