Mitigating PAPR in cooperative wireless networks with frequency selective channels and relay selection

The focus of this thesis is peak-to-average power ratio (PAPR) reduction in cooperative wireless networks which exploit orthogonal frequency division multiplexing in transmission. To reduce the PAPR clipping is employed at the source node. The first contribution focuses upon an amplify-and-forward (AF) type network with four relay nodes which exploits distributed closed loop extended orthogonal space frequency block coding to improve end-to-end performance. Oversampling and filtering are used at the source node to reduce out-of-band interference and the iterative amplitude reconstruction decoding technique is used at the destination node to mitigate in-band distortion which is introduced by the clipping process. In addition, by exploiting quantized group feedback and phase rotation at two of the relay nodes, the system achieves full cooperative diversity in addition to array gain. The second contribution area is outage probability analysis in the context of multi-relay selection in a cooperative AF network with frequency selective fading channels. The gains of time domain multi-path fading channels with L paths are modeled with an Erlang distribution. General closed form expressions for the lower and upper bounds of outage probability are derived for arbitrary channel length L as a function of end-to-end signal to noise ratio. This analysis is then extended for the case when single relay selection from an arbitrary number of relay nodes M is performed. The spatial and temporal cooperative diversity gain is then analysed. In addition, exact form of outage probability for multi-path channel length L = 2 and selecting the best single relay from an arbitrary number of relay nodes M is obtained. Moreover, selecting a pair of relays when L = 2 or 3 is additionally analysed. Finally, the third contribution context is outage probability analysis of a cooperative AF network with single and two relay pair selection from M available relay nodes together with clipping at the source node, which is explicitly modelled. MATLAB and Maple software based simulations are employed throughout the thesis to support the analytical results and assess the performance of algorithms and methods

WIRELESS NETWORK COCAST: COOPERATIVE COMMUNICATIONS WITH SPACE-TIME NETWORK CODING

Traditional cooperative communications can greatly improve communication performance. However, transmissions from multiple relay nodes are challenging in practice. Single transmissions using time-division multiple access cause large transmission delay, but simultaneous transmissions from two or more nodes using frequency-division multiple access (FDMA), code-division multiple access (CDMA), or distributed space-time codes are associated with the issues of imperfect frequency and timing synchronization due to the asynchronous nature of cooperation. In this dissertation, we propose a novel concept of wireless network cocast (WNC) and develop its associated space-time network codes (STNCs) to overcome the foretold issues. In WNC networks, each node is allocated a time slot for its transmission and thus the issues of imperfect synchronization are eliminated. To reduce the large transmission delay, each relay node forms a unique signal, a combination of the overheard information, and transmits it to the intended destination. The combining functions at relay nodes form a STNC that ensures full spatial diversity for the transmitted information as in traditional cooperative communications. Various traditional combining techniques are utilized to design the STNCs, including FDMA-like and CDMA-like techniques and transform-based techniques with the use of Hadamard and Vandermonde matrices. However, a major distinction is that the combination of information from different sources happens within a relay node instead of through the air as in traditional cooperative communications. We consider a general case of multiuser relay wireless networks, where user nodes transmit and receive their information to and from a common base node with the assistance from relay nodes. We then apply the STNCs to multiuser cooperative networks, in which the user nodes are also relay nodes helping each other in their transmission. Since the cooperative nodes are distributed around the network, the node locations can be an important aspect of designing a STNC. Therefore, we propose a location-aware WNC scheme to reduce the aggregate transmit power and achieve even power distribution among the user nodes in the network. WNC networks and its associated STNCs provide spatial diversity to dramatically reduce the required transmit power. However, due to the additional processing power in receiving and retransmitting each other's information, not all nodes and WNC networks result in energy efficiency. Therefore, we first examine the power consumption in WNC networks. We then offer a TDMA-based merge process based on coalitional formation games to orderly and efficiently form cooperative groups in WNC networks. The proposed merge process substantially reduces the network power consumption and improves the network lifetime

Cooperative Transmission Techniques in Wireless Communication Networks

Cooperative communication networks have received significant interests from both academia and industry in the past decade due to its ability to provide spatial diversity without the need of implementing multiple transmit and/or receive antennas at the end-user terminals. These new communication networks have inspired novel ideas and approaches to find out what and how performance improvement can be provided with cooperative communications. The objective of this thesis is to design and analyze various cooperative transmission techniques under the two common relaying signal processing methods, namely decode-and-forward (DF) and amplify-and-forward (AF). For the DF method, the thesis focuses on providing performance improvement by mitigating detection errors at the relay(s). In particular, the relaying action is implemented adaptively to reduce the phenomenon of error propagation: whether or not a relay’s decision to retransmit depends on its decision variable and a predefined threshold. First, under the scenario that unequal error protection is employed to transmit different information classes at the source, a relaying protocol in a singlerelay network is proposed and its error performance is evaluated. It is shown that by setting the optimal signal-to-noise ratio (SNR) thresholds at the relay for different information classes, the overall error performance can be significantly improved. Second, for multiple-relay networks, a relay selection protocol, also based on SNR thresholds, is proposed and the optimal thresholds are also provided. Third, an adaptive relaying protocol and a low-complexity receiver are proposed when binary frequency-shift-keying (FSK) modulation is employed and neither the receiver nor the transmitter knows the fading coefficients. It is demonstrated that large performance improvements are possible when the optimal thresholds are implemented at the relays and destination. Finally, under the scenario that there is information feedback from the destination to the relays, a novel protocol is developed to achieve the maximum transmission throughput over a multiple-relay network while the bit-error rate satisfies a given constraint. With the AF method, the thesis examines a fixed-gain multiple-relay network in which the channels are temporally-correlated Rayleigh flat fading. Developed is a general framework for maximum-ratio-combining detection when M-FSK modulation is used and no channel state information is available at the destination. In particular, an upper-bound expression on the system’s error performance is derived and used to verify that the system achieves the maximal diversity order. Simulation results demonstrate that the proposed scheme outperforms the existing schemes for the multiple-relay network under consideration

Distributed Space-Time Message Relaying for Uncoded/Coded Wireless Cooperative Communications

During wireless communications, nodes can overhear other transmissions through the wireless medium, suggested by the broadcast nature of plane wave propagation, and may help to provide extra observations of the source signals to the destination. Modern research in wireless communications pays more attention to these extra observations which were formerly neglected within networks. Cooperative communication processes this abundant information existing at the surrounding nodes and retransmits towards the destination in various forms to create spatial and/or coding diversity, thereby to obtain higher throughput and reliability. The aim of this work is to design cooperative communication systems with distributed space-time block codes (DSTBC) in different relaying protocols and theoretically derive the BER performance for each scenario. The amplify-and-forward (AF) protocol is one of the most commonly used protocols at the relays. It has a low implementation complexity but with a drawback of amplifying the noise as well. We establish the derivation of the exact one-integral expression of the average BER performance of this system, folloby a novel approximation method based on the series expansion. An emerging technology, soft decode-and-forward (SDF), has been presented to combine the desired features of AF and DF: soft signal representation in AF and channel coding gain in DF. In the SDF protocol, after decoding, relays transmit the soft-information, which represents the reliability of symbols passed by the decoder, to the destination. Instead of keeping the source node idling when the relays transmit as in the traditional SDF system, we let the source transmit hard information and cooperate with the relays using DSTBC. By theoretically deriving the detection performance at the destination by either using or not using the DSTBC, we make comparisons among three SDF systems. Interesting results have been shown, together with Monte-Carlo simulations, to illustrate that our proposed one-relay and two-relay SDF & DSTBC systems outperform traditional soft relaying for most of the cases. Finally, these analytic results also provide a way to implement the optimal power allocation between the source and the relay or between relays, which is illustrated in the line model

Clustering based space-time network coding

Abstract—Many-to-one communication is a challenging prob-lem in practice due to channel fading and multi-user interfer-ences. In this work, a new protocol that leverages spatial diversity through space-time network coding is proposed. The N source nodes are first divided into K clusters, each having Q nodes, and the clusters send data successively in a time-division multiple access way. Each node behaves as a decode-and-forward relay to other clusters, and uses linear coding to combine the local symbol and the relayed symbols. To separate the multi-source signals, each node has a unique signature waveform, and linear decorrelator is used at the receivers. Both the exact Symbol Error Rate (SER) and the asymptotic SER at high signal-to-noise ratios of the M-ary phase-shift keying signal are studied then. It is shown that a diversity order of (N − Q + 1) can be achieved with a low transmission delay of K time slots, which is more bandwidth efficient than the existing protocols. Simulation results also justify the performance gains. I

Robust wireless sensor network for smart grid communication : modeling and performance evaluation

Our planet is gradually heading towards an energy famine due to growing population and industrialization. Hence, increasing electricity consumption and prices, diminishing fossil fuels and lack significantly in environment-friendliness due to their emission of greenhouse gasses, and inefficient usage of existing energy supplies have caused serious network congestion problems in many countries in recent years. In addition to this overstressed situation, nowadays, the electric power system is facing many challenges, such as high maintenance cost, aging equipment, lack of effective fault diagnostics, power supply reliability, etc., which further increase the possibility of system breakdown. Furthermore, the adaptation of the new renewable energy sources with the existing power plants to provide an alternative way for electricity production transformed it in a very large and complex scale, which increases new issues. To address these challenges, a new concept of next generation electric power system, called the "smart grid", has emerged in which Information and Communication Technologies (ICTs) are playing the key role. For a reliable smart grid, monitoring and control of power system parameters in the transmission and distribution segments are crucial. This necessitates the deployment of a robust communication network within the power grid. Traditionally, power grid communications are realized through wired communications, including power line communication (PLC). However, the cost of its installation might be expensive especially for remote control and monitoring applications. More recently, plenty of research interests have been drawn to the wireless communications for smart grid applications. In this regard, the most promising methods of smart grid monitoring explored in the literature is based on wireless sensor network (WSN). Indeed, the collaborative nature of WSN brings significant advantages over the traditional wireless networks, including low-cost, wider coverage, self-organization, and rapid deployment. Unfortunately, harsh and hostile electric power system environments pose great challenges in the reliability of sensor node communications because of strong RF interference and noise called impulsive noise. On account of the fundamental of WSN-based smart grid communications and the possible impacts of impulsive noise on the reliability of sensor node communications, this dissertation is supposed to further fill the lacking of the existing research outcomes. To be specific, the contributions of this dissertation can be summarized as three fold: (i) investigation and performance analysis of impulsive noise mitigation techniques for point-to-point single-carrier communication systems impaired by bursty impulsive noise; (ii) design and performance analysis of collaborative WSN for smart grid communication by considering the RF noise model in the designing process, a particular intension is given to how the time-correlation among the noise samples can be taken into account; (iii) optimal minimum mean square error (MMSE)estimation of physical phenomenon like temperature, current, voltage, etc., typically modeled by a Gaussian source in the presence of impulsive noise. In the first part, we compare and analyze the widely used non-linear methods such as clipping, blanking, and combined clipping-blanking to mitigate the noxious effects of bursty impulsive noise for point-to-point communication systems with low-density parity-check (LDPC) coded single-carrier transmission. While, the performance of these mitigation techniques are widely investigated for multi-carrier communication systems using orthogonal frequency division multiplexing (OFDM) transmission under the effect of memoryless impulsive noise, we note that OFDM is outperformed by its single-carrier counterpart when the impulses are very strong and/or they occur frequently, which likely exists in contemporary communication systems including smart grid communications. Likewise, the assumption of memoryless noise model is not valid for many communication scenarios. Moreover, we propose log-likelihood ratio (LLR)-based impulsive noise mitigation for the considered scenario. We show that the memory property of the noise can be exploited in the LLR calculation through maximum a posteriori (MAP) detection. In this context, provided simulation results highlight the superiority of the LLR-based mitigation scheme over the simple clipping/blanking schemes. The second contribution can be divided into two aspects: (i) we consider the performance analysis of a single-relay decode-and-forward (DF) cooperative relaying scheme over channels impaired by bursty impulsive noise. For this channel, the bit error rate (BER) performances of direct transmission and a DF relaying scheme using M-PSK modulation in the presence of Rayleigh fading with a MAP receiver are derived; (ii) as a continuation of single-relay collaborative WSN scheme, we propose a novel relay selection protocol for a multi-relay DF collaborative WSN taking into account the bursty impulsive noise. The proposed protocol chooses the N’th best relay considering both the channel gains and the states of the impulsive noise of the source-relay and relay-destination links. To analyze the performance of the proposed protocol, we first derive closed-form expressions for the probability density function (PDF) of the received SNR. Then, these PDFs are used to derive closed-form expressions for the BER and the outage probability. Finally, we also derive the asymptotic BER and outage expressions to quantify the diversity benefits. From the obtained results, it is seen that the proposed receivers based on the MAP detection criterion is the most suitable one for bursty impulsive noise environments as it has been designed according to the statistical behavior of the noise. Different from the aforementioned contributions, talked about the reliable detection of finite alphabets in the presence of bursty impulsive noise, in the thrid part, we investigate the optimal MMSE estimation for a scalar Gaussian source impaired by impulsive noise. In Chapter 5, the MMSE optimal Bayesian estimation for a scalar Gaussian source, in the presence of bursty impulsive noise is considered. On the other hand, in Chapter 6, we investigate the distributed estimation of a scalar Gaussian source in WSNs in the presence of Middleton class-A noise. From the obtained results we conclude that the proposed optimal MMSE estimator outperforms the linear MMSE estimator developed for Gaussian channel

RESOURCE ALLOCATION FOR WIRELESS RELAY NETWORKS

In this thesis, we propose several resource allocation strategies for relay networks in the context of joint power and bandwidth allocation and relay selection, and joint power allocation and subchannel assignment for orthogonal frequency division multiplexing (OFDM) and orthogonal frequency division multiple access (OFDMA) systems. Sharing the two best ordered relays with equal power between the two users over Rayleigh flat fading channels is proposed to establish full diversity order for both users. Closed form expressions for the outage probability, and bit error probability (BEP) performance measures for both amplify and forward (AF) and decode and forward (DF) cooperative communication schemes are developed for different scenarios. To utilize the full potentials of relay-assisted transmission in multi user systems, we propose a mixed strategy of AF relaying and direct transmission, where the user transmits part of the data using the relay, and the other part is transmitted using the direct link. The resource allocation problem is formulated to maximize the sum rate. A recursive algorithm alternating between power allocation and bandwidth allocation steps is proposed to solve the formulated resource allocation problem. Due to the conflict between limited wireless resources and the fast growing wireless demands, Stackelberg game is proposed to allocate the relay resources (power and bandwidth) between competing users, aiming to maximize the relay benefits from selling its resources. We prove the uniqueness of Stackelberg Nash Equilibrium (SNE) for the proposed game. We develop a distributed algorithm to reach SNE, and investigate the conditions for the stability of the proposed algorithm. We propose low complexity algorithms for AF-OFDMA and DF-OFDMA systems to assign the subcarriers to the users based on high SNR approximation aiming to maximize the weighted sum rate. Auction framework is proposed to devise competition based solutions for the resource allocation of AF-OFDMA aiming tomaximize either vi the sum rate or the fairness index. Two auction algorithms are proposed; sequential and one-shot auctions. In sequential auction, the users evaluate the subcarrier based on the rate marginal contribution. In the one-shot auction, the users evaluate the subcarriers based on an estimate of the Shapley value and bids on all subcarriers at once