检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Wang Gaifang Li Bo Yang Hongjuan Jiang Xu
机构地区:[1]School of Information Science and Engineering,Harbin Institute of Technology,Weihai 264200,China
出 处:《China Communications》2024年第11期28-39,共12页中国通信(英文版)
基 金:supported in part by the National Natural Science Foundation of China under Grants 62171154;in part by the National Natural Science Foundation of Shandong Province under Grant ZR2020MF007;in part by the Research Fund Program of Guangdong Key Laboratory of Aerospace Communication and Networking Technology under Grant 2018B030322004;in part by the Fundamental Research Funds for the Central Universities under Grant HIT.OCEF.2023030。
摘 要:The limited energy and high mobility of unmanned aerial vehicles(UAVs)lead to drastic topology changes in UAV formation.The existing routing protocols necessitate a large number of messages for route discovery and maintenance,greatly increasing network delay and control overhead.A energyefficient routing method based on the discrete timeaggregated graph(TAG)theory is proposed since UAV formation is a defined time-varying network.The network is characterized using the TAG,which utilizes the prior knowledge in UAV formation.An energyefficient routing algorithm is designed based on TAG,considering the link delay,relative mobility,and residual energy of UAVs.The routing path is determined with global network information before requesting communication.Simulation results demonstrate that the routing method can improve the end-to-end delay,packet delivery ratio,routing control overhead,and residual energy.Consequently,introducing timevarying graphs to design routing algorithms is more effective for UAV formation.
关 键 词:energy-efficient route time-aggregated graph UAV formation
分 类 号:TN929.5[电子电信—通信与信息系统] V279[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.143