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

Radio resource allocation in relay based OFDMA cellular networks

PhDAdding relay stations (RS) between the base station (BS) and the mobile stations (MS) in a cellular system can extend network coverage, overcome multi-path fading and increase the capacity of the system. This thesis considers the radio resource allocation scheme in relay based cellular networks to ensure high-speed and reliable communication. The goal of this research is to investigate user fairness, system throughput and power consumption in wireless relay networks through considering how best to manage the radio resource. This thesis proposes a two-hop proportional fairness (THPF) scheduling scheme fair allocation, which is considered both in the first time subslot between direct link users and relay stations, and the second time subslot among relay link users. A load based relay selection algorithm is also proposed for a fair resource allocation. The transmission mode (direct transmission mode or relay transmission mode) of each user will be adjusted based on the load of the transmission node. Power allocation is very important for resource efficiency and system performance improvement and this thesis proposes a two-hop power allocation algorithm for energy efficiency, which adjusts the transmission power of the BS and RSs to make the data rate on the two hop links of one RS match each other. The power allocation problem of multiple cells with inter-cell interference is studied. A new multi-cell power allocation scheme is proposed from non-cooperative game theory; this coordinates the inter-cell interference and operates in a distributed manner. The utility function can be designed for throughput improvement and user fairness respectively. Finally, the proposed algorithms in this thesis are combined, and the system performance is evaluated. The joint radio resource allocation algorithm can achieve a very good tradeoff between throughput and user fairness, and also can significantly improve energy efficiency

Weighted Sum Rate Maximization for Downlink OFDMA with Subcarrier-pair based Opportunistic DF Relaying

This paper addresses a weighted sum rate (WSR) maximization problem for downlink OFDMA aided by a decode-and-forward (DF) relay under a total power constraint. A novel subcarrier-pair based opportunistic DF relaying protocol is proposed. Specifically, user message bits are transmitted in two time slots. A subcarrier in the first slot can be paired with a subcarrier in the second slot for the DF relay-aided transmission to a user. In particular, the source and the relay can transmit simultaneously to implement beamforming at the subcarrier in the second slot. Each unpaired subcarrier in either the first or second slot is used for the source's direct transmission to a user. A benchmark protocol, same as the proposed one except that the transmit beamforming is not used for the relay-aided transmission, is also considered. For each protocol, a polynomial-complexity algorithm is developed to find at least an approximately optimum resource allocation (RA), by using continuous relaxation, the dual method, and Hungarian algorithm. Instrumental to the algorithm design is an elegant definition of optimization variables, motivated by the idea of regarding the unpaired subcarriers as virtual subcarrier pairs in the direct transmission mode. The effectiveness of the RA algorithm and the impact of relay position and total power on the protocols' performance are illustrated by numerical experiments. The proposed protocol always leads to a maximum WSR equal to or greater than that for the benchmark one, and the performance gain of using the proposed one is significant especially when the relay is in close proximity to the source and the total power is low. Theoretical analysis is presented to interpret these observations.Comment: 8 figures, accepted and to be published in IEEE Transactions on Signal Processing. arXiv admin note: text overlap with arXiv:1301.293