Multi-Drone 3D Trajectory Planning and Scheduling in Drone Assisted Radio Access Networks

2019 
A drone base station (DBS) is a promising technique to extend wireless connections for uncovered users of terrestrial radio access networks (RANs). To improve user fairness and network performance, in this paper, we design three-dimensional (3-D) trajectories of multiple DBSs in the drone-assisted RANs, where DBSs fly over associated areas of interests (AoIs) and relay communications between the base station and users in AoIs. We formulate the multi-DBS 3-D trajectory planning and scheduling as a mixed-integer non-linear programming (MINLP) problem with the objective of minimizing the average DBS-to-user (D2U) pathloss. The 3-D trajectory variations in both horizontal and vertical directions, as well as the state-of-the-art DBS-related channel models, are considered in the formulation. To address the non-convexity and NP-hardness of the MINLP problem, we first decouple it into multiple integer linear programming and quasi-convex sub-problems in which AoI association, D2U communication scheduling, horizontal trajectories, and flying heights of DBSs are, respectively, optimized. Then, we design a multi-DBS 3-D trajectory planning and scheduling algorithm to solve the sub-problems iteratively based on the block coordinate descent method. A k-means-based initial trajectory generation and a search-based start slot scheduling are considered in the proposed algorithm to improve trajectory design performance and ensure the inter-DBS distance constraint, respectively. Extensive simulations are conducted to investigate the impacts of DBS quantity, horizontal speed, and initial trajectory on the trajectory planning results. Compared with the static DBS deployment, the proposed trajectory planning can achieve 10–15 dB reduction on average D2U pathloss and reduce the D2U pathloss standard deviation by 68%, which indicate the improvements of network performance and user fairness.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    33
    References
    20
    Citations
    NaN
    KQI
    []