Cellular-Enabled UAV Communication: A Connectivity-Constrained Trajectory Optimization Perspective
May 18, 2018 ยท Declared Dead ยท ๐ IEEE Transactions on Communications
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Shuowen Zhang, Yong Zeng, Rui Zhang
arXiv ID
1805.07182
Category
cs.IT: Information Theory
Cross-listed
eess.SY
Citations
369
Venue
IEEE Transactions on Communications
Last Checked
2 months ago
Abstract
Integrating the unmanned aerial vehicles (UAVs) into the cellular network is envisioned to be a promising technology to significantly enhance the communication performance of both UAVs and existing terrestrial users. In this paper, we first provide an overview on the two main paradigms in cellular UAV communications, i.e., cellular-enabled UAV communication with UAVs as new aerial users served by the ground base stations (GBSs), and UAV-assisted cellular communication with UAVs as new aerial communication platforms serving the terrestrial users. Then, we focus on the former paradigm and study a new UAV trajectory design problem subject to practical communication connectivity constraints with the GBSs. Specifically, we consider a cellular-connected UAV in the mission of flying from an initial location to a final location, during which it needs to maintain reliable communication with the cellular network by associating with one GBS at each time instant. We aim to minimize the UAV's mission completion time by optimizing its trajectory, subject to a quality-of-connectivity constraint of the GBS-UAV link specified by a minimum receive signal-to-noise ratio target. To tackle this challenging non-convex problem, we first propose a graph connectivity based method to verify its feasibility. Next, by examining the GBS-UAV association sequence over time, we obtain useful structural results on the optimal UAV trajectory, based on which two efficient methods are proposed to find high-quality approximate trajectory solutions by leveraging graph theory and convex optimization techniques. The proposed methods are analytically shown to be capable of achieving a flexible trade-off between complexity and performance, and yielding a solution that is arbitrarily close to the optimal solution in polynomial time. Finally, we make concluding remarks and point out some promising directions for future work.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Information Theory
R.I.P.
๐ป
Ghosted
R.I.P.
๐ป
Ghosted
A Vision of 6G Wireless Systems: Applications, Trends, Technologies, and Open Research Problems
R.I.P.
๐ป
Ghosted
Towards Smart and Reconfigurable Environment: Intelligent Reflecting Surface Aided Wireless Network
R.I.P.
๐ป
Ghosted
Wireless Communications with Unmanned Aerial Vehicles: Opportunities and Challenges
R.I.P.
๐ป
Ghosted
Reconfigurable Intelligent Surfaces for Energy Efficiency in Wireless Communication
R.I.P.
๐ป
Ghosted
An Overview of Signal Processing Techniques for Millimeter Wave MIMO Systems
Died the same way โ ๐ป Ghosted
R.I.P.
๐ป
Ghosted
Language Models are Few-Shot Learners
R.I.P.
๐ป
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
๐ป
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
๐ป
Ghosted