POWER ALLOCATION ALGORITHM FOR MIMO BASED MULTI-HOP COOPERATIVE SENSOR NETWORK

Cooperative transmission is a new breed of wireless communication systems that enables the cooperating node in a wireless sensor network to share their radio resources by employing a distributed transmission and processing operation. This new technique offers substantial spatial diversity gains as the cooperating nodes help one another to send data over several independent paths to the destination node. In recent times, an extensive effort has been made to incorporate these systems in the future wireless networks like LTE (Long Term Evolution), IEEE 802.16j (Mobile Multi-hop Relay (MMR) Networks) and IEEE 802.16m (Mobile WiMAX Release 2 or WirelessMAN-Advanced). But, there are few technical issues which need to be addressed before this promising technique is integrated into future wireless networks. Among them, managing transmission power is a critical issue, which needs to be resolved to fully exploit the benefits of cooperative relaying. Optimal Power Allocation, is one such technique that optimally distributes the total transmission power between the source and relaying nodes thus saving a lot of power while maintaining the link quality. In the first part of the thesis, mathematical expressions of the received signals have been derived for different phases of cooperative transmission. Average-Bit-error-rate (ABER), has been taken as a performance metric to show the efficiency of cooperative relaying protocols. In the second part of this Chapter, a multi-hop framework has been presented for the power allocation algorithm with Amplify-and-Forward relaying protocol. The efficiency of the power allocation algorithm has been discussed with different scenarios i.e. First for a three node (2-Hop) wireless network configuration and then for a four node (3-Hop) wireless network configuration. The transmission scenarios (2-Hop and 3-Hop) have been further categorized into multiple cases on the basis of channel quality between source-to-destination, source-to-relay, relay-to-relay and relay-to-destination links.fi=Opinnäytetyö kokotekstinä PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=Lärdomsprov tillgängligt som fulltext i PDF-format

Outage Performance Analysis of Underlay Cognitive Radio Networks with Decode‐and‐Forward Relaying

In this chapter, we evaluate the outage performance of decode‐and‐forward relaying in cognitive radio networks over Rayleigh fading channels, subject to the relay location for a secondary user. In particular, we obtain the optimal relay location in wireless communications systems for the cognitive radio networks, using differential evolution optimization algorithm. Then, we investigate the optimal transmission rate of the secondary user. We present the numerical results to validate the proposed theoretical analysis and to show the effects of the Rayleigh fading channel parameters for the whole system performance

A Tutorial on the Optimization of Amplify-and-Forward MIMO Relay Systems

The remarkable promise of multiple-input multiple-output (MIMO) wireless channels has motivated an intense research activity to characterize the theoretical and practical issues associated with the design of transmit (source) and receive (destination) processing matrices under different operating conditions. This activity was primarily focused on point-to-point (single-hop) communications but more recently there has been an extensive work on two-hop or multi-hop settings in which single or multiple relays are used to deliver the information from the source to the destination. The aim of this tutorial is to provide an up-to-date overview of the fundamental results and practical implementation issues of designing amplify-and-forward MIMO relay systems

Distributed Quasi-Orthogonal Space-Time coding in wireless cooperative relay networks

Cooperative diversity provides a new paradigm in robust wireless re- lay networks that leverages Space-Time (ST) processing techniques to combat the effects of fading. Distributing the encoding over multiple relays that potentially observe uncorrelated channels to a destination terminal has demonstrated promising results in extending range, data- rates and transmit power utilization. Specifically, Space Time Block Codes (STBCs) based on orthogonal designs have proven extremely popular at exploiting spatial diversity through simple distributed pro- cessing without channel knowledge at the relaying terminals. This thesis aims at extending further the extensive design and analysis in relay networks based on orthogonal designs in the context of Quasi- Orthogonal Space Time Block Codes (QOSTBCs). The characterization of Quasi-Orthogonal MIMO channels for cooper- ative networks is performed under Ergodic and Non-Ergodic channel conditions. Specific to cooperative diversity, the sub-channels are as- sumed to observe different shadowing conditions as opposed to the traditional co-located communication system. Under Ergodic chan- nel assumptions novel closed-form solutions for cooperative channel capacity under the constraint of distributed-QOSTBC processing are presented. This analysis is extended to yield closed-form approx- imate expressions and their utility is verified through simulations. The effective use of partial feedback to orthogonalize the QOSTBC is examined and significant gains under specific channel conditions are demonstrated. Distributed systems cooperating over the network introduce chal- lenges in synchronization. Without extensive network management it is difficult to synchronize all the nodes participating in the relaying between source and destination terminals. Based on QOSTBC tech- niques simple encoding strategies are introduced that provide compa- rable throughput to schemes under synchronous conditions with neg- ligible overhead in processing throughout the protocol. Both mutli- carrier and single-carrier schemes are developed to enable the flexi- bility to limit Peak-to-Average-Power-Ratio (PAPR) and reduce the Radio Frequency (RF) requirements of the relaying terminals. The insights gained in asynchronous design in flat-fading cooperative channels are then extended to broadband networks over frequency- selective channels where the novel application of QOSTBCs are used in distributed-Space-Time-Frequency (STF) coding. Specifically, cod- ing schemes are presented that extract both spatial and mutli-path diversity offered by the cooperative Multiple-Input Multiple-Output (MIMO) channel. To provide maximum flexibility the proposed schemes are adapted to facilitate both Decode-and-Forward (DF) and Amplify- and-Forward (AF) relaying. In-depth Pairwise-Error-Probability (PEP) analysis provides distinct design specifications which tailor the distributed- STF code to maximize the diversity and coding gain offered under the DF and AF protocols. Numerical simulation are used extensively to confirm the validity of the proposed cooperative schemes. The analytical and numerical re- sults demonstrate the effective use of QOSTBC over orthogonal tech- niques in a wide range of channel conditions