Abstract
Due to the advantages in flexible deployment, fast communication recovery and high quality of service (QoS), unmanned aerial vehicles (UAVs) have been widely used in wireless communications and networking. However, existing works have not sufficiently solved the problem of reliable and survivable connectivity of UAV networks. In this paper, we investigate the deployment of multiple UAVs, cooperating with a ground mobile station (GMS), to provide wireless coverage for ground users. Under the constraints of satisfying different QoS of users and the resource limitation of UAVs, our aim is to minimize the number of deployed UAVs and maximize the sum down-link rate of all users. In order to ensure the survivability of the deployed UAV networks, we also constraint that each UAV has at least two disjoint paths to GMS to form a fault-tolerant topology. Unfortunately, the formulate problem is intractable and cannot be solved directly. To solve this problem, we decouple the original problem into two subproblems: (1) minimized fault-tolerant topology construction concerning user demands; (2) maximized down-link rate with access policy optimization. Then, we propose a heuristic link-cost minimization method and a potential-game-based user rate maximization method to solve the two subproblems, respectively. The effectiveness of the solution is validated through simulations. Meanwhile, ours also outperforms some baselines in minimized UAVs, down-link transmission rate as well as running time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.