Distributed differential space-time coding for wireless relay networks

Distributed space-time coding is a cooperative transmission scheme for wireless relay networks. With 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 maximum diversity. Although the scheme needs no channel information at relays, it does require full channel information, both the channels from the transmitter to relays and the channels from relays to the receiver, at the receiver. In this paper, we propose a differential transmission scheme, which requires channel information at neither relays nor the receiver, for wireless relay networks. As distributed space-time coding can be seen as the counterpart of space-time coding in the network setting, this scheme is the counterpart of differential space-time coding. Compared to coherent distributed space-time coding, the differential scheme is 3dB worse. In addition, we show that Alamouti, square real orthogonal, and Sp(2) codes can be used differentially in networks with corresponding numbers of relays. We also propose distributed differential space-time codes that work for networks with any number of relays using circulant matrices.     

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.     

Cyclic Distributed Space–Time Codes for Wireless Relay Networks With No Channel Information

In this paper, we present a coding strategy for half duplex wireless relay networks, where we assume no channel knowledge at any of the transmitter, receiver, or relays. The coding scheme uses distributed space-time coding, that is, the relay nodes cooperate to encode the transmitted signal so that the receiver senses a space-time codeword. It is inspired by noncoherent differential techniques. The proposed strategy is available for any number of relays nodes. It is analyzed, and shown to yield a diversity linear in the number of relays. We also study the resistance of the scheme to relay node failures, and show that a network with R relay nodes and d of them down behaves, as far as diversity is concerned, as a network with R-d nodes. Finally, our construction can be easily generalized to the case where the transmitter and receiver nodes have several antennas.     

基于协作通信的最佳中继选择方案

协作通信中的机会中继是一种基于即时信道状态选择的中继选择算法,可以获得与传统协作分集技术相同的分集增益,而不需要使用复杂的空时编码技术。但是多个节点同时竞争最佳中继时,可能出现冲突而导致选择失败。提出一种新的方案,通过引入候选节点限制策略以及控制信道对算法进行改进,仿真表明,该算法特别适用于候选中继较多的情况,可以在实现快速选择节点的同时降低选择失败概率。     

多接入中继信道中的单中继选择

研究表明,协作中继选择能提高无线中继网络的鲁棒性和能效。文中研究一个多接入中继信道,包含2个信源,N个中继和1个信宿。中继节点为半双工,对两个信源的信号采用非再生的网络编码。考虑直接链路,基于最佳最差信道、最佳信噪比和最佳调和平均选择,提出新的选择策略。仿真结果表明其在性能上优于原有策略。     

Diversity–Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks

Synchronization of relay nodes is an important and critical issue in exploiting cooperative diversity in wireless networks. In this paper, two asynchronous cooperative diversity schemes are proposed, namely, distributed delay diversity and asynchronous space-time coded cooperative diversity schemes. In terms of the overall diversity-multiplexing (DM) tradeoff function, we show that the proposed independent coding based distributed delay diversity and asynchronous space-time coded cooperative diversity schemes achieve the same performance as the synchronous space-time coded approach which requires an accurate symbol-level timing synchronization to ensure signals arriving at the destination from different relay nodes are perfectly synchronized. This demonstrates diversity order is maintained even at the presence of asynchronism between relay node. Moreover, when all relay nodes succeed in decoding the source information, the asynchronous space-time coded approach is capable of achieving better DM tradeoff than synchronous schemes and performs equivalently to transmitting information through a parallel fading channel as far as the DM tradeoff is concerned. Our results suggest the benefits of fully exploiting the space-time degrees of freedom in multiple antenna systems by employing asynchronous space-time codes even in a frequency-flat-fading channel. In addition, it is shown asynchronous space-time coded systems are able to achieve higher mutual information than synchronous space-time coded systems for any finite signal-to-noise ratio (SNR) when properly selected baseband waveforms are employed.     

Asymptotic Distortion Performance of Source-Channel Diversity over Multihop and Relay Channels

A key challenge in the design of real-time wireless multimedia systems is the presence of fading coupled with strict delay constraints. A very effective answer to this problem is the use of diversity achieving techniques to overcome the fading nature of the wireless channels caused by the mobility of the nodes. The mobility of the nodes gives rise to the need of cooperation among the nodes to enhance the system performance. This paper focuses on comparing systems that exhibit diversity of three forms: source coding diversity, channel coding diversity, and user cooperation diversity implemented through multihop or relay channels with amplify-and-forward or decode-and-forward protocols. Commonly used in multimedia communications, performance is measured in terms of the distortion exponent, which measures the rate of decay of the end-to-end distortion at asymptotically high signal-to-noise ratio (SNR). For the case of repetition coding at the relay nodes, we prove that having more relays is not always beneficial. For the general case of having a large number of relays that can help the source using repetition coding, the optimum number of relay nodes that maximizes the distortion exponent is determined in this paper. This optimum number of relay nodes will depend on the system bandwidth as well as the channel quality. The derived result shows a trade-off between the quality (resolution) of the source encoder and the amount of cooperation (number of relay nodes). Also, the performances of the channel coding diversity-based scheme and the source coding diversity-based scheme are compared. The results show that for both relay and multihop channels, channel coding diversity provides the best performance, followed by the source coding diversity.     

Partially-coherent distributed space-time codes with differential encoder and decoder

Distributed space-time coding is a mean of achieving diversity through cooperative communication in a wireless relay network. In this paper, we consider a transmission protocol that follows a two-stage model: transmission from source to relays in the first stage, followed by a simple relaying technique from relays to destination. The relays transmit a vector which is a transformation of the received vector by a relay-specific unitary transformation. We assume that the relays do not have any channel information, while the destination has only a partial-channel knowledge, by which we mean that destination knows only the relay-to-destination channel. For such a setup, we derive a Chernoff bound on the pairwise error probability and propose code design criteria. A second contribution is the differential encoding and decoding scheme for this setup, which is different from the existing ones. Furthermore, differential codes from cyclic division algebra are proposed that achieve full diversity. For our setup with two relays, a Generalized PSK code is shown to achieve full diversity, for which the decoding complexity is independent of code size     

Distributed Space-Time Codes Using Constellation Rotation

Rate and diversity impose a fundamental tradeoff in wireless communication. We propose a novel distributed space-time coding (DSTC) scheme based on constellation rotation (DSTC-CR) for Amplify-and-Forward relay networks. The proposed code can achieve full-diversity or full-rate, and also offers a flexibility for a desired rate-diversity tradeoff. This code can work well with arbitrary signal constellation and any number of relays and achieve minimal-delay. Through analysis of pairwise error probability, coding design criteria, Chernoff bound, decoding strategies and optimal power allocation are provided. Simulation results show that DSTC-CR scheme outperforms diagonal DSTC (DDSTC) and distributed linear dispersion (DLD) code at high power. From the comparison with DDSTC, the DSTC-CR scheme can achieve the same information rate using a lower modulation order.     

Distributed Space-Time Cooperative Systems with Regenerative Relays

This paper addresses some of the opportunities and the challenges in the design of multi-hop systems that utilize cooperation with one or two intermediate regenerative relays to provide high-quality communication between a source and a destination. We discuss the limitations of using a distributed Alamouti scheme in the relay channel and the additional complexity required to overcome its loss of diversity. As an alternative to the distributed Alamouti scheme, we propose and analyze two error aware distributed space-time (EADST) systems built around the Alamouti code. First, using a bit error rate based relay selection approach, we design an EADST system with one and two regenerative relays that rely on feedback from the destination and we show that the proposed system improves on the distributed Alamouti scheme. In addition, we prove that the proposed one relay EADST system collects the full diversity of the distributed MISO channel. Second, we introduce an EADST system without feedback in which the relaying energies depend on the error probabilities at the relays. Numerical results show that both EADST systems perform close to the error probability lower bound obtained by considering error-free reception at the relays     

基于准正交空时分组码的多中继协作方案

根据准正交空时分组码提出了一种基于选择中继协议的多中继协作方案。从两个方面讨论了该方案的空间分集性能,通过分析成对差错概率证明,若所有的中继都正确译码,该方案可以获得全分集增益;若某些中继不能正确译码,该方案仍可以获得部分分集增益。将所提方案与使用正交空时分组码的协作方案进行比较,仿真结果表明,在信噪比较高时,两个方案都可获得全分集增益,但所提方案具有更高的编码增益。而当信噪比变低时,所提方案具有更高的分集增益和编码增益。     

Co-operative diversity based on distributed coding schemes in wireless networks

This paper examines both research and development challenges in the area of co-operative diversity for enhancing channel capacity in wireless communications networks. In particular, the role played by the distributed coding protocols in achieving diversity gains is investigated in connection with the co-operative communications model built via relay channels. A coding scheme suitable for the nodes working collaboratively in this environment is also presented.     

一种基于源端网络编码和交替传输的中继协作方案

针对源节点通过两个中继向目的节点发送数据的无线通信系统,为了减小传统中继协作方案的复用损失,提出了一种将源端网络编码和交替传输有效结合起来的新方案,称为交替源端网络编码(SSNC)。该方案在源端每三个时隙对发送数据进行一次网络编码,并且两个中继在相邻的时隙中交替的发送和接收数据,每个时隙中,一个中继接收源端数据的同时另一个中继转发上一个时隙其接收到的数据给目的端。通过对该方案的中断概率和分集复用折中性能的推导和分析,发现该方案相对于传统的重复编码和分布式空时码方案在获得相同分集阶数的情况下有更高的传输效率,在实际的通信系统中可以兼顾性能和效率。仿真结果证实了我们的结论。      

Decode-to-cooperate: a sequential alamouti-coded cooperation strategy in dual-hop wireless relay networks

An optimal cooperation strategy, decode-to-cooperate, is proposed and investigated for performance improvements in dual-hop wireless relay networks. Based on decode-and-forward (DF) strategy with multiple relay selection, we design a novel scheme such that the source node keeps transmitting sequentially and the selected relays cooperate by transmitting the decoded signal using distributed Alamouti coding. We exploit the multipath propagation effect of the wireless channel to achieve lower probability of error and introduce optimum power allocation and relay positioning. We analyze the scenario when the source to destination direct link is not available and derive a closed form expression for symbol error rate (SER), its upper bound and an asymptotically tight approximation to exploit the performance gain by selecting the optimum relays in a multiple-relay cooperation scheme. Moreover, asymptotic optimum power allocation (based on the SER approximation) and optimal relay positioning are also considered to further improve the SER. The proposed relay selection scheme outperforms cooperative (DF) and non-cooperative schemes by more than 2 dB.     

分布式环境中协作分集的移动中继动态选择和切换策略研究

在协作无线通信系统中,中继节点的移动会大大降低系统的性能,目前该方面的结果很少。本文探讨分布式环境中协作分集的移动中继选择算法,在放大转发（AF）协作通信模式下,给出了基于信道统计状态信息的功率分配和中继的动态选择策略。针对单中继情况提出了中继切换方案,针对多中继情况提出了动态剔除、补充中继的方案,并导出了分集增益及系统容量的计算公式。通过模拟仿真分析,该方案能有效的降低中断概率,提高系统分集增益,扩大系统容量,实现良好的整体性能。      

一种利用跨层优化策略选择中继的协作路由算法

该文提出了一种新的中继选择的协作路由算法,该算法利用网络的路由包获得信道的信息,通过分布式计算从候选中继集合中选择出一个最佳中继转发数据。在分层的无线网络中,中继选择的实现包括了时间同步和跨层优化等。仿真结果表明,相对于DSDV协议,该文所提出的算法有效地提高了数据包的递交率并有效地降低了网络的时延。     

On the performance of multi‐hop wireless relay networks

User cooperation has evolved as a popular coding technique in wireless relay networks (WRNs). Using the neighboring nodes as relays to establish a communication between a source and a destination achieves an increase of the diversity order. The relay nodes can be seen as a distributed multi‐antenna system, which can be exploited for transmit diversity by using distributed space–time block coding (STBC). In this paper, we investigate the bit error rate (BER) of multi‐hop WRNs employing distributed STBC at the relay nodes. We develop the general model of WRNs using distributed STBC, and we derive the pairwise error probability and an approximation of the BER. We examine the impact of several parameters, such as distributed STBC at the relays, the number of relays, the distances between the nodes, and the channel state information available at the receivers, on the BER performance of the multi‐hop WRN. The obtained results provide guidelines about the expected error performance and the design of channel estimation for these networks. Copyright © 2011 John Wiley & Sons, Ltd.     

Distributed space-time coding scheme with differential detection and power allocation for cooperative relay network

By introducing orthogonal space-time coding (STC) scheme in wireless cooperative relay network, two distributed differential STC (DSTC) schemes based on the amplify-and-forward (AF) and decode-and- forward (DF) methods are, respectively, developed. The scheme performance is investigated in symmetric and asymmetric wireless relay networks. The presented schemes require no channel information at both relay terminals and destination terminal, and have linear decoding complexity when compared with the existing scheme. Moreover, they are suitable for the application of different constellation modulations and DSTC schemes, and thus provide more freedoms of design. Besides, the power allocations between source and relay terminals are jointly optimized to minimize the system pairwise error probability for symmetric and asymmetric networks, and two practical methods are presented to solve the complicated optimized problem from asymmetric network. Simulation results show that the scheme with DF method has better performance than that with AF method due to no amplification of noise power, but the performance superiority will decrease at high SNR due to the error propagation of decoding at the relays. Furthermore, the distributed DSTC schemes with optimal power allocation have better performance than those with conventional fixed power allocation.     

Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks

We develop and analyze space-time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network. The protocols exploit spatial diversity available among a collection of distributed terminals that relay messages for one another in such a manner that the destination terminal can average the fading, even though it is unknown a priori which terminals will be involved. In particular, a source initiates transmission to its destination, and many relays potentially receive the transmission. Those terminals that can fully decode the transmission utilize a space-time code to cooperatively relay to the destination. We demonstrate that these protocols achieve full spatial diversity in the number of cooperating terminals, not just the number of decoding relays, and can be used effectively for higher spectral efficiencies than repetition-based schemes. We discuss issues related to space-time code design for these protocols, emphasizing codes that readily allow for appealing distributed versions.     

High throughput relay policy in wireless cooperative relaying networks based on stochastic control theory

This paper proposes a distributed relay and modulation and coding scheme (MCS) selection in wireless cooperative relaying networks where the adaptive modulation and coding (AMC) scheme is applied. First-order finite-state Markov channels (FSMCs) are used to model the wireless channels and make prediction. The objective of the relay policy is to select one relay and MCS among different alternatives in each time-slot according to their channel state information (CSI) with the goal of maximizing the throughput of the whole transmission period. The procedure of relay and MCS selection can be formulated as a discounted Markov decision chain, and the relay policy can be obtained with recent advances in stochastic control algorithms. Simulation results are presented to show the effectiveness of the proposed scheme.