Joint impact of nodes-mobility and channel estimation error on the performance of two-way relay systems

This paper presents the performance analysis of a two-way relay system with nodes-mobility (NM) and channel estimation errors (CEE) under time-varying Rayleigh fading. Herein, analog network coding protocol is employed at the relay node. All the participating nodes are half-duplex and equipped with single-antenna devices. Specifically, we utilize first-order Markovian model to characterize the impact of NM in the channel. Along with the NM, we also consider that the CEE may exist in practical scenarios, where nodes require to estimate the channel state information. By incorporating these factors, we first derive the instantaneous end-to-end (e2e) signal-to-noise ratios (SNRs) at two source nodes. Then, we obtain the exact closed-form expressions for distribution and density functions of the two e2e SNRs. After that, we derive the accurate expressions of various performance metrics, viz., sum-bit error rate, overall outage probability, and ergodic sum-rate. Further, to attain more insights into the considered system, we deduce the asymptotic behavior of these performance metrics. Finally, numerical and Monte-Carlo simulation results are provided to validate our theoretical analysis and to illustrate the impact of NM and CEE on the performance measures of the considered system.     

Performance analysis of opportunistic nonregenerative relaying

Opportunistic relaying in cooperative communication depends on careful relay selection. However, the traditional centralized method used for opportunistic amplify‐and‐forward protocols requires precise measurements of channel state information at the destination. In this paper, we adopt the max–min criterion as a relay selection framework for opportunistic amplify‐and‐forward cooperative communications, which was exhaustively used for the decode‐and‐forward protocol, and offer an accurate performance analysis based on exact statistics of the local signal‐to‐noise ratios of the best relay. Furthermore, we evaluate the asymptotical performance and deduce the diversity order of our proposed scheme. Finally, we validate our analysis by showing that performance simulation results coincide with our analytical results over Rayleigh fading channels, and we compare the max–min relay selection with their centralized channel state information‐based and partial relay selection counterparts. Copyright © 2013 John Wiley & Sons, Ltd.     

Cognitive amplify‐and‐forward relay networks with beamforming under primary user power constraint over Nakagami‐m fading channels

In this paper, we analyze the performance of cognitive amplify‐and‐forward (AF) relay networks with beamforming under the peak interference power constraint of the primary user (PU). We focus on the scenario that beamforming is applied at the multi‐antenna secondary transmitter and receiver. Also, the secondary relay network operates in channel state information‐assisted AF mode, and the signals undergo independent Nakagami‐m fading. In particular, closed‐form expressions for the outage probability and symbol error rate (SER) of the considered network over Nakagami‐m fading are presented. More importantly, asymptotic closed‐form expressions for the outage probability and SER are derived. These tractable closed‐form expressions for the network performance readily enable us to evaluate and examine the impact of network parameters on the system performance. Specifically, the impact of the number of antennas, the fading severity parameters, the channel mean powers, and the peak interference power is addressed. The asymptotic analysis manifests that the peak interference power constraint imposed on the secondary relay network has no effect on the diversity gain. However, the coding gain is affected by the fading parameters of the links from the primary receiver to the secondary relay network. Copyright © 2012 John Wiley & Sons, Ltd.     

Opportunistic Multi-Access: Multiuser Diversity, Relay-Aided Opportunistic Scheduling, and Traffic-Aided Smooth Admission Control

We study multi-access control in opportunistic communication systems, and propose two new schemes to address channel asymmetry and throughput-guaranteed admission control, respectively. We first devise a relay-aided opportunistic scheduling (RAOS) scheme, in which a user can choose to communicate with the base station either directly or using multiple hops (relay transmissions). We develop relay/direct link construction algorithms using either a channel-capacity-based criterion or a throughput-based criterion, and devise opportunistic scheduling schemes accordingly. Our results show that in the presence of channel asymmetry across users, the RAOS scheme performs significantly better than Qualcomm's HDR scheme. Next, we propose a traffic-aided smooth admission control (SAC) scheme that aims to guarantee throughput provisioning. Simply put, in the SAC scheme, the admission decision is spread over a trial period, by increasing gradually the amount of the time resource allocated to incoming users. Specifically, using the modified weighted proportional fair (WPF) scheduling, we devise a QoS driven weight adaptation algorithm, and the weights assigned to new users are increased in a guarded manner. Then an admission decision is made based on the measured throughput within a time-out window. A key feature is that we exploit explicitly the traffic information and throughput requirements in devising the back-off time. Our results show that the proposed SAC scheme works well in opportunistic communication systems.     

Error rate performance analysis of dual-hop relaying transmissions over generalized-K fading channels

In this paper we present analytical expressions for the lower bounds of the error performance of dual-hop amplify-and-forward transmissions over independent and not necessarily identical Generalized-K fading channels. Using a tight upper bound for the end-to-end SNR, a novel expression for the probability density function is derived. Based on the abovementioned formula, tight lower bounds for the average bit error probability for a variety of modulation schemes are derived. In order to validate the accuracy of the proposed mathematical analysis, various numerical and computer simulation results are presented.     

Diversity-and-multiplexing tradeoff and throughput of superposition coding relaying strategy

While the Network Coding cooperative relaying (NC-relaying) has the merit of high spectral ef-ficiency, Superposition Coding relaying (SC-relaying) has the merit of high throughput. In this paper, a novel concept, coded cooperative relaying, is presented, which is a unified scheme of the NC-relaying and SC-relaying. For the SC-relaying strategy which can be considered one-way coded relaying scheme with multi-access channel, the close-form solution of the outage probabilities of the basic signal and additional signal are obtained firstly. Secondly, the Diversity-and-Multiplexing Tradeoff (DMT) characteristics of ba-sic signal and additional signal are investigated entirely as well as the optimal close-form solutions. The compared numerical analysis shows the evaluation error of throughput based on the close-form solution is about 0.15 nats, which is within the acceptable error range. Due to the mutual effect between the both source signals, the available maximal values of the two multiplexing gains are less than 1.     

Spectral efficient half-duplex relaying with interference suppression

Two-hop relaying systems suffer spectral efficiency loss due to the half-duplex property of relays. This paper proposes an efficient relaying protocol which can recover the spectral efficiency loss but still work with half-duplex relays. However, there exists inter-relay interference which degrades the performance of the protocol. With this consideration, a power control policy is derived to suppress the interference using game theory, and then an algorithm is given to facilitate distributed implementation. Furthermore, impact of deploying more destination antennas on performance of the relaying protocol is investigated. Simulation results show that, with the power control policy, the proposed relaying protocol can achieve high spectral efficiency.     

一种机会协作重传协议及其性能分析模型研究

 本文基于机会中继协作通信系统的优良特性,改进了传统的多中继ARQ(Automatic Repeat Request)协作分集机制,联合物理层与数据链路层优化了无线频谱与能量的利用率,并且首次提出了采用Markov(马尔可夫)吸收链方法的端到端性能分析模型.在此分析模型的基础上,对本文改进的机会协作重传协议进行了端到端成功传输概率、丢包率、时延、吞吐量等性能参数的数值分析,最后用仿真实验对此模型进行了验证,详细讨论了最大重传次数、信道衰落参数、总发送功率等对性能的影响.结果表明,本文改进的机会协作重传协议在节能、抗信道衰落方面,表现出了比直接重传协议和传统的多中继协作重传协议具有更优越的性能.     

Optimal resource allocation scheme for cognitive radio networks with relay selection based on game theory

In this paper,we present a non-transferable utility coalition graph game(NTU-CGG) based resource allocation scheme with relay selection for a downlink orthogonal frequency division multiplexing(OFDMA) based cognitive radio networks to maximize both system throughput and system fairness.In this algorithm,with the assistance of others SUs,SUs with less available channels to improve their throughput and fairness by forming a directed tree graph according to spectrum availability and traffic demands of SUs.So this scheme can effectively exploit both space and frequency diversity of the system.Performance results show that,NTU-CGG significantly improves system fairness level while not reducing the throughput comparing with other existing algorithms.