Spectrum Sharing Planning for Full-Duplex UAV Relaying Systems With Underlaid D2D Communications

被引:156
作者
Wang, Haichao [1 ]
Wang, Jinlong [1 ]
Ding, Guoru [1 ,2 ]
Chen, Jin [1 ]
Li, Yuzhou [3 ]
Han, Zhu [4 ,5 ]
机构
[1] Army Engn Univ PLA, Coll Commun Engn, Nanjing 210007, Jiangsu, Peoples R China
[2] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing 210096, Jiangsu, Peoples R China
[3] Huazhong Univ Sci & Technol, Sch Elect Informat & Commun, Wuhan 430074, Peoples R China
[4] Univ Houston, Dept Elect & Comp Engn, Houston, TX 77004 USA
[5] Kyung Hee Univ, Dept Comp Sci & Engn, Yongin 17104, South Korea
基金
中国国家自然科学基金;
关键词
Device-to-device communications; full-duplex; power allocation; successive convex optimization; trajectory planning; unmanned aerial vehicle; NETWORKS; OPTIMIZATION; ALGORITHMS; ALLOCATION; DEPLOYMENT; DESIGN;
D O I
10.1109/JSAC.2018.2864375
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we consider the spectrum sharing planning problem for a full-duplex unmanned aerial vehicle (UAV) relaying systems with underlaid device-to-device (D2D) communications, where a mobile UAV employed as a full-duplex relay assists the communication link between separated nodes without direct link. Our design aims to maximize the sum throughput under the transmit power budget, while guaranteeing the coexistence with terrestrial D2D pairs, satisfying the information causality and UAV's trajectory constraints. First, the transmit power planning with a given trajectory is investigated, where a successive convex algorithm is developed by leveraging the D.C. (difference of two convex) programming. Then, we propose a two-step trajectory design method for the given transmit power since the constraints of D2D pairs result in a nonconvex feasible set. Furthermore, an efficient spectrum sharing method for an aerial UAV and terrestrial D2D communications is designed by alternately optimizing the transmit power and UAV's trajectory. Finally, simulation results under various parameter configurations are provided to show the effectiveness of the proposed algorithms.
引用
收藏
页码:1986 / 1999
页数:14
相关论文
共 41 条
[1]  
Al-Hourani A, 2014, IEEE GLOB COMM CONF, P2898, DOI 10.1109/GLOCOM.2014.7037248
[2]   Optimal LAP Altitude for Maximum Coverage [J].
Al-Hourani, Akram ;
Kandeepan, Sithamparanathan ;
Lardner, Simon .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2014, 3 (06) :569-572
[3]   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
[4]   Decentralized cooperative aerial-surveillance using fixed-wing miniature UAVs [J].
Beard, Randal W. ;
McLain, Timothy W. ;
Nelson, Derek B. ;
Kingston, Derek ;
Johanson, David .
PROCEEDINGS OF THE IEEE, 2006, 94 (07) :1306-1324
[5]  
Boyd L., 2004, CONVEX OPTIMIZATION
[6]   Medium Access Control for Unmanned Aerial Vehicle (UAV) Ad-Hoc Networks With Full-Duplex Radios and Multipacket Reception Capability [J].
Cai, Yegui ;
Yu, F. Richard ;
Li, Jun ;
Zhou, Yifeng ;
Lamont, Louise .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2013, 62 (01) :390-394
[7]   Channel Training Algorithms for Two-Way MIMO Relay Systems [J].
Chiong, Choo W. R. ;
Rong, Yue ;
Xiang, Yong .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2013, 61 (16) :3988-3998
[8]  
Choi JI, 2010, MOBICOM 10 & MOBIHOC 10: PROCEEDINGS OF THE 16TH ANNUAL INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND NETWORKING AND THE 11TH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, P1
[9]   Spectrum Inference in Cognitive Radio Networks: Algorithms and Applications [J].
Ding, Guoru ;
Jiao, Yutao ;
Wang, Jinlong ;
Zou, Yulong ;
Wu, Qihui ;
Yao, Yu-Dong ;
Hanzo, Lajos .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2018, 20 (01) :150-182
[10]   An Amateur Drone Surveillance System Based on the Cognitive Internet of Things [J].
Ding, Guoru ;
Wu, Qihui ;
Zhang, Linyuan ;
Lin, Yun ;
Tsiftsis, Theodoros A. ;
Yao, Yu-Dong .
IEEE COMMUNICATIONS MAGAZINE, 2018, 56 (01) :29-35