Sliding-Window-Based RNC Scheme in UAV Multicasting: Performance Analysis and Network Optimization

被引:5
作者
Li, Bin [1 ]
Guo, Xianzhen [1 ]
Cong, Jiayi [1 ]
Zhang, Ruonan [1 ]
机构
[1] Northwestern Polytech Univ, Dept Commun Engn, Xian 710072, Peoples R China
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Multicast communication; Encoding; Autonomous aerial vehicles; Trajectory; Optimization; Throughput; Quality of service; Feedback control; multicasting network; network optimization; random network coding (RNC); sliding coding window (SCW); unmanned aerial vehicle (UAV); COMPLETION-TIME MINIMIZATION; USER ASSOCIATION; PLACEMENT; COMMUNICATION; DESIGN; MOBILE; SKY;
D O I
10.1109/JIOT.2021.3133528
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Unmanned aerial vehicles (UAVs)-enabled multicasting network has attracted significant attention in recent years. However, there are still some disadvantages of existing multicasting schemes used in these systems, such as low transmission efficiency and high feedback overhead. Accordingly, we propose a sliding coding window (SCW)-based random network coding (SCWRNC) scheme for a UAV multicasting network where one UAV base station is dispatched to the multicast data stream to multiple user equipments (UEs). The proposed scheme includes an SCW scheduling original packets for encoding, a lower triangular coding structure enabling UEs to decode out information even without receiving a full set of coded packets, and a feedback-compete mechanism requiring only one UE to send feedback information. The packet scheduling process is described as a five-tuple Markov decision process. Then, we give a theoretical analysis of the proposed scheme, based on which the sliding steps of SCW and the UAV hovering location are jointly optimized to maximize the system throughput. The optimal sliding steps are obtained by applying the Greedy scheduling technique, while the UAV optimal position is obtained by minimizing the maximum outage probability of all UEs. Furthermore, we also propose a flexible feedback mechanism, which enables more than one UE to send feedback for systems with sufficient resources and a "F-SCWRNC" scheme for systems where no UE is allowed to send feedback. Numerical results show that both the proposed SCWRNC scheme and F-SCWRNC scheme could achieve significant throughput gain over the existing ones.
引用
收藏
页码:12111 / 12124
页数:14
相关论文
共 38 条
[1]   3-D Placement of an Unmanned Aerial Vehicle Base Station (UAV-BS) for Energy-Efficient Maximal Coverage [J].
Alzenad, Mohamed ;
El-Keyi, Amr ;
Lagum, Faraj ;
Yanikomeroglu, Halim .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2017, 6 (04) :434-437
[2]   Resource and Placement Optimization for Multiple UAVs using Backhaul Tethered Balloons [J].
Alzidaneen, Ala ;
Alsharoa, Ahmad ;
Alouini, Mohamed-Slim .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2020, 9 (04) :543-547
[3]  
Boyd S. P., 2004, Convex Optimization
[4]   Multi-UAV Coverage Scheme for Average Capacity Maximization [J].
Chen, Ruirui ;
Li, Xinyan ;
Sun, Yanjing ;
Li, Song ;
Sun, Zhi .
IEEE COMMUNICATIONS LETTERS, 2020, 24 (03) :653-657
[5]   Multiple UAVs as Relays: Multi-Hop Single Link Versus Multiple Dual-Hop Links [J].
Chen, Yunfei ;
Zhao, Nan ;
Ding, Zhiguo ;
Alouini, Mohamed-Slim .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2018, 17 (09) :6348-6359
[6]  
Deng C., 2019, P IEEE GLOBECOM, P1
[7]   Learn-As-You-Fly: A Distributed Algorithm for Joint 3D Placement and User Association in Multi-UAVs Networks [J].
El Hammouti, Hajar ;
Benjillali, Mustapha ;
Shihada, Basem ;
Alouini, Mohamed-Slim .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2019, 18 (12) :5831-5844
[8]  
Feng C., 2019, PROC IEEE WCSP, P1
[9]   Flight Time Minimization of UAV for Data Collection Over Wireless Sensor Networks [J].
Gong, Jie ;
Chang, Tsung-Hui ;
Shen, Chao ;
Chen, Xiang .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2018, 36 (09) :1942-1954
[10]   NCAnt: A Network Coding-Based Multipath Data Transmission Scheme for Multi-UAV Formation Flying Networks [J].
Han, Chen ;
Yin, Jun ;
Ye, Lei ;
Yang, Yuwang .
IEEE COMMUNICATIONS LETTERS, 2021, 25 (03) :1041-1044