TY - JOUR
T1 - Approximate algorithms for 3-D placement of IBFD enabled drone-mounted base stations
AU - Zhang, Liang
AU - Ansari, Nirwan
N1 - Funding Information:
Manuscript received October 16, 2018; revised February 15, 2019 and April 25, 2019; accepted June 10, 2019. Date of publication June 14, 2019; date of current version August 13, 2019. This work was supported by the National Science Foundation under Grant CNS-1814748. The review of this paper was coordinated by R. Q. Hu. (Corresponding author: Liang Zhang.) The authors are with the Advanced Networking Laboratory, Department of Electrical and Computing Engineering, New Jersey Institute of Technology, Newark, NJ 07102 USA (e-mail: lz284@njit.edu; nirwan.ansari@njit.edu). Digital Object Identifier 10.1109/TVT.2019.2923143
Publisher Copyright:
© 2019 IEEE.
PY - 2019/8
Y1 - 2019/8
N2 - The future 5G network is expected to provide throughput 1000 times and spectrum efficiency 10 times those of the current 4G network. In-band full-duplex (IBFD) is a promising technique for 5G that can conceivably improve spectrum efficiency. Drone-mounted base stations (DBSs) provide high mobility and high flexibility, and leveraging DBSs to provision services to UEs can facilitate the quality of service of the wireless network and enlarge the coverage area. Therefore, the throughput and the spectrum efficiency can be improved by leveraging IBFD-enabled DBSs. We formulate the drone-mounted base station placement with IBFD communications (DBSP-IBFD) problem, which consists of two sub-problems: the joint bandwidth, power allocation and UE association (joint-BPU) problem and the DBS placement problem. We first propose an approximate algorithm to solve the joint-BPU problem that provides guaranteed performance. Then, an exhaustive search method is employed to obtain the optimal locations for DBSs. After that, we propose a 21 (1 − 21l )-approximation algorithm to solve the DBSP-IBFD problem, where l is the number of simulation runs. Simulation results have demonstrated that the throughput of the proposed approximate algorithm is superior to benchmark algorithms in solving the DBSP-IBFD problem.
AB - The future 5G network is expected to provide throughput 1000 times and spectrum efficiency 10 times those of the current 4G network. In-band full-duplex (IBFD) is a promising technique for 5G that can conceivably improve spectrum efficiency. Drone-mounted base stations (DBSs) provide high mobility and high flexibility, and leveraging DBSs to provision services to UEs can facilitate the quality of service of the wireless network and enlarge the coverage area. Therefore, the throughput and the spectrum efficiency can be improved by leveraging IBFD-enabled DBSs. We formulate the drone-mounted base station placement with IBFD communications (DBSP-IBFD) problem, which consists of two sub-problems: the joint bandwidth, power allocation and UE association (joint-BPU) problem and the DBS placement problem. We first propose an approximate algorithm to solve the joint-BPU problem that provides guaranteed performance. Then, an exhaustive search method is employed to obtain the optimal locations for DBSs. After that, we propose a 21 (1 − 21l )-approximation algorithm to solve the DBSP-IBFD problem, where l is the number of simulation runs. Simulation results have demonstrated that the throughput of the proposed approximate algorithm is superior to benchmark algorithms in solving the DBSP-IBFD problem.
KW - Backhaul interference
KW - Drone-mounted base-station
KW - Full-duplex
KW - Self-interference
KW - Wireless backhauling
UR - http://www.scopus.com/inward/record.url?scp=85071613579&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85071613579&partnerID=8YFLogxK
U2 - 10.1109/TVT.2019.2923143
DO - 10.1109/TVT.2019.2923143
M3 - Article
AN - SCOPUS:85071613579
SN - 0018-9545
VL - 68
SP - 7715
EP - 7722
JO - IEEE Transactions on Vehicular Communications
JF - IEEE Transactions on Vehicular Communications
IS - 8
M1 - 8736712
ER -