Exact Outage Performance Analysis of Multiuser Multi-relay Spectrum Sharing Cognitive Networks

In this paper, we investigate the outage performance of dual-hop multiuser multi-relay cognitive radio networks under spectrum sharing constraints. Using an efficient relay-destination selection scheme, the exact and asymptotic closed-form expressions for the outage probability are derived. From these expressions it is indicated that the achieved diversity order is only determined by the number of secondary user (SU) relays and destinations, and equals to M+N (where M and N are the number of destination nodes and relay nodes, respectively). Further, we find that the coding gain of the SU network will be affected by the interference threshold $bar I$ at the primary user (PU) receiver. Specifically, as the increases of the interference threshold, the coding gain of the considered network approaches to that of the multiuser multi-relay system in the non-cognitive network. Finally, our study is corroborated by representative numerical examples

Optimization Framework and Graph-Based Approach for Relay-Assisted Bidirectional OFDMA Cellular Networks

This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using OFDMA for both uplink and downlink. The goal is to improve the overall system performance by exploring the full potential of the network in various dimensions including user, subcarrier, relay, and bidirectional traffic. In this work, we first introduce a novel three-time-slot time-division duplexing (TDD) transmission protocol. This protocol unifies direct transmission, one-way relaying and network-coded two-way relaying between the BS and each MS. Using the proposed three-time-slot TDD protocol, we then propose an optimization framework for resource allocation to achieve the following gains: cooperative diversity (via relay selection), network coding gain (via bidirectional transmission mode selection), and multiuser diversity (via subcarrier assignment). We formulate the problem as a combinatorial optimization problem, which is NP-complete. To make it more tractable, we adopt a graph-based approach. We first establish the equivalence between the original problem and a maximum weighted clique problem in graph theory. A metaheuristic algorithm based on any colony optimization (ACO) is then employed to find the solution in polynomial time. Simulation results demonstrate that the proposed protocol together with the ACO algorithm significantly enhances the system total throughput.Comment: 27 pages, 8 figures, 2 table