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

Joint Source and Relay Precoding Designs for MIMO Two-Way Relaying Based on MSE Criterion

Properly designed precoders can significantly improve the spectral efficiency of multiple-input multiple-output (MIMO) relay systems. In this paper, we investigate joint source and relay precoding design based on the mean-square-error (MSE) criterion in MIMO two-way relay systems, where two multi-antenna source nodes exchange information via a multi-antenna amplify-and-forward relay node. This problem is non-convex and its optimal solution remains unsolved. Aiming to find an efficient way to solve the problem, we first decouple the primal problem into three tractable sub-problems, and then propose an iterative precoding design algorithm based on alternating optimization. The solution to each sub-problem is optimal and unique, thus the convergence of the iterative algorithm is guaranteed. Secondly, we propose a structured precoding design to lower the computational complexity. The proposed precoding structure is able to parallelize the channels in the multiple access (MAC) phase and broadcast (BC) phase. It thus reduces the precoding design to a simple power allocation problem. Lastly, for the special case where only a single data stream is transmitted from each source node, we present a source-antenna-selection (SAS) based precoding design algorithm. This algorithm selects only one antenna for transmission from each source and thus requires lower signalling overhead. Comprehensive simulation is conducted to evaluate the effectiveness of all the proposed precoding designs.Comment: 32 pages, 10 figure

Esquemas distribuídos para seleção de múltiplas antenas em redes com retransmissores do tipo amplifica-e-encaminha

Orientador: José Cândido Silveira Santos FilhoTese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de ComputaçãoResumo: A seleção de antena na transmissão tem sido apresentada como uma estratégia promissora para explorar os benefícios do uso de múltiplas antenas em sistemas de comunicações com retransmissores. No entanto, essa abordagem pode exigir um montante considerável de estimações de canal, transmissões de realimentação e atraso, dado que a sua implementação ótima e centralizada requer o monitoramento do estado do canal de todos os enlaces. Para aliviar essas deficiências, este trabalho propõe e analisa um conjunto de esquemas subótimos de seleção de antena na transmissão para sistemas com retransmissores do tipo amplifica-e-encaminha, os quais podem ser implementados de uma forma distribuída. Nos esquemas propostos, a antena é selecionada com base na informação local do estado de canal que está disponível na fonte, requerendo, portanto, um atraso e uma carga de realimentação pequenos e constantes. Tal abordagem é considerada em uso conjunto com diferentes técnicas, incluindo métodos de combinação de diversidade (combinação por máxima razão e combinação por seleção) no destino, protocolos de ganho fixo ou variável no relay, e transceptores com múltiplas antenas no relay. Além disso, para o caso particular em que o retransmissor tem ganho fixo e uma única antena, considera-se também o uso de um mecanismo de seleção de enlace na fonte. Para cada caso, o desempenho do sistema é avaliado em termos de probabilidade de outage, eficiência espectral e/ou vazão. O foco principal é direcionado à probabilidade de outage, para a qual são deduzidas expressões exatas e limitantes de desempenho. Uma análise assintótica é também efetuada para enriquecer a compreensão do comportamento do sistema quando operando sob alta relação sinal-ruído. Finalmente, como contribuição isolada, uma estratégia subótima e simples de alocação de potência é elaborada para um sistema com múltiplos retransmissores do tipo decodifica-e-encaminha, considerando-se enlaces com erros e codificação de fonte distribuídaAbstract: Transmit-antenna selection has been presented as a promising strategy for exploiting the benefits of multiple antennas in relaying communication systems. However, this approach may demand a considerable amount of channel estimations, feedback transmissions, and delay, since its optimal centralized implementation requires monitoring the channel state of all links. To alleviate those impairments, this work proposes and analyzes a set of suboptimal transmit-antenna selection schemes for amplify-and-forward relaying systems, which can be implemented in a distributed manner. In the proposed schemes, the antenna is selected based on the local channel-state information that is available at the source, thus requiring a low and constant delay/feedback overhead. Such an approach is considered along with different techniques, including diversity combining methods (maximal-ratio combining and selection combining) at the destination, fixed- and variable-gain protocols at the relay, and multi-antenna transceivers at the relay. A link-selection mechanism at the source is also considered for the special case of a single-antenna fixed-gain relay. For each case, the system performance is assessed in terms of outage probability, spectral efficiency, and/or throughput. The main focus is placed on the outage probability, for which exact or bound expressions are derived. An asymptotic analysis is also performed to provide further insights into the system behavior at high signal-to-noise ratio. Finally, as an isolated contribution, a simple suboptimal power allocation strategy is designed for a decode-and-forward multi-relay system with lossy intra-links and distributed source codingDoutoradoTelecomunicações e TelemáticaDoutora em Engenharia ElétricaCAPE

Secrecy performance of TAS/SC-based multi-hop harvest-to-transmit cognitive WSNs under joint constraint of interference and hardware imperfection

In this paper, we evaluate the secrecy performance of multi-hop cognitive wireless sensor networks (WSNs). In the secondary network, a source transmits its data to a destination via the multi-hop relaying model using the transmit antenna selection (TAS)/selection combining (SC) technique at each hop, in the presence of an eavesdropper who wants to receive the data illegally. The secondary transmitters, including the source and intermediate relays, have to harvest energy from radio-frequency signals of a power beacon for transmitting the source data. Moreover, their transmit power must be adjusted to satisfy the quality of service (QoS) of the primary network. Under the joint impact of hardware imperfection and interference constraint, expressions for the transmit power for the secondary transmitters are derived. We also derive exact and asymptotic expressions of secrecy outage probability (SOP) and probability of non-zero secrecy capacity (PNSC) for the proposed protocol over Rayleigh fading channel. The derivations are then verified by Monte Carlo simulations.Web of Science195art. no. 116