Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/4073
Title: Backhaul-Aware Optimization of UAV Base Station Location and Bandwidth Allocation for Profit Maximization
Authors: Çiçek, Cihan Tuğrul
Gültekin, Hakan
Tavlı, Bülent
Yanikömeroğlu, Halim
Keywords: Pricing
Optimization
Resource management
Base stations
Channel allocation
Computational modeling
Heuristic algorithms
Aerial base station
backhaul
non-linear optimization
resource allocation
UAV
wireless communications
Issue Date: 2020
Publisher: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Source: Cicek, C. T., Gultekin, H., Tavli, B., and Yanikomeroglu, H. (2020). Backhaul-aware optimization of UAV base station location and bandwidth allocation for profit maximization. IEEE Access, 8, 154573-154588.
Abstract: Unmanned Aerial Vehicle Base Stations (UAV-BSs) are envisioned to be an integral component of the next generation Wireless Communications Networks (WCNs) with a potential to create opportunities for enhancing the capacity of the network by dynamically moving the supply towards the demand while facilitating the services that cannot be provided via other means efficiently. A significant drawback of the state-of-the-art have been designing a WCN in which the service-oriented performance measures (e.g., throughput) are optimized without considering different relevant decisions such as determining the location and allocating the resources, jointly. In this study, we address the UAV-BS location and bandwidth allocation problems together to optimize the total network profit. In particular, a Mixed-Integer Non-Linear Programming (MINLP) formulation is developed, in which the location of a single UAV-BS and bandwidth allocations to users are jointly determined. The objective is to maximize the total profit without exceeding the backhaul and access capacities. The profit gained from a specific user is assumed to be a piecewise-linear function of the provided data rate level, where higher data rate levels would yield higher profit. Due to high complexity of the MINLP, we propose an efficient heuristic algorithm with lower computational complexity. We show that, when the UAV-BS location is determined, the resource allocation problem can be reduced to a Multidimensional Binary Knapsack Problem (MBKP), which can be solved in pseudo-polynomial time. To exploit this structure, the optimal bandwidth allocations are determined by solving several MBKPs in a search algorithm. We test the performance of our algorithm with two heuristics and with the MINLP model solved by a commercial solver. Our numerical results show that the proposed algorithm outperforms the alternative solution approaches and would be a promising tool to improve the total network profit.
URI: https://hdl.handle.net/20.500.11851/4073
https://ieeexplore.ieee.org/document/9174722
ISSN: 2169-3536
Appears in Collections:Elektrik ve Elektronik Mühendisliği Bölümü / Department of Electrical & Electronics Engineering
Endüstri Mühendisliği Bölümü / Department of Industrial Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Files in This Item:
File Description SizeFormat 
Gültekin_Tavlı_Backhaul.pdfText1.13 MBAdobe PDFThumbnail
View/Open
Show full item record

CORE Recommender

SCOPUSTM   
Citations

2
checked on Sep 23, 2022

WEB OF SCIENCETM
Citations

8
checked on Sep 24, 2022

Page view(s)

102
checked on Feb 6, 2023

Download(s)

12
checked on Feb 6, 2023

Google ScholarTM

Check

Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.