2019 IEEE Global Communications Conference (GLOBECOM) 2019
DOI: 10.1109/globecom38437.2019.9014076
|View full text |Cite
|
Sign up to set email alerts
|

UAV Placement and Bandwidth Allocation for UAV Based Wireless Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
14
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 28 publications
(14 citation statements)
references
References 11 publications
0
14
0
Order By: Relevance
“…Recent years, many studies have spotted on how to optimize the UAVs placement to enhance the system performance. The common idea is to model the issue as an optimization problem with different constrains, such as coverage [13]- [15], throughput [16], [17], data rate [18], delay [19]- [21], energy efficiency [22], [23] and etc. According to how to solve such multi-constraints optimization, the work can briefly divided into three categories, i.e., convex based approach, learning based approach and heuristic based approach.…”
Section: Related Workmentioning
confidence: 99%
“…Recent years, many studies have spotted on how to optimize the UAVs placement to enhance the system performance. The common idea is to model the issue as an optimization problem with different constrains, such as coverage [13]- [15], throughput [16], [17], data rate [18], delay [19]- [21], energy efficiency [22], [23] and etc. According to how to solve such multi-constraints optimization, the work can briefly divided into three categories, i.e., convex based approach, learning based approach and heuristic based approach.…”
Section: Related Workmentioning
confidence: 99%
“…The proposed mathematical model (6a) is a binary fractional problem, and is linearized according to [ In (14) and (15), the binary variables a l and b ul are multiplied with continuous variable π, which introduces non-linearlity in the problem and need to be removed. Let us suppose a binary variable ψ is multiplied with a continuous variable ρ,…”
Section: Appendix a Linearization Of Optimization Problemmentioning
confidence: 99%
“…In [60], the multiplication is expressed as linear inequalities as, (i) ρ − ϕ ≤ 1 − ψ, (ii) ϕ ≤ ρ, (iii) ϕ ≤ ψ, where ϕ ≥ 0. Similarly, in (14) and (15), assuming z l = a l π, ∀l and w ul = b ul π, ∀u, l. These multiplicative terms in (14) and 15 w ul = 1 (16b)…”
Section: Appendix a Linearization Of Optimization Problemmentioning
confidence: 99%
“…To overcome the limited backhaul capacity of ABSs, in [19], non-orthogonal multiple access (NOMA) was employed on backhaul transmission, and the authors jointly optimized the resource allocation at the MBS and ABSs along with the decoding order of the NOMA process and the positions of the ABSs to maximize the sum of achievable rate of the users. In [20], the total data rate of the users is maximized in a network with multiple ABSs with fixed altitudes, while taking into account the backhaul capacity limitations of ABSs. In [21], an interference management algorithm is proposed to maximize the sum rate of the network while optimizing the user-BS association and power allocations.…”
Section: A Related Workmentioning
confidence: 99%