Distributed Linear Precoder Optimization and Base Station Selection for an Uplink Heterogeneous Network

@article{Hong2013DistributedLP,
  title={Distributed Linear Precoder Optimization and Base Station Selection for an Uplink Heterogeneous Network},
  author={Mingyi Hong and Zhi-Quan Tom Luo},
  journal={IEEE Transactions on Signal Processing},
  year={2013},
  volume={61},
  pages={3214-3228}
}
  • Mingyi HongZ. Luo
  • Published 1 May 2012
  • Computer Science
  • IEEE Transactions on Signal Processing
In a heterogeneous wireless cellular network, each user may be covered by multiple access points such as macro/pico/relay/femto base stations (BS). An effective approach to maximize the sum utility (e.g., system throughput) in such a network is to jointly optimize users' linear procoders as well as their BS associations. In this paper, we first show that this joint optimization problem is NP-hard and thus is difficult to solve to global optimality. To find a locally optimal solution, we… 

Optimal Joint Base Station Assignment and Beamforming for Heterogeneous Networks

This work proposes a formulation for the joint base station assignment and linear transceiver design problem based on the maximization of a system wide utility and establishes the NP-hardness of the resulting optimization problem for a large family of α-fairness utility functions.

Joint Precoding and Load Balancing Optimization for Energy-Efficient Heterogeneous Networks

Simulation results indicate that putting a BS into sleep mode by proper load balancing is an important solution for energy savings, and a heuristic algorithm is proposed to obtain a suboptimal solution of low complexity.

Joint User Association and User Scheduling for Load Balancing in Heterogeneous Networks

A joint UA and US algorithm, which can be implemented on each user’s side and base station's side separately, is proposed to obtain the single-BS association and resource allocation solutions, and a remarkable feature of the proposed algorithm is that apart from load balancing, multiuser diversity is exploited in the association process to further improve system performance.

Optimal design of energy-efficient HetNets: joint precoding and load balancing

Simulation results illustrate that the proposed algorithms significantly reduce the total power consumption, compared to the scheme where all BSs are continuously active, which implies that putting a BS into sleep mode by proper load balancing is an important solution for energy savings in heterogeneous networks.

A decomposition method for optimal user assignment in cellular networks with orthogonal transmissions

This work proposes algorithms for user-BS allocation in cellular networks where users access orthogonally and close-by BSs use non-interfering channels and shows that although the linear relaxation of all the binary variables is not optimal, a Benders' decomposition approach can be used to find the optimal solution.

Dynamic base station clustering and beamforming for an uplink SIMO cloud radio access network

The throughput maximization problem for an uplink SIMO cloud radio access network (C-RAN), where the base stations can be clustered dynamically to perform joint reception under some backhaul constraints is formulated as a sparse optimization problem based on dynamic BS clustering and beamforming.

Optimal User-Cell Association for Massive MIMO Wireless Networks

The optimal user-cell association problem for massive MIMO heterogeneous networks is considered and, under certain conditions, the globally optimal solution is close to Nash equilibria.

Optimizing user association and frequency reuse for heterogeneous network under stochastic model

  • Yicheng LinWei Yu
  • Computer Science
    2013 IEEE Global Communications Conference (GLOBECOM)
  • 2013
Numerical results show that optimizing user association and frequency reuse for multi-tier heterogeneous networks can effectively improve cell-edge user rate performance and utility.

Joint User Association and Scheduling for Load Balancing in Heterogeneous Networks

A remarkable feature of the proposed algorithm is that apart from load balancing, multiuser diversity is exploited in the association time to further improve system performance.

Joint Design of User Association and Power Allocation With Proportional Fairness in Massive MIMO HetNets

Joint design of user association and power allocation with loads constraint and transmit power constraint for the massive MIMO HetNets is investigated by considering proportional fairness about the spectral efficiency under imperfect channel state information, and an effective algorithm with guaranteed convergence is proposed.
...

References

SHOWING 1-10 OF 44 REFERENCES

Optimal Joint Base Station Assignment and Beamforming for Heterogeneous Networks

This work proposes a formulation for the joint base station assignment and linear transceiver design problem based on the maximization of a system wide utility and establishes the NP-hardness of the resulting optimization problem for a large family of α-fairness utility functions.

Joint linear precoder optimization and base station selection for an uplink MIMO network: A game theoretic approach

  • Mingyi HongZ. Luo
  • Computer Science
    2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
  • 2012
This work forms the problem of weighted sum rate optimization in a MIMO interfering multiple access channel into a noncooperative game, and develops an algorithm that allows the players to distributedly reach the Nash Equilibrium (NE) of the game.

Optimal joint base station assignment and downlink beamforming for heterogeneous networks

This work establishes the NP-hardness of the resulting optimization problem for a large family of α-fairness utility functions and proposes an efficient algorithm to approximately solve this problem for the special case of sum rate maximization.

Coordinated Beamforming for MISO Interference Channel: Complexity Analysis and Efficient Algorithms

A coordinated beamforming approach whereby multiple base stations jointly optimize their downlink beamforming vectors in order to simultaneously improve the data rates of a given group of cell edge users is considered.

Cooperative Interference Management With MISO Beamforming

  • Rui ZhangS. Cui
  • Computer Science
    IEEE Transactions on Signal Processing
  • 2010
It is shown that each Pareto-boundary rate-tuple of the MISO-IC can be achieved in a decentralized manner when each of the BSs attains its own channel capacity subject to a certain set of interference-power constraints at the other MS receivers.

On the base station selection and base station sharing in self-configuring networks

It is observed that depending on the number of transmitters, the BS selection technique might provide a better global performance than BS sharing, which suggests the existence of a Braess type paradox.

Competition Versus Cooperation on the MISO Interference Channel

It is argued that there is a fundamental need for base station cooperation when performing spectrum sharing with multiple transmit antennas, and compute numerically the Nash bargaining solution, which is a likely resolution of the resource conflict assuming that the players are rational.

Optimal Resource Allocation for MIMO Ad Hoc Cognitive Radio Networks

The stand-alone weighted sum-rate optimal schemes proposed here have merits over interference-alignment alternatives especially for practical SNR values.The novel approach is flexible to accommodate modifications aiming at interference alignment.

Price-Based Spectrum Management in Cognitive Radio Networks

This paper proposes a novel joint power/channel allocation scheme that improves the performance through a distributed pricing approach and demonstrates its effectiveness in terms of improving the overall network throughput and reducing the average power consumption.

A game approach for cell selection and resource allocation in heterogeneous wireless networks

Simulation results show that the proposed algorithms converge effectively to Nash equilibria and that the propose CS-RA mechanism achieves better performance in terms of throughput and payoff compared to conventional mechanisms.