论文标题
功率有效的关节链接选择和多跳路由，以最大化无人机辅助粉丝的吞吐量
Power-efficient Joint Link Selection and Multi-hop Routing for Throughput Maximization in UAV Assisted FANETs
论文作者
论文摘要
本文考虑了一个具有地面站（GS）的多uav网络，该网络使用多跳继电器结构以发电的方式传输数据传输。目的是研究数据传输的最佳多跳路由结构，以最大化无人机的飞行临时网络（粉丝）的整体网络吞吐量。我们为给定功率预算的通信链接选择共同优化多跳路由结构的问题，以最大程度地提高整个网络吞吐量。似乎配方的问题属于一类非凸和整数优化问题，因此使其成为NP-HARD。为了有效地解决此问题，将其解耦到两个子问题$ \ textbf {i）} $ Power分配，具有已知的Bellman Ford的多跳路由结构和$ \ textbf {ii）} $链接选择问题。此外，这两个子问题通过放松独立地转化为凸问题，并在串联中解决了主要问题的最佳次优溶液。仿真结果表明，与其他基准方案相比，所提出的多跳路由方案可以显着改善网络吞吐量。
This paper considers a multi-UAV network with a ground station (GS) that uses multi-hop relaying structure for data transmission in a power-efficient manner. The objective is to investigate the best possible multi-hop routing structure for data transmission to maximize the overall network throughput of a flying ad-hoc network (FANET) of UAVs. We formulate a problem to jointly optimize the multi-hop routing structure with the communication link selection for a given power budget so that the overall network throughput can be maximized. It appears that the formulated problem belongs to a class of nonconvex and integer optimization problems, thus making it NP-hard. To solve this problem efficiently, it is decoupled into two subproblems $\textbf{i)}$ power allocation with known Bellman Ford-based multi-hop routing structure and $\textbf{ii)}$ link selection problem. Further, these two subproblems are independently converted into convex problems by relaxation and solved in tandem for the best suboptimal solution to the main problem. Simulation results indicate that the proposed multi-hop routing schemes can achieve a significant improvement in network throughput compared to the other benchmark scheme.
