Hybrid Offline-Online Design for UAV-Enabled Data Harvesting in Probabilistic LoS Channels

Abstract

This paper considers an unmanned aerial vehicle (UAV)-enabled wireless sensor network (WSN) in urban areas, where a UAV is deployed to collect data from distributed sensor nodes (SNs) within a given duration. To characterize the occasional building blockage between the UAV and SNs, we construct the probabilistic line-of-sight (LoS) channel model for a Manhattan-type city by using the combined simulation and data regression method, which is shown in the form of a generalized logistic function of the UAV-SN elevation angle. We assume that only the knowledge of SNs' locations and the probabilistic LoS channel model is known a priori, while the UAV can obtain the instantaneous LoS/Non-LoS channel state information (CSI) with the SNs in real time along its flight. Our objective is to maximize the minimum (average) data collection rate from all the SNs for the UAV. To this end, we formulate a new rate maximization problem by jointly optimizing the UAV three-dimensional (3D) trajectory and transmission scheduling of SNs. Although the optimal solution is intractable due to the lack of the complete UAV-SNs CSI, we propose in this paper a novel and general design method, called hybrid offline-online optimization, to obtain a suboptimal solution to it, by leveraging both the statistical and real-time CSI. Essentially, our proposed method decouples the joint design of UAV trajectory and communication scheduling into two phases: namely, an offline phase that determines the UAV path prior to its flight based on the probabilistic LoS channel model, followed by an online phase that adaptively adjusts the UAV flying speeds along the offline optimized path as well as communication scheduling based on the instantaneous UAV-SNs CSI and SNs' individual amounts of data received accumulatively.Extensive simulation results are provided to show the significant rate performance improvement of our proposed design as compared to various benchmark schemes. Index TermsUAV communications, wireless sensor network, 3D trajectory optimization, probabilistic LoS channel, hybrid offline-online design.Part of this work has been submitted

Drone Mobile Networks: Performance Analysis Under 3D Tractable Mobility Models

“…In formula (11) and formula ( 13), we derived the probability distribution of Fr (t) (w), F R (w) and F D (w). Hence, with some basic numerical steps, we can arrive at the CDF and PDF expressions of r NLOS,BM (t) in ( 18) and (19).…”

“…Considering the 3D BM mobility, the CDF and PDF of r NLOS,BM (t) (i.e., mobile NLOS drone distance) are formulated as (18) and (19), respectively.…”

Fundamental Rate Limits of UAV-Enabled Multiple Access Channel With Trajectory Optimization

“…As the strong duality holds between problems (P2.2) and (D2.2), we solve problem (P2.2) by equivalently solving problem (D2.2). First, we obtain the dual function f 2 ({µ k }) by solving problem (45) under any given {µ k } that satisfies (46) and µ k ≥ 0, ∀k ∈ K. In this case, problem (45) is reexpressed as (41), (40), (43), (42).…”

Aerial Cooperative Jamming for Cellular-Enabled UAV Secure Communication Network: Joint Trajectory and Power Control Design

“…(For the purpose of exposition, it is reasonable to assume that the ground-to-UAV follows the free-space LoS channel model when the UAV is deployed in the rural area with sufficiently high altitude. In this case, the probability of Non-LoS state is negligible compared to the dominant LoS state [30]. However, the proposed design is readily extendable to more general channel models in urban areas with Non-LoS effects, e.g., [30].…”

“…In this case, the probability of Non-LoS state is negligible compared to the dominant LoS state [30]. However, the proposed design is readily extendable to more general channel models in urban areas with Non-LoS effects, e.g., [30]. ), which are, respectively, given as below, hBU[n]=ρ0dBU−2[n]=ρ0(H−HB)2+||qU[n]−wB||2, hJEi[n]=ρ0dJEi−2[n]=ρ0H2+||qJ[n]−wnormalEi||2, hJU[n]=ρ0dJU−2[n]=ρ0||qU[n]…”