4,380 research outputs found
Modified quasi-orthogonal space-time block coding in distributed wireless networks
Cooperative networks have developed as a useful technique that can achieve the same advantage as multi-input and multi-output (MIMO) wireless systems such as spatial diversity, whilst resolving the difficulties of co-located multiple antennas at individual nodes and avoiding the effect of path-loss and shadowing. Spatial diversity in cooperative networks is known as cooperative diversity, and can enhance system reliability without sacrificing the scarce bandwidth resource or consuming more transmit power. It enables single-antenna terminals in a wireless relay network to share their antennas to form a virtual antenna array on the basis of their distributed locations. However, there remain technical challenges
to maximize the benefit of cooperative communications, e.g. data rate, asynchronous transmission and outage.
In this thesis, therefore, firstly, a modified distributed quasi-orthogonal space-time block coding (M-D-QO-STBC) scheme with increased code gain distance (CGD) for one-way and two-way amplify-and-forward wireless relay networks is proposed. This modified code is designed from set partitioning a larger codebook formed from two quasi-orthogonal space time block codes with different signal rotations then the subcodes are combined and pruned to arrive at the modified codebook with the desired rate in order to increase the CGD. Moreover, for higher rate codes the code distance is maximized by using a genetic algorithm to search for the optimum rotation matrix. This scheme has very good performance and significant coding gain over existing codes such as the open-loop and closed-loop QO-STBC schemes.
In addition, the topic of outage probability analysis in the context of multi-relay selection from available relay nodes for one-way amplify-and-forward cooperative relay networks is considered together with the best relay selection, the relay selection and best four relay selection in two-way amplify-and-forward cooperative relay networks. The relay selection is performed either on the basis of a max-min strategy or one based on maximizing exact end-to-end signal-to-noise ratio.
Furthermore, in this thesis, robust schemes for cooperative relays based on the M-D-QO-STBC scheme for both one-way and two-way asynchronous cooperative relay networks are considered to overcome the issue of a synchronism in wireless cooperative relay networks. In particular, an orthogonal frequency division multiplexing (OFDM) data structure is employed with cyclic prefix (CP) insertion at the source in the one-way cooperative relay network and at the two terminal nodes in the two-way cooperative network to combat the effects of time asynchronism. As such, this technique can effectively cope with the effects of timing errors.
Finally, outage probability performance of a proposed amplify-and-forward cooperative cognitive relay network is evaluated and the cognitive relays are assumed to exploit an overlay approach. A closed form expression for the outage probability for multi-relay selection cooperation over Rayleigh frequency flat fading channels is derived for perfect and imperfect spectrum acquisitions. Furthermore, the M-QO-STBC scheme is also proposed for use in wireless cognitive relay networks. MATLAB and Maple software based simulations are employed throughout the thesis to support the analytical results and assess the performance of new algorithms and methods
Cooperative Symbol-Based Signaling for Networks with Multiple Relays
Wireless channels suffer from severe inherent impairments and hence
reliable and high data rate wireless transmission is particularly challenging to
achieve. Fortunately, using multiple antennae improves performance in wireless
transmission by providing space diversity, spatial multiplexing, and power gains.
However, in wireless ad-hoc networks multiple antennae may not be acceptable
due to limitations in size, cost, and hardware complexity. As a result, cooperative
relaying strategies have attracted considerable attention because of their abilities
to take advantage of multi-antenna by using multiple single-antenna relays.
This study is to explore cooperative signaling for different relay networks,
such as multi-hop relay networks formed by multiple single-antenna relays and
multi-stage relay networks formed by multiple relaying stages with each stage
holding several single-antenna relays. The main contribution of this study is the
development of a new relaying scheme for networks using symbol-level
modulation, such as binary phase shift keying (BPSK) and quadrature phase shift
keying (QPSK). We also analyze effects of this newly developed scheme when it
is used with space-time coding in a multi-stage relay network. Simulation results
demonstrate that the new scheme outperforms previously proposed schemes:
amplify-and-forward (AF) scheme and decode-and-forward (DF) scheme
A Simple Cooperative Diversity Method Based on Network Path Selection
Cooperative diversity has been recently proposed as a way to form virtual
antenna arrays that provide dramatic gains in slow fading wireless
environments. However most of the proposed solutions require distributed
space-time coding algorithms, the careful design of which is left for future
investigation if there is more than one cooperative relay. We propose a novel
scheme, that alleviates these problems and provides diversity gains on the
order of the number of relays in the network. Our scheme first selects the best
relay from a set of M available relays and then uses this best relay for
cooperation between the source and the destination. We develop and analyze a
distributed method to select the best relay that requires no topology
information and is based on local measurements of the instantaneous channel
conditions. This method also requires no explicit communication among the
relays. The success (or failure) to select the best available path depends on
the statistics of the wireless channel, and a methodology to evaluate
performance for any kind of wireless channel statistics, is provided.
Information theoretic analysis of outage probability shows that our scheme
achieves the same diversity-multiplexing tradeoff as achieved by more complex
protocols, where coordination and distributed space-time coding for M nodes is
required, such as those proposed in [7]. The simplicity of the technique,
allows for immediate implementation in existing radio hardware and its adoption
could provide for improved flexibility, reliability and efficiency in future 4G
wireless systems.Comment: To appear, IEEE JSAC, special issue on 4
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
Dispensing with channel estimation: differentially modulated cooperative wireless communications
As a benefit of bypassing the potentially excessive complexity and yet inaccurate channel estimation, differentially encoded modulation in conjunction with low-complexity noncoherent detection constitutes a viable candidate for user-cooperative systems, where estimating all the links by the relays is unrealistic. In order to stimulate further research on differentially modulated cooperative systems, a number of fundamental challenges encountered in their practical implementations are addressed, including the time-variant-channel-induced performance erosion, flexible cooperative protocol designs, resource allocation as well as its high-spectral-efficiency transceiver design. Our investigations demonstrate the quantitative benefits of cooperative wireless networks both from a pure capacity perspective as well as from a practical system design perspective
Filter-And-Forward Distributed Beamforming in Relay Networks with Frequency Selective Fading
A new approach to distributed cooperative beamforming in relay networks with
frequency selective fading is proposed. It is assumed that all the relay nodes
are equipped with finite impulse response (FIR) filters and use a
filter-and-forward (FF) strategy to compensate for the transmitter-to-relay and
relay-to-destination channels.
Three relevant half-duplex distributed beamforming problems are considered.
The first problem amounts to minimizing the total relay transmitted power
subject to the destination quality-of-service (QoS) constraint. In the second
and third problems, the destination QoS is maximized subject to the total and
individual relay transmitted power constraints, respectively. For the first and
second problems, closed-form solutions are obtained, whereas the third problem
is solved using convex optimization. The latter convex optimization technique
can be also directly extended to the case when the individual and total power
constraints should be jointly taken into account. Simulation results
demonstrate that in the frequency selective fading case, the proposed FF
approach provides substantial performance improvements as compared to the
commonly used amplify-and-forward (AF) relay beamforming strategy.Comment: Submitted to IEEE Trans. on Signal Processing on 8 July 200
Differential Distributed Space-Time Coding with Imperfect Synchronization
Differential distributed space-time coding (D-DSTC) has been considered to
improve both diversity and data-rate in cooperative communications in the
absence of channel information. However, conventionally, it is assumed that
relays are perfectly synchronized in the symbol level. In practice, this
assumption is easily violated due to the distributed nature of the relay
networks. This paper proposes a new differential encoding and decoding process
for D-DSTC systems with two relays. The proposed method is robust against
synchronization errors and does not require any channel information at the
destination. Moreover, the maximum possible diversity and symbol-by-symbol
decoding are attained. Simulation results are provided to show the performance
of the proposed method for various synchronization errors and the fact that our
algorithm is not sensitive to synchronization error.Comment: to appear in IEEE Globecom, 201
- …