Cooperative Interference Control for Spectrum Sharing in OFDMA Cellular Systems

This paper studies cooperative schemes for the inter-cell interference control in orthogonal-frequency-divisionmultiple- access (OFDMA) cellular systems. The downlink transmission in a simplified two-cell system is examined, where both cells simultaneously access the same frequency band using OFDMA. The joint power and subcarrier allocation over the two cells is investigated for maximizing their sum throughput with both centralized and decentralized implementations. Particularly, the decentralized allocation is achieved via a new cooperative interference control approach, whereby the two cells independently implement resource allocation to maximize individual throughput in an iterative manner, subject to a set of mutual interference power constraints. Simulation results show that the proposed decentralized resource allocation schemes achieve the system throughput close to that by the centralized scheme, and provide substantial throughput gains over existing schemes.Comment: To appear in ICC201

Exploiting Interference Alignment in Multi-Cell Cooperative OFDMA Resource Allocation

This paper studies interference alignment (IA) based multi-cell cooperative resource allocation for the downlink OFDMA with universal frequency reuse. Unlike the traditional scheme that treats subcarriers as separate dimensions for resource allocation, the IA technique is utilized to enable frequency-domain precoding over parallel subcarriers. In this paper, the joint optimization of frequency-domain precoding via IA, subcarrier user selection and power allocation is investigated for a cooperative three-cell OFDMA system to maximize the downlink throughput. Numerical results for a simplified symmetric channel setup reveal that the IA-based scheme achieves notable throughput gains over the traditional scheme only when the inter-cell interference link has a comparable strength as the direct link, and the receiver SNR is sufficiently large. Motivated by this observation, a practical hybrid scheme is proposed for cellular systems with heterogenous channel conditions, where the total spectrum is divided into two subbands, over which the IAbased scheme and the traditional scheme are applied for resource allocation to users located in the cell-intersection region and cellnon- intersection region, respectively. It is shown that this hybrid resource allocation scheme flexibly exploits the downlink IA gains for OFDMA-based cellular systems.Comment: 5 pages, 5 figures, GC2011 conferenc

A Comprehensive Survey of Potential Game Approaches to Wireless Networks

Potential games form a class of non-cooperative games where unilateral improvement dynamics are guaranteed to converge in many practical cases. The potential game approach has been applied to a wide range of wireless network problems, particularly to a variety of channel assignment problems. In this paper, the properties of potential games are introduced, and games in wireless networks that have been proven to be potential games are comprehensively discussed.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on Communications, vol. E98-B, no. 9, Sept. 201

Decentralized Fair Scheduling in Two-Hop Relay-Assisted Cognitive OFDMA Systems

In this paper, we consider a two-hop relay-assisted cognitive downlink OFDMA system (named as secondary system) dynamically accessing a spectrum licensed to a primary network, thereby improving the efficiency of spectrum usage. A cluster-based relay-assisted architecture is proposed for the secondary system, where relay stations are employed for minimizing the interference to the users in the primary network and achieving fairness for cell-edge users. Based on this architecture, an asymptotically optimal solution is derived for jointly controlling data rates, transmission power, and subchannel allocation to optimize the average weighted sum goodput where the proportional fair scheduling (PFS) is included as a special case. This solution supports decentralized implementation, requires small communication overhead, and is robust against imperfect channel state information at the transmitter (CSIT) and sensing measurement. The proposed solution achieves significant throughput gains and better user-fairness compared with the existing designs. Finally, we derived a simple and asymptotically optimal scheduling solution as well as the associated closed-form performance under the proportional fair scheduling for a large number of users. The system throughput is shown to be $\mathcal{O}\left(N(1-q_p)(1-q_p^N)\ln\ln K_c\right)$, where $K_c$ is the number of users in one cluster, $N$ is the number of subchannels and $q_p$ is the active probability of primary users.Comment: 29 pages, 9 figures, IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSIN

Coalitional Games with Overlapping Coalitions for Interference Management in Small Cell Networks

In this paper, we study the problem of cooperative interference management in an OFDMA two-tier small cell network. In particular, we propose a novel approach for allowing the small cells to cooperate, so as to optimize their sum-rate, while cooperatively satisfying their maximum transmit power constraints. Unlike existing work which assumes that only disjoint groups of cooperative small cells can emerge, we formulate the small cells' cooperation problem as a coalition formation game with overlapping coalitions. In this game, each small cell base station can choose to participate in one or more cooperative groups (or coalitions) simultaneously, so as to optimize the tradeoff between the benefits and costs associated with cooperation. We study the properties of the proposed overlapping coalition formation game and we show that it exhibits negative externalities due to interference. Then, we propose a novel decentralized algorithm that allows the small cell base stations to interact and self-organize into a stable overlapping coalitional structure. Simulation results show that the proposed algorithm results in a notable performance advantage in terms of the total system sum-rate, relative to the noncooperative case and the classical algorithms for coalitional games with non-overlapping coalitions