Power-Efficient Radio Resource Allocation for Low-Medium-Altitude Aerial Platform Based TD-LTE Networks

Zhao, Liqiang; Zhang, Chi; Zhang, Hailin; Li, Xiaohui; Hanzo, Lajos

doi:10.1109/vtcfall.2012.6398995

Cited by 13 publications

(5 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Detailed analysis of it acting in a multi-cell cellular network environment has been lacking until recently. In the past 2 years, several papers have exploited the idea that flying relays can dynamically follow large crowds of users and provide improved coverage in either emergency situations [17] or during traffic overload in the air interface of the network [18]. Fig.…”

Section: B Low Altitude Relaysmentioning

confidence: 99%

Performance analysis of micro unmanned airborne communication relays for cellular networks

Guo

Devine

Wang

2014

2014 9th International Symposium on Communication Systems, Networks &Amp; Digital Sign (CSNDSP)

View full text Add to dashboard Cite

Abstract-This paper analyses the potential of utilising small unmanned-aerial-vehicles (SUAV) as wireless relays for assisting cellular network performance. Whilst high altitude wireless relays have been investigated over the past 2 decades, the new class of low cost SUAVs offers new possibilities for addressing local traffic imbalances and providing emergency coverage. We present field-test results from an SUAV test-bed in both urban and rural environments. The results show that trough-to-peak throughput improvements can be achieved for users in poor coverage zones. Furthermore, the paper reinforces the experimental study with large-scale network analysis using both stochastic geometry and multi-cell simulation results.

show abstract

Section: B Low Altitude Relaysmentioning

confidence: 99%

Performance analysis of micro unmanned airborne communication relays for cellular networks

Guo

Devine

Wang

2014

2014 9th International Symposium on Communication Systems, Networks &Amp; Digital Sign (CSNDSP)

View full text Add to dashboard Cite

show abstract

“…We use an approach similar to [6] and [7] to solve the problem, which comprises:-1) Phase 1:-A UT assignment problem in which z m,i,k,c,t are the only decision variables and P m,i,c,t are held constant. 2) Phase 2:-Power allocation per slot for each session in all cells.…”

Section: Proposed Solution Tehniquesmentioning

confidence: 99%

“…Considerable research effort has been made in the area of RRA in HAPs, amongst which the efforts in [2]- [7] are some. However, to the best of our knowledge, we are the first to consider RRA for multicast transmissions from a single OFDMA based HAP to UTs in its cellular like service area (i.e.…”

Section: Introductionmentioning

confidence: 99%

Radio resource allocation for multicast transmissions over High Altitude Platforms

Ibrahim

Alfa

2013

2013 IEEE Globecom Workshops (GC Wkshps)

View full text Add to dashboard Cite

In this paper, we study radio resource allocation (RRA) for multicasting in OFDMA based High Altitude Platforms (HAPs). We formulate an optimization problem for a scenario in which different sessions are multicasted to user terminals (UTs) across HAP service area. We then solve it to find the best allocation of HAP resources such as radio power, sub-channels, and time slots. The objective is to maximize the number of UTs that receive the requested multicast streams in the HAP service area in a given OFDMA frame. The optimization problem comes out to be a Mixed Integer Non-Linear Program (MINLP). Due to the high complexity of the problem and lack of special structures, we believe that breaking it into two easier subproblems and iterating between them to achieve convergence can lead to an acceptable solution. Subproblem 1 turns out to be a Binary Integer Linear Program (BILP) of no explicitly noticeable structure and therefore Lagrangian relaxation is used to dualize some constraints to get a BILP with some special structure that is easy to solve. The subgradient method is used to solve for the dual variables in the dual problem for three proposed methods to get the tightest bound in each. The obtained bounds can be used in a branch and bound (BnB) algorithm as its bounding subroutine at each node. Subproblem 2 turns out to be a simple linear program (LP) for which the simplex algorithm can be used to solve the subproblem to optimality. This paper focuses on subproblem 1 and its proposed solution techniques. In the results section of this paper, we compare the solution goodness for each method versus the well known bounding technique used in BnB which is linear program (LP) relaxation.

show abstract

“…Some of the published work in HAP RRA came in [2]- [9]. In this paper, we consider radio resource allocation (RRA) for OFDMA based HAP system with multicasting in the downlink in order to best utilize the scarce radio resources to maximize the number of user terminals (UTs) that can be admitted to receive the requested multicast session in a given OFDMA frame.…”

Section: Introductionmentioning

confidence: 99%

Using Lagrangian Relaxation for Radio Resource Allocation in High Altitude Platforms

Ibrahim

Alfa

2015

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-In this paper, we study radio resource allocation for multicasting in OFDMA based high altitude platforms (HAPs). We formulate and solve an optimization problem that finds the best allocation of HAP resources such as radio power, subchannels, and time slots. The problem also finds the best possible frequency reuse across the cells that constitute the service area of the HAP. The objective is to maximize the number of user terminals that receive the requested multicast streams in the HAP service area in a given OFDMA frame. A bounding subroutine in a branch and bound algorithm can be obtained by decomposing it into two easier subproblems, due to its high complexity, and solving them iteratively. Subproblem 1 turns out to be a binary integer linear program of no explicitly noticeable structure and therefore Lagrangian relaxation is used to dualize some constraints to get a structure that is easy to solve. Subproblem 2 turns out to be a linear program with a continuous knapsack problem structure. Hence a greedy algorithm is proposed to solve subproblem 2 to optimality. The subgradient method is used to solve for the dual variables in the dual problem to get the tightest bounds.

show abstract

Power-Efficient Radio Resource Allocation for Low-Medium-Altitude Aerial Platform Based TD-LTE Networks

Cited by 13 publications

References 12 publications

Performance analysis of micro unmanned airborne communication relays for cellular networks

Performance analysis of micro unmanned airborne communication relays for cellular networks

Radio resource allocation for multicast transmissions over High Altitude Platforms

Using Lagrangian Relaxation for Radio Resource Allocation in High Altitude Platforms

Contact Info

Product

Resources

About