Low Complexity Joint Sub-Carrier Pairing, Allocation and Relay Selection in Cooperative Wireless Networks

Multi-carrier cooperative relay-based wireless communication is of particular interest in future wireless networks. In this paper we present resource allocation algorithm in which sub-carrier pairing is of particular interest along with fairness constraint in multi-user networks. An optimization of sub-carrier pair selection is formulated through capacity maximization problem. Sub-carrier pairing is applied in both two-hop Amplify & Forward (AF) and Decode & Forward (DF) cooperative multi-user networks. We develop a less complex centralized scheme for joint Sub-carrier pairing and allocation along with relay selection. The computational complexity of the proposed algorithms has been analyzed and performance is compared with Exhaustive Search Algorithm

Linear physical-layer network coding and information combining for the K-user fading multiple-access relay network

© 2002-2012 IEEE. We propose a new linear physical-layer network coding (LPNC) and information combining scheme for the K -user fading multiple-access relay network (MARN), which consists of K users, one relay, and one destination. The relay and the destination are connected by a rate-constraint wired or wireless backhaul. In the proposed scheme, the K users transmit signals simultaneously. The relay and the destination receive the superimposed signals distorted by fading and noise. The relay reconstructs L linear combinations of the K users' messages, referred to as network-coded (NC) messages, and forwards them to the destination. The destination then attempts to recover all K users' messages by combining its received signals and the NC messages obtained from the relay. We develop an explicit expression on the selection of the coefficients of the NC messages at the relay that minimizes the end-to-end error probability at a high signal-to-noise ratio. We develop a channel-coded LPNC scheme by using an irregular repeat-accumulate modulation code over GF( q ). An iterative belief-propagation algorithm is employed to compute the NC messages at the relay, while a new algorithm is proposed for the information combining decoding at the destination. We demonstrate that our proposed scheme outperforms benchmark schemes significantly in both un-channel-coded and channel-coded MARNs

Subcarrier Pairing as Channel Gain Tailoring: Joint Resource Allocation for Relay-Assisted Secure OFDMA with Untrusted Users

Joint resource allocation involving optimization of subcarrier allocation, subcarrier pairing (SCP), and power allocation in a cooperative secure orthogonal frequency division multiple access (OFDMA) communication system with untrusted users is considered. Both amplify and forward (AF), and decode and forward (DF) modes of operations are considered with individual power budget constraints for source and relay. After finding optimal subcarrier allocation for an AF relayed system, we prove the joint power allocation as a generalized convex problem, and solve it optimally. Compared to the conventional channel gain matching view, the optimal SCP is emphasized as a novel concept of channel gain tailoring. We prove that the optimal SCP pairs subcarriers such that the variance among the effective channel gains is minimized. For a DF relayed system, we show that depending on the power budgets of source and relay, SCP can either be in a subordinate role where it improves the energy efficiency, or in a main role where it improves the spectral efficiency of the system. In an AF relayed system we confirm that SCP plays a crucial role, and improves the spectral efficiency of the system. The channel gain tailoring property of SCP, various roles of SCP in improving the spectral and the energy efficiency of a cooperative communication system are validated with the help of simulation results