Open Access. Powered by Scholars. Published by Universities.®

Operations Research, Systems Engineering and Industrial Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Iowa State University

Computational complexity

Articles 1 - 3 of 3

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 Oct 2013

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 …


Linear Transceiver Design For A Mimo Interfering Broadcast Channel Achieving Max–Min Fairness, Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo Jan 2013

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 …


Mechanism Design For Base Station Association And Resource Allocation In Downlink Ofdma Network, Mingyi Hong, Alfredo Garcia Dec 2012

Mechanism Design For Base Station Association And Resource Allocation In Downlink Ofdma Network, Mingyi Hong, Alfredo Garcia

Mingyi Hong

We consider a resource management problem in a multi-cell downlink OFDMA network whereby the goal is to find the optimal combination of (i) assignment of users to base stations and (ii) resource allocation strategies at each base station. Efficient resource management protocols must rely on users truthfully reporting privately held information such as downlink channel states. However, individual users can manipulate the resulting resource allocation (by misreporting their private information) if by doing so they can improve their payoff. Therefore, it is of interest to design efficient resource management protocols that are strategy-proof, i.e. it is in the users' best …