多天线中继网络中的终端性能和多样性分析

The performance of multi-antenna multi- relay cooperative system is investigated in this paper. Two relaying strategies, i.e., reactive and proactive strategies are analyzed with the Amplifyand- Forward (AF) and Decode-and-Forward (DF) protocols. We derive the Cumulative Distribution Function (CDF) of the received Signal-to-Noise Ratio (SNR) at the destination, which is used to calculate the exact outage probability, for both AF and DF protocols. According to these results, we conclude that a cooperative network which composes K relays each equipped with nr antennas can achieve maximal order-(2nrK+1) diversity gain, by proper processing at relays and destination. Furthermore, the performance comparison is given, in terms of outage probability. These two strategies outperform each other in different scenarios in AF protocol, whilst proactive strategy is always better than its counterpart in DF protocol. According to these results, the optimal power allocation schemes among relay nodes are also presented, with reasonable power constraint.     

Mixed AF and DF cooperative relay systems and their performance bounds analyses

This paper analyzes the performance bounds of a wireless relay system consisting of several relay stations working on both amplifier‐and‐forward (AF) and decode‐and‐forward (DF) protocols. We want to study the outage probability behavior of the proposed mixed AF and DF relay systems under independent Nakagami‐m fading channels. In particular, we will derive the lower and upper bounds of outage probability of the mixed AF and DF relay systems based on maximal ratio combining diversity reception. The results give optimal configuration of AF and DF relays under a specific channel condition, thus helping us to design an optimized mixed AF and DF relay system in a generic fading environment. The trade‐off between complexity and performance is discussed in this paper. In addition, we will use computer simulations to verify the effectiveness of the proposed mixed AF and DF relay configurations. Finally, the power allocation issues for such a mixed AF and DF relay system will also be discussed. Copyright © 2012 John Wiley & Sons, Ltd.     

基于过时信道状态信息的放大转发中继选择协议性能分析(英文)

The impact of outdated Channel State Information(CSI) on the performance of relay selections,including the partial relay selection and the best relay selection,is studied,with respect to Amplify-and-Forward(AF) mode cooperative systems.The proposed method is analysed by deriving the asymptotic closedform expressions for some figures of merit such as the outage probability and the Symbol Error Probability(SEP).Moreover,the validity of the proposed theoretical analysis is proven via simulations.Numerical results prove that the performance of the proposed scheme is impacted considerably by various parameters such as the number of candidate relays and the end-to-end Signal-to-Noise Ratio(SNR).In the presence of cooperative networks with outdated CSI feedback,a performance improvement of more than 3 dB in terms of either outage probability or SEP can be observed by utilizing the Source-to-Destination(S D) link rather than the method of simply increasing the number of relays.     

过时信道状态信息下的机会式中继选择系统的安全性能分析

在 Nakagami m衰落信道下,目的端和窃听者采用最大比合并策略,本文研究了在机会式自适应解码转发中继选择安全协作系统中的安全性能。由于实际信道中的反馈延迟,最优的合法中继选择基于合法信道反馈的过时信道状态信息。为了评价机会式中继选择在改善安全性能上的表现,分别推导了准确的正安全容量概率和准确的安全中断概率闭合表达式。此外,针对两种不同情况, 推导了形式简单的渐近表达式,并明确给出安全分集阶数和安全阵列增益。理论分析和数值仿真表明,增加中继个数和目的节点的天线数能够改善安全中断概率的性能表现,且在信道状态信息过时的条件下,系统的安全分集阶数与中继数无关。      

无线中继网络中基于矩阵几何方法的统一延时分析

A lot of work has been focused on designing and analyzing various cooperative diversity protocols for wireless relay networks. To provide a unified queuing analytic framework, we formulate an embedded Markov chain, which turns out to be a Quasi-Birth-and-Death (QBD) process. Using the Matrix-Geometric method, we can analyze the average delay in a unified way. Theoreti-cal analysis is validated by simulation results. We show that the delay performances of Amplify-and-Forward or Decode-and-Forward (AF/DF) and incremental AF/DF schemes can be analyzed in the unified way. Thus, we can always choose the best cooperative diversity scheme in different scenarios for delay minimization.     

Application of best relay selection approach to cooperative DF IDMA systems over Rayleigh/Weibull fading channels

This paper analyzes the performance of cooperative decode‐and‐forward (DF) interleave‐division multiple‐access (IDMA) networks with best relay selection over Rayleigh/Weibull fading environments. In the analysis, approximate outage probability (OP) and bit error probability (BEP) expressions are derived for the considered system. Further, a 2‐hop DF IDMA system is also designed to compare with cooperative one. We propose OP and BEP expression for 2‐hop DF IDMA systems. Numerical results are obtained by changing the number of relays and the value of fading parameter in the proposed expressions. Also, simulations are provided to corroborate the exactness of the derived approximate OP and BEP expressions.     

On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels

We propose novel cooperative transmission protocols for delay-limited coherent fading channels consisting of N (half-duplex and single-antenna) partners and one cell site. In our work, we differentiate between the relay, cooperative broadcast (down-link), and cooperative multiple-access (CMA) (up-link) channels. The proposed protocols are evaluated using Zheng-Tse diversity-multiplexing tradeoff. For the relay channel, we investigate two classes of cooperation schemes; namely, amplify and forward (AF) protocols and decode and forward (DF) protocols. For the first class, we establish an upper bound on the achievable diversity-multiplexing tradeoff with a single relay. We then construct a new AF protocol that achieves this upper bound. The proposed algorithm is then extended to the general case with (N-1) relays where it is shown to outperform the space-time coded protocol of Laneman and Wornell without requiring decoding/encoding at the relays. For the class of DF protocols, we develop a dynamic decode and forward (DDF) protocol that achieves the optimal tradeoff for multiplexing gains 0/spl les/r/spl les/1/N. Furthermore, with a single relay, the DDF protocol is shown to dominate the class of AF protocols for all multiplexing gains. The superiority of the DDF protocol is shown to be more significant in the cooperative broadcast channel. The situation is reversed in the CMA channel where we propose a new AF protocol that achieves the optimal tradeoff for all multiplexing gains. A distinguishing feature of the proposed protocols in the three scenarios is that they do not rely on orthogonal subspaces, allowing for a more efficient use of resources. In fact, using our results one can argue that the suboptimality of previously proposed protocols stems from their use of orthogonal subspaces rather than the half-duplex constraint.     

Cooperative HARQ protocol and diversity analysis of systems with multiple incremental relays

Wireless networks contain an inherent distributed spatial diversity that can be exploited by relays. Relay networks can take advantage of the broadcast-oriented nature of wireless transmission, but require more radio resource to transmit data for their multi-hop traits. Fortunately, incremental relaying technique, which can choose direct or multi-hop transmission adaptively, can efficiently utilize resource. In this article, the incremental transmission with amplify-and-forward (AF) relays is focused on. A practical hybrid-automatic retransmission request (HARQ) protocol is designed, and the related optimal relay selection strategy is proposed. To analyze the cooperative diversity of system with the proposed protocol, the capacity lower bound is deduced. Simulation and analytical results indicate that by adopting the optimal relay selection strategy, the system with the proposed HARQ protocol can achieve an order of cooperative diversity that equals the aggregated number of the relay and source nodes.     

On the performance of cooperative cognitive networks with proactive relay selection

This paper provides a general outage analysis framework for cooperative cognitive networks with proactive relay selection over non-identical Rayleigh fading channels and under both maximum transmit power and interference power constraints. We firstly propose an exact closed-form outage probability expression, which is then exploited for determining the diversity order and coding gain for proactive relay selection scenarios as well as deriving system performance limits at either large maximum transmit power or large maximum interference power. The derived performance metrics bring several insights into system performance behavior without the need of time-consuming Monte-Carlo simulations. Various results confirm the validity of the proposed derivations and show that cooperative cognitive networks with proactive relay selection incur performance saturation and their performance depends considerably on the number of involved relays. In addition, cooperative cognitive networks are significantly better than dual-hop counterparts without any cost of system resources.     

Cross-layer resource allocation over wireless relay networks for quality of service provisioning

The authors propose a physical-datalink cross-layer resource allocation scheme over wireless relay networks for quality-of-service (QoS) guarantees. By integrating information theory with the concept of effective capacity, the proposed scheme aims at maximizing the relay network throughput subject to a given delay QoS constraint. This delay constraint is characterized by the so-called QoS exponent thetas, which is the only requested information exchanged between the physical layer and the datalink layer in our cross-layer design based scheme. Over both amplify-and-forwards (AF) and decode-and-forward (DF) relay networks; the authors develop the associated dynamic resource allocation algorithms for wireless multimedia communications. Over DF relay network, the authors also study a fixed power allocation scheme to provide QoS guarantees. The simulations and numerical results verify that our proposed cross-layer resource allocation can efficiently support diverse QoS requirements over wireless relay networks. Both AF and DF relays show significant superiorities over direct transmissions when the delay QoS constraints are stringent. On the other hand, the results demonstrate the importance of deploying the dynamic resource allocation for stringent delay QoS guarantees.     

Performance Analysis of OSTBC Transmission in Amplify-and-Forward Cooperative Relay Networks

A performance analysis is presented for amplify-and-forward (AF) cooperative relay networks employing transmit antenna diversity with orthogonal space-time block codes (OSTBCs), where multiple antennas are equipped at the transmitter. We develop a symbol-error-rate (SER) and outage performance analysis for OSTBC transmissions with and without cooperative diversity over flat Rayleigh fading channels. We first derive exact probability density functions (pdf's) and cumulative distribution functions (cdf's) for the system SNR without direct transmission with an arbitrary number of transmit antennas and then present the exact closed-form SER and outage probability expressions. Next, we derive the moment-generating function (MGF) for the overall system SNR with direct transmission and present the exact SER and outage probability with joint transmit antenna diversity and cooperative diversity. The theoretical analysis is validated by simulations, which indicate an exact match between them. The results also show how the transmit antenna diversity and the cooperative diversity affect the overall system performance.      

Fading relay channels: performance limits and space-time signal design

Cooperative diversity is a transmission technique, where multiple terminals pool their resources to form a virtual antenna array that realizes spatial diversity gain in a distributed fashion. In this paper, we examine the basic building block of cooperative diversity systems, a simple fading relay channel where the source, destination, and relay terminals are each equipped with single antenna transceivers. We consider three different time-division multiple-access-based cooperative protocols that vary the degree of broadcasting and receive collision. The relay terminal operates in either the amplify-and-forward (AF) or decode-and-forward (DF) modes. For each protocol, we study the ergodic and outage capacity behavior (assuming Gaussian code books) under the AF and DF modes of relaying. We analyze the spatial diversity performance of the various protocols and find that full spatial diversity (second-order in this case) is achieved by certain protocols provided that appropriate power control is employed. Our analysis unifies previous results reported in the literature and establishes the superiority (both from a capacity, as well as a diversity point-of-view) of a new protocol proposed in this paper. The second part of the paper is devoted to (distributed) space-time code design for fading relay channels operating in the AF mode. We show that the corresponding code design criteria consist of the traditional rank and determinant criteria for the case of colocated antennas, as well as appropriate power control rules. Consequently space-time codes designed for the case of colocated multiantenna channels can be used to realize cooperative diversity provided that appropriate power control is employed.     

Using Orthogonal and Quasi-Orthogonal Designs in Wireless Relay Networks

Distributed space-time coding was proposed to achieve cooperative diversity in wireless relay networks without channel information at the relays. Using this scheme, antennas of the distributive relays work as transmit antennas of the sender and generate a space-time code at the receiver. It achieves the maximal diversity when the transmit power is infinitely large. This paper is on the design of practical distributed space-time codes (DSTCs). We use orthogonal and quasi-orthogonal designs which are originally used in the design of space-time codes for multiple-antenna systems. It is well known that orthogonal space-time codes have full diversity and linear decoding complexity. They are particularly suitable for transmissions in the network setting using distributed space-time coding since their ldquoscale-freerdquo property leads to good performance. Our simulations show that they achieve lower error rates than the random code. We also compare distributed space-time coding to selection decode-and-forward using the same orthogonal designs. Simulations show that distributed space-time coding achieves higher diversity than selection decode-and-forward (DF) when there is more than one relay. We also generalize the distributed space-time coding scheme to wireless relay networks with channel information at the relays. Although our analysis and simulations show that there is no improvement in the diversity, in some networks, having channel information at the relays saves both the transmission power and the transmission time.     

On optimum selection relaying protocols in cooperative wireless networks

In this letter, the outage probabilities of selection relaying protocols are analyzed and compared for cooperative wireless networks. It is assumed that both source and relay use equal allocated time in transmission. Depending on the quality of the source-relay channel, the relay may choose either Decode-and-Forward (DF), Amplify-and-Forward (AF), or Direct-Transmission (DT) to forward signals. It turns out that in terms of outage probability, two selection relaying schemes are better than others: selecting between DF and AF protocols (DF-AF) or selecting between DF and DT protocols (DF-DT). It is shown that with an equal power allocation, both of the DF-AF and DF-DT selection relaying protocols have the same asymptotic outage probability. However, with an optimum power allocation strategy, the DF-AF selection scheme is in general better than the DF-DT selection scheme. Note that the optimum power allocations depend on channel variances, not on instantaneous channel gains. When the quality of the relay-destination link is much better than that of the source-relay link, observed from simulation, the outage probability of the DF-AF selection protocol with its optimum power allocation is 1.5dB better than that of the DF-DT selection with its own optimum power allocation. Extensive simulations are presented to validate the analytical results.     

无线协作网络中的最优中继选择方案及中断概率分析

从物理层安全的角度出发,在含有协作中继的通信网络中,通过选择最优中继来传递信息可有效提升系统性能。讨论了在含有多个单天线窃听用户的多中继通信系统中对最优中继的选择方案,并对系统采用放大转发（amplify-and-forward,AF）协议和解码转发（decode-and-forward,DF）协议这两种不同的情况分别进行了讨论和比较,同时还对比了不含中继的直接传输情况。理论分析和仿真结果表明,最优中继选择方案可有效保障系统的安全性能。     

Delay Analysis of Cooperative Truncated HARQ With Opportunistic Relaying

In this paper, we evaluate the delay experienced by Poisson arriving packets for cooperative truncated hybrid automatic repeat request (HARQ) with opportunistic relaying. We derive the theoretical expressions of the expected waiting time and the packet's sojourn time in the queue of truncated opportunistic cooperative ARQ, HARQ I with and without packet combining (PC), and HARQ II with code combining (CC). The analysis is valid for block Nakagami- $m$ fading channels and any number of relays for both amplify-and-forward (AF) and decode-and-forward (DF) relaying. In opportunistic AF cooperative HARQ, packet retransmission is done by the relay offering the highest instantaneous signal-to-noise ratio (SNR) of the relaying link (source–relay–destination). In opportunistic DF cooperative HARQ, retransmission is done by the relay offering the highest instantaneous SNR of the relay–destination link among the relays that have correctly decoded the transmitted packet by the source. If no relay has correctly decoded, the retransmission is made by the source. Simulation results are also provided to verify the tightness of the derived expressions. The results indicate a significant improvement of packet delivery delays when compared with the absence of cooperation.      

混合中继转发机制下的资源分配

在基于放大转发( AF)和译码转发( DF)的混合中继转发机制模型下,为了使系统获得最大和速率,提出了相应的资源分配方案,在子载波对混合中继协议的判断选择和最优功率分配算法的基础上讨论了等效信道增益模型和非等效信道增益模型。在非等效信道增益模型中,为了降低计算复杂度提出了一种次优算法。在该机制模型下,系统自适应地选择AF或者DF转发,既克服了两种单一转发模式存在的弊端,又能获得更大的和速率,从而提高了资源利用率。仿真结果表明,当系统功率等因素变化时,该分配方案下的混合中继转发模型与传统的AF和DF模型相比系统和速率分别提高了60%和8%以上,充分说明了该系统的优越性。     

Energy Efficient Relay Placement in Dual Hop 802.15.4 Networks

IEEE 802.15.4 has emerged as a popular standard for short range wireless sensor networks used in industrial, military, health, and environmental sectors. The limited lifetime of such networks is one of the critical design challenges. This paper examines the how relaying through intermediate sensor nodes can enhance the lifetime of an 802.15.4 network. In particular, novel energy consumption models for both AF and DF relays have been developed. Different relay gain scaling mechanisms and forwarding strategies under each of the relay categories were also considered and their energy efficiencies were compared. For every relaying protocol, it was found that there exists an optimum location where energy saving is maximum and this location is not necessarily different for different modes. In summary, it has been observed that the optimum location for AF relays is the equidistant point from source and destination. In contrast, the optimal location for DF relays is closer to source. The effect of different PHY level (outage probability, path loss) and MAC level parameters (frame length) on the energy efficiency are also studied.     

基于中继放大转发的多天线基站下行传输性能分析

研究基站具有多根天线、中继与用户具有单天线的中继放大转发多用户系统,利用正交空时分组编码和机会主义调度策略同时获得空间分集和多用户分集.针对自适应增益和固定增益转发策略,首先导出独立不同分布瑞利衰落下系统中断概率和误码率的闭合表达式;随后根据高信噪比下系统的渐近性能确定系统的分集阶数,分析空间分集和多用户分集对系统性能的联合影响,并与单跳多天线基站下行传输系统进行性能比较;最后利用计算机仿真验证理论分析结果的正确性.     

Adaptive multi-node incremental relaying for hybrid-ARQ in AF relay networks

This paper proposes an adaptive multi-node incremental relaying technique in cooperative communications with amplify-and-forward (AF) relays. In order to reduce the excessive burden of MRC with all diversity paths at the destination node, the destination node decides if it combines signals over the first Ν(< Κ) time slots/frames or over all of the Κ times slots, where Κis the number of relay nodes. Our analytical and simulation results show that the proposed adaptive multi-node incremental relaying outperforms the conventional MRC in terms of outage probability in AF based cooperative communications since the proposed scheme effectively reduces the spectral efficiency loss. Our asymptotic analysis also shows that the proposed adaptive multi-node incremental relaying achieves full diversity order Κ+ 1.