TY - JOUR
T1 - Planning while flying
T2 - A measurement-aided dynamic planning of drone small cells
AU - Lu, Ning
AU - Zhou, Yi
AU - Shi, Chenhao
AU - Cheng, Nan
AU - Cai, Lin
AU - Li, Bin
N1 - Funding Information:
Manuscript received July 17, 2018; revised September 7, 2018; accepted September 21, 2018. Date of publication October 3, 2018; date of current version May 8, 2019. This work was supported in part by the NSERC of Canada, in part by the Henan International Science and Technology Cooperation Program under Grant 182102410050, in part by the Henan Young Scholar Promotion Program under Grant 2016GGJS-018, in part by the Program for Science and Technology Development of Henan Province under Grant 162102210022, and in part by the Key Project of Science and Technology Research of the Education Department of Henan Province under Grant 17A413001. (Corresponding author: Yi Zhou.) N. Lu is with the Department of Computing Science, Thompson Rivers University, Kamloops, BC V2C 0C8, Canada (e-mail: [email protected]).
Publisher Copyright:
© 2014 IEEE.
PY - 2019/4
Y1 - 2019/4
N2 - The deployment of drone small cells has emerged as a promising solution to agile provisioning of Internet backbone access for Internet of Things devices, and many other types of users/devices. In this paper, we consider the problem of deploying a set of drone cells operating on multiple channels in a target area to provide access to the backbone/core network, which is formulated as a combinatorial network utility maximization problem. Since an offline and centralized solution to such a problem is not feasible, a low-complexity and distributed online algorithm is highly desired. Therefore, we propose a measurement-aided dynamic planning (MAD-P) algorithm, where the dispatched drones perform position and channel configurations autonomously on the fly based on the real-time measurement of network throughput to solve the problem in a distributed fashion during flight with minimal centralized control. We prove that the proposed MAD-P algorithm is asymptotically optimal, and investigate how long it takes for the convergence to stationarity under the MAD-P algorithm by giving a mixing time analysis. We also derive an upper bound of the performance gap in presence of measurement errors. Simulation results are provided to validate our analytic results and demonstrate the effectiveness of our algorithm.
AB - The deployment of drone small cells has emerged as a promising solution to agile provisioning of Internet backbone access for Internet of Things devices, and many other types of users/devices. In this paper, we consider the problem of deploying a set of drone cells operating on multiple channels in a target area to provide access to the backbone/core network, which is formulated as a combinatorial network utility maximization problem. Since an offline and centralized solution to such a problem is not feasible, a low-complexity and distributed online algorithm is highly desired. Therefore, we propose a measurement-aided dynamic planning (MAD-P) algorithm, where the dispatched drones perform position and channel configurations autonomously on the fly based on the real-time measurement of network throughput to solve the problem in a distributed fashion during flight with minimal centralized control. We prove that the proposed MAD-P algorithm is asymptotically optimal, and investigate how long it takes for the convergence to stationarity under the MAD-P algorithm by giving a mixing time analysis. We also derive an upper bound of the performance gap in presence of measurement errors. Simulation results are provided to validate our analytic results and demonstrate the effectiveness of our algorithm.
UR - http://www.scopus.com/inward/record.url?scp=85054480726&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85054480726&partnerID=8YFLogxK
U2 - 10.1109/JIOT.2018.2873772
DO - 10.1109/JIOT.2018.2873772
M3 - Article
AN - SCOPUS:85054480726
SN - 2327-4662
VL - 6
SP - 2693
EP - 2705
JO - IEEE Internet of Things Journal
JF - IEEE Internet of Things Journal
IS - 2
M1 - 8480648
ER -