Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Computational complexity (2)
- Wireless networks (2)
- Access point selection (1)
- Approximation bounds (1)
- Base station clustering (1)
-
- Base station selection (1)
- Beamforming (1)
- Block coordinate descent (1)
- Block successive upper-bound minimization (1)
- Cardinality constrained quadratic program (1)
- Convex optimization (1)
- Heterogeneous networks (1)
- Interference channel (1)
- Interfering broadcast channel (1)
- MAC channel (1)
- MIMO (1)
- Max-min fairness (1)
- Multicell (1)
- Nash equilibrium (1)
- Noncooperative gams (1)
- Partial comP (1)
- Power allocation (1)
- Precoder optimization (1)
- Resource management (1)
- Semi-definite relaxation (1)
- Successive convex approximation (1)
- Successive inner approximation (1)
- Transceiver design (1)
- User grouping (1)
- Virtual multi-antenna systems (1)
Articles 1 - 6 of 6
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Joint User Grouping And Linear Virtual Beamforming: Complexity, Algorithms And Approximation Bounds, Mingyi Hong, Zi Xu, Meisam Razaviyayn, Zhi-Quan Luo
Joint User Grouping And Linear Virtual Beamforming: Complexity, Algorithms And Approximation Bounds, Mingyi Hong, Zi Xu, Meisam Razaviyayn, Zhi-Quan Luo
Mingyi Hong
In a wireless system with a large number of distributed nodes, the quality of communication can be greatly improved by pooling the nodes to perform joint transmission/reception. In this paper, we consider the problem of optimally selecting a subset of nodes from potentially a large number of candidates to form a virtual multi-antenna system, while at the same time designing their joint linear transmission strategies. We focus on two specific application scenarios: 1) multiple single antenna transmitters cooperatively transmit to a receiver; 2) a single transmitter transmits to a receiver with the help of a number of cooperative relays. We …
Joint Access Point Selection And Power Allocation For Uplink Wireless Networks, Mingyi Hong, Alfredo Garcia, Jorge Barrera, Stephen G. Wilson
Joint Access Point Selection And Power Allocation For Uplink Wireless Networks, Mingyi Hong, Alfredo Garcia, Jorge Barrera, Stephen G. Wilson
Mingyi Hong
We consider the distributed uplink resource allocation problem in a multi-carrier wireless network with multiple access points (APs). Each mobile user can optimize its own transmission rate by selecting a suitable AP and by controlling its transmit power. Our objective is to devise suitable algorithms by which mobile users can jointly perform these tasks in a distributed manner. Our approach relies on a game theoretic formulation of the joint power control and AP selection problem. In the proposed game, each user is a player with an associated strategy containing a discrete variable (the AP selection decision) and a continuous vector …
Distributed Linear Precoder Optimization And Base Station Selection For An Uplink Heterogeneous Network, Mingyi Hong, Zhi-Quan Luo
Distributed Linear Precoder Optimization And Base Station Selection For An Uplink Heterogeneous Network, Mingyi Hong, Zhi-Quan Luo
Mingyi Hong
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 formulate the problem as a noncooperative game in which the users and the BSs both act as players. We introduce a set …
Joint Base Station Clustering And Beamformer Design For Partial Coordinated Transmission In Heterogeneous Networks, Mingyi Hong, Ruoyu Sun, Hadi Baligh, Zhi-Quan Luo
Joint Base Station Clustering And Beamformer Design For Partial Coordinated Transmission In Heterogeneous Networks, Mingyi Hong, Ruoyu Sun, Hadi Baligh, Zhi-Quan Luo
Mingyi Hong
We consider the interference management problem in a multicell MIMO heterogeneous network. Within each cell there is a large number of distributed micro/pico base stations (BSs) that can be potentially coordinated for joint transmission. To reduce coordination overhead, we consider user-centric BS clustering so that each user is served by only a small number of (potentially overlapping) BSs. Thus, given the channel state information, our objective is to jointly design the BS clustering and the linear beamformers for all BSs in the network. In this paper, we formulate this problem from a {sparse optimization} perspective, and propose an efficient algorithm …
A Unified Convergence Analysis Of Block Successive Minimization Methods For Nonsmooth Optimization, Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo
A Unified Convergence Analysis Of Block Successive Minimization Methods For Nonsmooth Optimization, Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo
Mingyi Hong
The block coordinate descent (BCD) method is widely used for minimizing a continuous function f of several block variables. At each iteration of this method, a single block of variables is optimized, while the remaining variables are held fixed. To ensure the convergence of the BCD method, the subproblem of each block variable needs to be solved to its unique global optimal. Unfortunately, this requirement is often too restrictive for many practical scenarios. In this paper, we study an alternative inexact BCD approach which updates the variable blocks by successively minimizing a sequence of approximations of f which are either …
Linear Transceiver Design For A Mimo Interfering Broadcast Channel Achieving Max–Min Fairness, Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo
Linear Transceiver Design For A Mimo Interfering Broadcast Channel Achieving Max–Min Fairness, Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo
Mingyi Hong
This problem can be formulated as maximizing the minimum rate among all the users in an interfering broadcast channel (IBC). In this paper we show that when the number of antennas is at least two at each of the transmitters and the receivers, the min rate maximization problem is NP-hard in the number of users. Moreover, we develop a low-complexity algorithm for this problem by iteratively solving a sequence of convex subproblems. We theoretically establish the global convergence of the proposed algorithm to the set of stationary points, which may be suboptimal due to the non-convexity of the original minimum …