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 $N$ available relay nodes for one-way amplify-and-forward cooperative relay networks is considered together with the best relay selection, the $N^{th}$ 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

Energy efficiency of some non-cooperative, cooperative and hybrid communication schemes in multi-relay WSNs

In this paper we analyze the energy efficiency of single-hop, multi-hop, cooperative selective decode-and-forward, cooperative incremental decode-and-forward, and even the combination of cooperative and non-cooperative schemes, in wireless sensor networks composed of several nodes. We assume that, as the sensor nodes can experience either non line-of-sight or some line-of-sight conditions, the Nakagami-m fading distribution is used to model the wireless environment. The energy efficiency analysis is constrained by a target outage probability and an end-to-end throughput. Our results show that in most scenarios cooperative incremental schemes are more energy efficient than the other methods

Diversity-Multiplexing Tradeoffs in MIMO Relay Channels

A multi-hop relay channel with multiple antenna terminals in a quasi-static slow fading environment is considered. For both full-duplex and half-duplex relays the fundamental diversity-multiplexing tradeoff (DMT) is analyzed. It is shown that, while decode-and-forward (DF) relaying achieves the optimal DMT in the full-duplex relay scenario, the dynamic decode-and-forward (DDF) protocol is needed to achieve the optimal DMT if the relay is constrained to half-duplex operation. For the latter case, static protocols are considered as well, and the corresponding achievable DMT performance is characterized.Comment: To appear at IEEE Global Communications Conf. (Globecom), New Orleans, LA, Nov. 200

Reliable multi-hop routing with cooperative transmissions in energy-constrained networks

We present a novel approach in characterizing the optimal reliable multi-hop virtual multiple-input single-output (vMISO) routing in ad hoc networks. Under a high node density regime, we determine the optimal cardinality of the cooperation sets at each hop on a path minimizing the total energy cost per transmitted bit. Optimal cooperating set cardinality curves are derived, and they can be used to determine the optimal routing strategy based on the required reliability, transmission power, and path loss coefficient. We design a new greedy geographical routing algorithm suitable for vMISO transmissions, and demonstrate the applicability of our results for more general networks

Multi-Source Cooperative Communication with Opportunistic Interference Cancelling Relays

In this paper we present a multi-user cooperative protocol for wireless networks. Two sources transmit simultaneously their information blocks and relays employ opportunistically successive interference cancellation (SIC) in an effort to decode them. An adaptive decode/amplify-and-forward scheme is applied at the relays to the decoded blocks or their sufficient statistic if decoding fails. The main feature of the protocol is that SIC is exploited in a network since more opportunities arise for each block to be decoded as the number of used relays NRU is increased. This feature leads to benefits in terms of diversity and multiplexing gains that are proven with the help of an analytical outage model and a diversity-multiplexing tradeoff (DMT) analysis. The performance improvements are achieved without any network synchronization and coordination. In the final part of this work the closed-form outage probability model is used by a novel approach for offline pre-selection of the NRU relays, that have the best SIC performance, from a larger number of NR nodes. The analytical results are corroborated with extensive simulations, while the protocol is compared with orthogonal and multi-user protocols reported in the literature.Comment: in IEEE Transactions on Communications, 201