Joint Base Station Association and Power Allocation for uplink sum-rate maximization

Chitti, Krishna; Kuang, Quan; Speidel, Joachim

doi:10.1109/spawc.2013.6612001

Cited by 16 publications

(6 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The strong coupling between the binary variables x and the continuous variables p make the problems even more challenging. State-of-the-arts in existing literature typically apply the alternating optimization framework [10], [22], [23], [31], [32]. In this 'divide-and-conquer' approach, instead of dealing with x and p simultaneously, one decouples the original problems into subproblems of lower dimensions and resolve one subproblem at a time.…”

Section: System Model and Problem Formulationsmentioning

confidence: 99%

Joint Load Balancing and Interference Management for Small-Cell Heterogeneous Networks With Limited Backhaul Capacity

Tam

Tuan

Ngo

et al. 2017

IEEE Trans. Wireless Commun.

110

View full text Add to dashboard Cite

Abstract-In this paper, new strategies are devised for joint load balancing and interference management in the downlink of a heterogeneous network, where small cells are densely deployed within the coverage area of a traditional macrocell. Unlike existing work, the limited backhaul capacity at each base station (BS) is taken into account. Here users (UEs) cannot be offloaded to any arbitrary BS, but only to ones with sufficient backhaul capacity remaining. Jointly designed with traffic offload, transmit power allocation mitigates the intercell interference to further support the quality of service of each UE. The objective here is either (i) to maximize the network sum rate subject to minimum throughput requirements at individual UEs, or (ii) to maximize the minimum UE throughput. Both formulated problems belong to the difficult class of mixed-integer nonconvex optimization. The inherently binary BS-UE association variables are strongly coupled with the transmit power variables, making the problems even more challenging to solve. New iterative algorithms are developed based on an exact penalty method combined with successive convex programming, where we deal with the binary BS-UE association problem and the nonconvex power allocation problem one at a time. At each iteration of the proposed algorithms, only two simple convex problems need to be solved in the same time scale. It is proven that the algorithms improve the objective functions in each iteration and converge eventually. Numerical results demonstrate the efficiency of the proposed algorithms in both traffic offloading and interference mitigation.

show abstract

Section: System Model and Problem Formulationsmentioning

confidence: 99%

Joint Load Balancing and Interference Management for Small-Cell Heterogeneous Networks With Limited Backhaul Capacity

Tam

Tuan

Ngo

et al. 2017

IEEE Trans. Wireless Commun.

110

View full text Add to dashboard Cite

show abstract

“…The authors used convex optimization method to derive an upper bound on the downlink, and then introduced a heuristic user association rule, which could approach the upper bound mentioned before and was also simple. In [22], the rate maximization problem under multi-cell and multi-user QoS constraints was formulated as a mixed integer nonlinear programming problem, and then feasible infeasible-interior-pointmethod (IIPM) was applied to optimize the system throughput. In [23], the authors jointly optimize the problem of user association and resource allocation in wireless HetNets, which is aimed to achieve high system capacity.…”

Section: Related Workmentioning

confidence: 99%

Coalition Game based User Association for mmWave Mobile Relay Systems in Rail Traffic Scenarios

Chen

Niu

Mao

et al. 2021

Preprint

View full text Add to dashboard Cite

Rail transportation, especially, high-speed rails (HSR), is an important infrastructure for the development of national economy and the promotion of passenger experience. Due to the large bandwidth, millimeter wave (mmWave) communication is regarded as a promising technology to meet the demand of high data rates. However, since mmWave communication has the characteristic of high attenuation, mobile relay (MR) is considered in this paper. Also, full-duplex (FD) communications have been proposed to improve the spectral efficiency. However, because of the high speed, as well as the problem of penetration loss, passengers on the train have a poor quality of service. Consequently, an effective user association scheme for HSR in mmWave band is necessary. In this paper, we investigate the user association optimization problem in mmWave mobile

show abstract

“…In this direction, [21] proposes an intuitive idea of expanding the coverage area of small cells by adding constant bias terms to the SINR values, so as to balance the load among different cells (although [21] does not analyze what the optimal bias terms should be). Other common heuristics proposed in the literature include that in [22], [20], [23], which optimize BS association through the greedy method, and [24], which randomly assigns each user terminal to the BS with the probability proportional to the estimated throughput, and [14], [15], [25], which devise their respective methods based on the relaxation heuristic. In addition to the network utility maximization formulation, [26] addresses the BS assignment problem from a game theory perspective (as the assignment problem can be thought of as a game among the BSs), where the Nash equilibrium of the game is found.…”

Section: A Related Workmentioning

confidence: 99%

Distributed Pricing-Based User Association for Downlink Heterogeneous Cellular Networks

Shen

2014

IEEE J. Select. Areas Commun.

218

200

View full text Add to dashboard Cite

Abstract-This paper considers the optimization of the user and base-station (BS) association in a wireless downlink heterogeneous cellular network under the proportional fairness criterion. We first consider the case where each BS has a single antenna and transmits at fixed power, and propose a distributed price update strategy for a pricing-based user association scheme, in which the users are assigned to the BS based on the value of a utility function minus a price. The proposed price update algorithm is based on a coordinate descent method for solving the dual of the network utility maximization problem, and it has a rigorous performance guarantee. The main advantage of the proposed algorithm as compared to the existing subgradient method for price update is that the proposed algorithm is independent of parameter choices and can be implemented asynchronously. Further, this paper considers the joint user association and BS power control problem, and proposes an iterative dual coordinate descent and the power optimization algorithm that significantly outperforms existing approaches. Finally, this paper considers the joint user association and BS beamforming problem for the case where the BSs are equipped with multiple antennas and spatially multiplex multiple users. We incorporate dual coordinate descent with the weighted minimum mean-squared error (WMMSE) algorithm, and show that it achieves nearly the same performance as a computationally more complex benchmark algorithm (which applies the WMMSE algorithm on the entire network for BS association), while avoiding excessive BS handover.

show abstract

Joint Base Station Association and Power Allocation for uplink sum-rate maximization

Cited by 16 publications

References 21 publications

Joint Load Balancing and Interference Management for Small-Cell Heterogeneous Networks With Limited Backhaul Capacity

Joint Load Balancing and Interference Management for Small-Cell Heterogeneous Networks With Limited Backhaul Capacity

Coalition Game based User Association for mmWave Mobile Relay Systems in Rail Traffic Scenarios

Distributed Pricing-Based User Association for Downlink Heterogeneous Cellular Networks

Contact Info

Product

Resources

About