Two-Tier Communication for UAV-Enabled Massive IoT Systems: Performance Analysis and Joint Design of Trajectory and Resource Allocation

被引:43
作者
Sun, Zhuo [1 ]
Wei, Zhiqiang [2 ]
Yang, Nan [1 ]
Zhou, Xiangyun [1 ]
机构
[1] Australian Natl Univ, Res Sch Elect Energy & Mat Engn, Canberra, ACT 2600, Australia
[2] Univ New South Wales, Sch Elect Engn & Telecommun, Sydney, NSW 2052, Australia
基金
澳大利亚研究理事会;
关键词
Throughput; Trajectory; Internet of Things; Unmanned aerial vehicles; Data collection; Resource management; Channel estimation; UAV communications; massive Internet of Things; performance analysis; trajectory design; resource allocation; CODED SLOTTED ALOHA; INTERNET; ACCESS; SKY;
D O I
10.1109/JSAC.2020.3018855
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this article, we propose a two-tier communication strategy to facilitate data collection in unmanned aerial vehicle (UAV)-enabled massive Internet of Things (IoT) systems through introducing ground access points (APs) to serve between the UAV and IoT devices. In the first tier of our proposed strategy, all IoT devices transmit their packets to their local APs via a multi-channel ALOHA-based random access scheme, while in the second tier, APs deliver their aggregated data to the UAV through coordinated time division multiple access. Thus, our introduced APs not only liberate the UAV from the potential massive IoT congestion but also facilitate the design of UAV's trajectory based on the location of APs. To examine the performance of our strategy, we propose a tractable framework to analyze the average system throughput. We reveal that the average two-tier throughput of each AP monotonically increases with its maximum achievable throughput in the second tier, while the increasing slope becomes steeper with a higher traffic load mean in the first tier. Then, we formulate the joint design of UAV's trajectory and resource allocation as a non-convex optimization problem to maximize the average system throughput while considering the heterogeneous quality of service requirement of each AP. To solve this problem, a low-complexity iterative algorithm is devised based on successive convex approximation. Numerical results demonstrate the substantial average system throughput gain achieved by our proposed strategy and design in the context of massive access, compared to the baseline schemes in the literature.
引用
收藏
页码:1132 / 1146
页数:15
相关论文
共 47 条
[1]   Optimal LAP Altitude for Maximum Coverage [J].
Al-Hourani, Akram ;
Kandeepan, Sithamparanathan ;
Lardner, Simon .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2014, 3 (06) :569-572
[2]  
Andrews G.E., 2001, Special Functions, Encyclopedia of Mathematics and Its Applications
[3]  
[Anonymous], 2016, GEOCHEMISTRY TRACE E
[4]  
[Anonymous], 2013, Internet of everything: a $4.6 trillion publicsector opportunity
[5]  
[Anonymous], 2017, 2017 IEEE International Conference on Communications (ICC)
[6]   Massive Machine-Type Communications in 5G: Physical and MAC-Layer Solutions [J].
Bockelmann, Carsten ;
Pratas, Nuno ;
Nikopour, Hosein ;
Au, Kelvin ;
Svensson, Tommy ;
Stefanovic, Cedomir ;
Popovski, Petar ;
Dekorsy, Armin .
IEEE COMMUNICATIONS MAGAZINE, 2016, 54 (09) :59-+
[7]  
Boyd S. P., 2004, Convex Optimization
[8]  
Chen X., 2020, ARXIV200203491
[9]   The Application of Relay to Massive Non-Orthogonal Multiple Access [J].
Chen, Xiaoming ;
Jia, Rundong ;
Ng, Derrick Wing Kwan .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2018, 66 (11) :5168-5180
[10]   Fully Non-Orthogonal Communication for Massive Access [J].
Chen, Xiaoming ;
Zhang, Zhaoyang ;
Zhong, Caijun ;
Jia, Rundong ;
Ng, Derrick Wing Kwan .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2018, 66 (04) :1717-1731