A Study Of Cooperative Spectrum Sharing Schemes For Internet Of Things Systems

The Internet of Things (IoT) has gained much attention in recent years with the massive increase in the number of connected devices. Cognitive Machine-to-Machine (CM2M) communications is a hot research topic in which a cognitive dimension allows M2M networks to overcome the challenges of spectrum scarcity, interference, and green requirements. In this paper, we propose a Generalized Cooperative Spectrum Sharing (GCSS) scheme for M2M communication. Cooperation extends the coverage of wireless networks as well as increasing their throughput while reducing the energy consumption of the connected low power devices. We study the outage performance of the proposed GCSS scheme for M2M system and derive exact expressions for the outage probability. We also analyze the effect of varying transmission powers on the performance of the system

Adaptive relaying protocol multiple-input multiple-output orthogonal frequency division multiplexing systems

In wireless broadband communications, orthogonal frequency division multiplexing (OFDM) has been adopted as a promising technique to mitigate multi-path fading and provide high spectral efficiency. In addition, cooperative communication can explore spatial diversity where several users or nodes share their resources and cooperate through distributed transmission. The concatenation of the OFDM technique with relaying systems can enhance the overall performance in terms of spectral efficiency and improve robustness against the detrimental effects of fading. Hybrid relay selection is proposed to overcome the drawbacks of conventional forwarding schemes. However, exciting hybrid relay protocols may suffer some limitations when used for transmission over frequency-selective channels. The combination of cooperative protocols with OFDM systems has been extensively utilized in current wireless networks, and have become a promising solution for future high data rate broadband communication systems including 3D video transmission. This thesis covers two areas of high data rate networks. In the first part, several techniques using cooperative OFDM systems are presented including relay selection, space time block codes, resource allocation and adaptive bit and power allocation to introduce diversity. Four (4) selective OFDM relaying schemes are studied over wireless networks; selective OFDM; selective OFDMA; selective block OFDM and selective unequal block OFDM. The closed-form expression of these schemes is derived. By exploiting the broadcast nature, it is demonstrated that spatial diversity can be improved. The upper bound of outage probability for the protocols is derived. A new strategy for hybrid relay selection is proposed to improve the system performance by removing the sub-carriers that experience deep fading. The per subcarrier basis selection is considered with respect to the predefined threshold signal-to-noise ratio. The closed-form expressions of the proposed protocol in terms of bit error probability and outage probability are derived and compared with conventional hybrid relay selection. Adaptive bit and power allocation is also discussed to improve the system performance. Distributed space frequency coding applied to hybrid relay selection to obtain full spatial and full data rate transmission is explored. Two strategies, single cluster and multiple clusters, are considered for the Alamouti code at the destination by using a hybrid relay protocol. The power allocation with and without sub-carrier pairing is also investigated to mitigate the effect of multipath error propagation in frequency-selective channels. The second part of this thesis investigates the application of cooperative OFDM systems to high data rate transmission. Recently, there has been growing attention paid to 3D video transmission over broadband wireless channels. Two strategies for relay selection hybrid relay selection and first best second best are proposed to implement unequal error protection in the physical layer over error prone channels. The closed-form expressions of bit error probability and outage probability for both strategies are examined. The peak signal-to-noise ratio is presented to show the quality of reconstruction of the left and right views

Esquemas de retransmissão baseados no protocolo decodifica-e-encaminha em redes cognitivas do tipo underlay

Orientador: José Cândido Silveira Santos FilhoTese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de ComputaçãoResumo: O conceito de compartilhamento de espectro do tipo underlay tem sido proposto como uma técnica promissora para contornar o problema da escassez e da subutilização do espectro, permitindo que usuários não licenciados, chamados de usuários secundários, possam acessar simultaneamente uma banda licenciada, alocada aos usuários primários, desde que o nível de interferência sobre os mesmos seja mantido abaixo de um dado limiar aceitável. Entretanto, isso implica que a potência de transmissão na rede secundária deve ser restringida, comprometendo assim a confiabilidade e a cobertura da comunicação. A fim de contornar esse problema, técnicas de retransmissão cooperativa, as quais proveem um novo tipo de diversidade espacial, podem ser exploradas como um meio eficaz para melhorar o desempenho da rede secundária. De fato, a utilização conjunta de ambas as técnicas ¿ compartilhamento de espectro do tipo underlay e retransmissão cooperativa ¿ em redes cooperativas e cognitivas tem recebido especial atenção, já que a eficiência espectral do sistema e o desempenho da rede secundária podem ser melhorados significativamente. Esta tese apresenta quatro contribuições principais na referida área. Em particular, estuda-se o efeito conjunto de duas restrições de potência importantes sobre o desempenho de outage de redes cooperativas e cognitivas, especificamente, o nível máximo de potência interferente tolerada pelo receptor primário e o valor máximo de potência transmitida nos usuários secundários. Foca-se em esquemas de retransmissão baseados no protocolo decodifica-e-encaminha, abordando cenários em que o enlace direto entre fonte e destino está disponível para transmitir informação útil. Como uma primeira contribuição, analisa-se o desempenho de dois esquemas baseados no protocolo de retransmissão half-duplex incremental, os quais exploram a diversidade espacial dos enlaces diretos em redes cooperativas e cognitivas multiusuário. A segunda contribuição investiga o impacto de estimativas desatualizadas do canal sobre o mecanismo de seleção de destino para um desses esquemas anteriores, focando-se apenas no aspecto cooperativo da rede, ou seja, desconsiderando-se o uso de compartilhamento espectral. A terceira contribuição estuda o desempenho de redes cooperativas e cognitivas baseadas no modo full-duplex. Para esse cenário, avalia-se o impacto tanto da autointerferência residual, que é inerente ao modo full-duplex, bem como das restrições de potência que caracterizam o compartilhamento de espectro do tipo underlay. Como contribuição final, motivada pelo compromisso entre a perda de eficiência espectral e o problema da autointerferência residual, próprios dos modos half-duplex e full-duplex, respectivamente, propõe-se e analisa-se um esquema de transmissão adaptativo para redes cooperativas e cognitivas, através do qual, antes de cada processo de comunicação, um dos seguintes modos de transmissão é selecionado: retransmissão half-duplex, retransmissão full-duplex ou transmissão direta. Para todos os cenários considerados, expressões analíticas exatas para a probabilidade de outage são obtidas. Adicionalmente, uma análise assintótica é realizada a fim de caracterizar a ordem de diversidade e o comportamento de outage da rede secundária no regime assintótico de alta relação sinal-ruído. Simulações de Monte Carlo validam os resultados analíticos apresentadosAbstract: Underlay spectrum sharing has been proposed as a promising technique to alleviate the problem of spectrum scarcity and underutilization, by enabling secondary (unlicensed) users to concurrently access a licensed band, provided that the resulting interference on the primary (licensed) users remains below a given acceptable level. However, such a technique implies that the transmit power at the secondary network must be constrained, thereby compromising the communication reliability and coverage. To counteract this, cooperative relaying techniques, which provide a new form of spatial diversity, can be exploited as an effective means to boost the performance of the secondary network. Indeed, the joint use of both techniques¿underlay spectrum sharing and cooperative relaying¿in cognitive relaying networks has drawn special attention, since the overall spectral efficiency and the secondary-network performance can be significantly improved. This dissertation comprises four main contributions in this field. In particular, we examine the combined effect of two crucial power constraints on the outage performance of cognitive relaying networks, namely, the maximum tolerable interference power at the primary receiver and the maximum transmit power at the secondary users. We focus on relaying schemes operating under the decode-and-forward protocol, for scenarios in which the direct link between source and destination is available to convey useful information. As a first contribution, we analyze the performance of two incremental half-duplex relaying schemes, which exploit the spatial diversity of the direct links in a multiuser scenario. Our second contribution investigates the impact of outdated channel estimates on the destination-scheduling mechanism of one of those incremental schemes, from the perspective of a cooperative network only, that is, in the absence of spectrum sharing. The third contribution addresses cognitive full-duplex relaying networks. More specifically, we assess the system performance as a function of both the residual self-interference, which is inherent to the full-duplex relaying mode, and the underlay spectrum-sharing power constraints. As a final contribution, driven by the tradeoff between the spectral-efficiency loss and the residual self-interference problem, intrinsic to the half- and full-duplex relaying modes, respectively, we propose and analyze an adaptive transmission scheme whereby, before each communication process, one out of the following transmission modes is selected: half-duplex relaying, full-duplex relaying, or direct transmission. For all the considered scenarios, exact analytical expressions for the outage probability are derived. In addition, an asymptotic analysis is performed to obtain further insights on the diversity order and outage behavior of the secondary network at the high signal-to-noise ratio regime. Monte Carlo simulations corroborate the accuracy of the presented mathematical analysisDoutoradoTelecomunicações e TelemáticaDoutor em Engenharia ElétricaCAPE

Collaborative HARQ Schemes for Cooperative Diversity Communications in Wireless Networks

Wireless technology is experiencing spectacular developments, due to the emergence of interactive and digital multimedia applications as well as rapid advances in the highly integrated systems. For the next-generation mobile communication systems, one can expect wireless connectivity between any devices at any time and anywhere with a range of multimedia contents. A key requirement in such systems is the availability of high-speed and robust communication links. Unfortunately, communications over wireless channels inherently suffer from a number of fundamental physical limitations, such as multipath fading, scarce radio spectrum, and limited battery power supply for mobile devices. Cooperative diversity (CD) technology is a promising solution for future wireless communication systems to achieve broader coverage and to mitigate wireless channels’ impairments without the need to use high power at the transmitter. In general, cooperative relaying systems have a source node multicasting a message to a number of cooperative relays, which in turn resend a processed version message to an intended destination node. The destination node combines the signal received from the relays, and takes into account the source’s original signal to decode the message. The CD communication systems exploit two fundamental features of the wireless medium: its broadcast nature and its ability to achieve diversity through independent channels. A variety of relaying protocols have been considered and utilized in cooperative wireless networks. Amplify and forward (AAF) and decode and forward (DAF) are two popular protocols, frequently used in the cooperative systems. In the AAF mode, the relay amplifies the received signal prior to retransmission. In the DAF mode, the relay fully decodes the received signal, re-encodes and forwards it to the destination. Due to the retransmission without decoding, AAF has the shortcoming that noise accumulated in the received signal is amplified at the transmission. DAF suffers from decoding errors that can lead to severe error propagation. To further enhance the quality of service (QoS) of CD communication systems, hybrid Automatic Repeat-reQuest (HARQ) protocols have been proposed. Thus, if the destination requires an ARQ retransmission, it could come from one of relays rather than the source node. This thesis proposes an improved HARQ scheme with an adaptive relaying protocol (ARP). Focusing on the HARQ as a central theme, we start by introducing the concept of ARP. Then we use it as the basis for designing three types of HARQ schemes, denoted by HARQ I-ARP, HARQ II-ARP and HARQ III-ARP. We describe the relaying protocols, (both AAF and DAF), and their operations, including channel access between the source and relay, the feedback scheme, and the combining methods at the receivers. To investigate the benefits of the proposed HARQ scheme, we analyze its frame error rate (FER) and throughput performance over a quasi-static fading channel. We can compare these with the reference methods, HARQ with AAF (HARQ-AAF) and HARQ with perfect distributed turbo codes (DTC), for which correct decoding is always assumed at the relay (HARQ-perfect DTC). It is shown that the proposed HARQ-ARP scheme can always performs better than the HARQ-AAF scheme. As the signal-to-noise ratio (SNR) of the channel between the source and relay increases, the performance of the proposed HARQ-ARP scheme approaches that of the HARQ-perfect DTC scheme

Relay Selection Strategies for Multi-hop Cooperative Networks

In this dissertation we consider several relay selection strategies for multi-hop cooperative networks. The relay selection strategies we propose do not require a central controller (CC). Instead, the relay selection is on a hop-by-hop basis. As such, these strategies can be implemented in a distributed manner. Therefore, increasing the number of hops in the network would not increase the complexity or time consumed for the relay selection procedure of each hop. We first investigate the performance of a hop-by-hop relay selection strategy for multi-hop decode-and-forward (DF) cooperative networks. In each relay cluster, relays that successfully receive and decode the message from the previous hop form a decoding set for relaying, and the relay which has the highest signal-to-noise ratio (SNR) link to the next hop is then selected for retransmission. We analyze the performance of this method in terms of end-to-end outage probability, and we derive approximations for the ergodic capacity and the effective ergodic capacity of this strategy. Next we propose a novel hop-by-hop relay selection strategy where the relay in the decoding set with the largest number of ``good\u27\u27 channels to the next stage is selected for retransmission. We analyze the performance of this method in terms of end-to-end outage probability in the case of perfect and imperfect channel state information (CSI). We also investigate relay selection strategies in underlay spectrum sharing cognitive relay networks. We consider a two-hop DF cognitive relay network with a constraint on the interference to the primary user. The outage probability of the secondary user and the interference probability at the primary user are analyzed under imperfect CSI scenario. Finally we introduce a hop-by-hop relay selection strategy for underlay spectrum sharing multi-hop relay networks. Relay selection in each stage is only based on the CSI in that hop. It is shown that in terms of outage probability, the performance of this method is nearly optimal

Time-slot based architecture for power beam-assisted relay techniques in CR-WSNs with transceiver hardware inadequacies

Over the past two decades, numerous research projects have concentrated on cognitive radio wireless sensor networks (CR-WSNs) and their benefits. To tackle the problem of energy and spectrum shortfall in CR-WSNs, this research proposes an underpinning decode-&-forward (DF) relaying technique. Using the suggested time-slot architecture (TSA), this technique harvests energy from a multi-antenna power beam (PB) and delivers source information to the target utilizing energy-constrained secondary source and relay nodes. The study considers three proposed relay selection schemes: enhanced hybrid partial relay selection (E-HPRS), conventional opportunistic relay selection (C-ORS), and leading opportunistic relay selection (L-ORS). We present evidence for the sustainability of the suggested methods by examining the outage probability (OP) and throughput (TPT) under multiple primary users (PUs). These systems leverage time switching (TS) receiver design to increase end-to-end performance while taking into account the maximum interference constraint and transceiver hardware inadequacies. In order to assess the efficacy of the proposed methods, we derive the exact and asymptotic closed-form equations for OP and TPT & develop an understanding to learn how they affect the overall performance all across the Rayleigh fading channel. The results show that OP of the L-ORS protocol is 16% better than C-ORS and 75% better than E-HPRS in terms of transmitting SNR. The OP of L-ORS is 30% better than C-ORS and 55% better than E-HPRS in terms of hardware inadequacies at the destination. The L-ORS technique outperforms C-ORS and E-HPRS in terms of TPT by 4% and 11%, respectively

Optimization in multi-relay wireless networks

The concept of cooperation in communications has drawn a lot of research attention in recent years due to its potential to improve the efficiency of wireless networks. This new form of communications allows some users to act as relays and assist the transmission of other users' information signals. The aim of this thesis is to apply optimization techniques in the design of multi-relay wireless networks employing cooperative communications. In general, the thesis is organized into two parts: ``Distributed space-time coding' (DSTC) and ``Distributed beamforming', which cover two main approaches in cooperative communications over multi-relay networks. In Part I of the thesis, various aspects of distributed implementation of space-time coding in a wireless relay network are treated. First, the thesis proposes a new fully-diverse distributed code which allows noncoherent reception at the destination. Second, the problem of coordinating the power allocation (PA) between source and relays to achieve the optimal performance of DSTC is studied and a novel PA scheme is developed. It is shown that the proposed PA scheme can obtain the maximum diversity order of DSTC and significantly outperform other suboptimal PA schemes. Third, the thesis presents the optimal PA scheme to minimize the mean-square error (MSE) in channel estimation during training phase of DSTC. The effect of imperfect channel estimation to the performance of DSTC is also thoroughly studied. In Part II of the thesis, optimal distributed beamforming designs are developed for a wireless multiuser multi-relay network. Two design criteria for the optimal distributed beamforming at the relays are considered: (i) minimizing the total relay power subject to a guaranteed Quality of Service (QoS) measured in terms of signal-to-noise-ratio (SNR) at the destinations, and (ii) jointly maximizing the SNR margin at the destinations subject to power constraints at the relays. Based on convex optimization techniques, it is shown that these problems can be formulated and solved via second-order conic programming (SOCP). In addition, this part also proposes simple and fast iterative algorithms to directly solve these optimization problems

Cooperative strategies design based on the diversity and multiplexing tradeoff

This thesis focuses on designing wireless cooperative communication strategies that are either optimal or near-optimal in terms of the tradeoff between diversity and multiplexing gains. Starting from classical cooperative broadcast, multiple-access and relay channels with unit degree of freedom, to more general cooperative interference channels with higher degrees of freedom, properties of different network topologies are studied and their unique characteristics together with several advanced interference management techniques are exploited to design cooperative transmission strategies in order to enhance data rate, reliability or both at the same time. Moreover, various algorithms are proposed to solve practical implementation issues and performance is analyzed through both theoretical verifications and simulations

Power minimization in wireless systems with superposition coding.

Zheng, Xiaoting.Thesis (M.Phil.)--Chinese University of Hong Kong, 2008.Includes bibliographical references (p. 64-69).Abstracts in English and Chinese.Abstract --- p.iAcknowledgement --- p.iiiChapter 1 --- Introduction --- p.1Chapter 1.1 --- Rayleigh Fading --- p.1Chapter 1.2 --- Transmission Schemes --- p.2Chapter 1.2.1 --- Frequency Division Multiple Access(FDMA) --- p.2Chapter 1.2.2 --- Time Division Multiple Access(TDMA) --- p.3Chapter 1.2.3 --- Code Division Multiple Access(CDMA) --- p.5Chapter 1.2.4 --- The Broadcast Channel --- p.5Chapter 1.3 --- Cooperative Transmissions --- p.9Chapter 1.3.1 --- Relaying Protocols --- p.10Chapter 1.4 --- Outline of Thesis --- p.12Chapter 2 --- Background Study --- p.13Chapter 2.1 --- Superposition Coding --- p.13Chapter 2.2 --- Cooperative Transmission --- p.15Chapter 2.2.1 --- Single Source Single Destination --- p.15Chapter 2.2.2 --- Multiple Sources Single Destination --- p.16Chapter 2.2.3 --- Single Source Multiple Destinations --- p.17Chapter 2.2.4 --- Multiple Sources Multiple Destinations --- p.17Chapter 2.3 --- Power Minimization --- p.18Chapter 2.3.1 --- Power Minimization in Code-Multiplexing System --- p.19Chapter 2.3.2 --- Power Minimization in Frequency-multiplexing System --- p.19Chapter 2.3.3 --- Power Minimization in Time-Multiplexing System --- p.20Chapter 3 --- Sum Power Minimization with Superposition Coding --- p.21Chapter 3.1 --- System Model --- p.22Chapter 3.2 --- Superposition Coding Scheme --- p.22Chapter 3.2.1 --- Optimal Superposition Coding Scheme --- p.22Chapter 3.2.2 --- Sub-optimal Superposition Coding Scheme --- p.27Chapter 3.3 --- Performance Evaluation --- p.30Chapter 3.4 --- Assignment Examples for Superposition Coding Scheme --- p.33Chapter 4 --- Source-cooperated Transmission in a Wireless Cluster --- p.42Chapter 4.1 --- System Model --- p.42Chapter 4.2 --- Selection Protocol --- p.44Chapter 4.2.1 --- Protocol Description and Problem Formulation --- p.44Chapter 4.2.2 --- Distributed Selection Algorithm --- p.46Chapter 4.2.3 --- Low Rate Regime --- p.50Chapter 4.3 --- Simulation Results --- p.52Chapter 4.3.1 --- Simulation Configuration --- p.53Chapter 4.3.2 --- Cases with a Smaller Feasible Solution Set --- p.53Chapter 4.3.3 --- Cases with a Larger Feasible Solution Set --- p.56Chapter 5 --- Conclusion and Future Work --- p.61Chapter 5.1 --- Conclusion --- p.61Chapter 5.2 --- Future Work --- p.62Chapter 5.2.1 --- Fairness --- p.62Chapter 5.2.2 --- Distributed Algorithm --- p.63Chapter 5.2.3 --- Game Theory --- p.63Chapter 5.2.4 --- Distributed Information --- p.63Bibliography --- p.6