Physical-layer Network Coding for Cooperative Wireless Networks

As a newly-emerged paradigm in the networking techniques, physical-layer network coding (PNC) [1, 5] takes advantage of the superimposition of the electromagnetic waves, and embraces the interference which was typically deemed as harmful, by performing exclusive-or mapping. Therefore, the spectral efficiency is utilized, which in turn boosts the network throughput. In the classical 2-way relay channel (2-WRC), PNC only spends two channel uses for the bi-directional data exchange. However, one challenge for such a paradigm is that the singular fading states in the uplink of 2-WRC, might result in ambiguity for decoding the network coded symbol. One major focus of this thesis is to address the fading issue for PNC in the 2-WRC. Another fundamental challenge for PNC is to extend the PNC from the 2-WRC to a multi-user network such as the multi-way relay channel (M-WRC) or the hierarchical wireless network (HWN). To tackle these two fundamental challenges of PNC, several solutions are proposed in this thesis, which are summarized as follows: First, we introduce two efficient fading correction strategies, i.e., the rotationally-invariant coded modulation and the soft-bit correction. Second, a novel multilevel coded linear PNC scheme with extended mapping for the Rayleigh fading 2-WRC is proposed. Third, we design a new type of linear PNC for the Rayleigh fading 2-WRC, based on rings. We refer to such design as linear PNC over the hybrid finite ring. Fourth, we redesign PNC for the HWN, which facilitates the multi-user data exchange. To combat the co-channel interference introduced by multi-user data exchange, two efficient interference exploitation strategies based on network coding are proposed: 1) PNC with joint decoding; and 2) analogue network coding with interference-aware maximum likelihood detection. Finally, we propose a multilevel coded LPNC for the data exchange in the M-WRC

Physical-Layer Cooperation in Coded OFDM Relaying Systems

Mobile communication systems nowadays require ever-increasing data rate and coverage of wide areas. One promising approach to achieve this goal is the application of cooperative communications enabled by introducing intermediate nodes known as relays to support the transmission between terminals. By processing and forwarding the receive message at the relays, the path-loss effect between the source and the destination is mitigated. One major limit factor for relay assisted communications is that a relay cannot transmit and receive using the same physical resources. Therefore, a half-duplex constraint is commonly assumed resulting in halved spectral efficiency. To combat this drawback, two-way relaying is introduced, where two sources exchange information with each. On the other hand, due to the physical limitation of the relays, e.g., wireless sensor nodes, it's not possible to implement multiple antennas at one relay, which prohibits the application of multiple-input multiple-output (MIMO) techniques. However, when treating multiple relays as a cluster, a virtual antenna array is formed to perform MIMO techniques in a distributed manner. %This thesis aims at designing efficient one-way and two-way relaying schemes. Specifically, existing schemes from the literature are improved and new schemes are developed with the emphasis on coded orthogonal frequency division multiplexing (OFDM) transmissions. Of special interest is the application of physical-layer network coding (PLNC) for two-phase two-way relaying. In this case, a network coded message is estimated from the superimposed receive signal at the relay using PLNC schemes. The schemes are investigated based on a mutual information analysis and their performance are improved by a newly proposed phase control strategy. Furthermore, performance degradation due to system asynchrony is mitigated depending on different PLNC schemes. When multiple relays are available, novel cooperation schemes allowing information exchange within the relay cluster are proposed that facilitate distributed MIMO reception and transmission. Additionally, smart signaling approaches are presented to enable the cooperation at different levels with the cooperation overhead taken into account adequately in system performance evaluation

Soft information based protocols in network coded relay networks

Future wireless networks aim at providing higher quality of service (QoS) to mobile users. The emergence of relay technologies has shed light on new methodologies through which the system capacity can be dramatically increased with low deployment cost. In this thesis, novel relay technologies have been proposed in two practical scenarios: wireless sensor networks (WSN) and cellular networks. In practical WSN designs, energy conservation is the single most important requirement. This thesis draws attention to a multiple access relay channels model in the WSN. The network coded symbol for the received signals from correlated sources has been derived; the network coded symbol vector is then converted into a sparse vector, after which a compressive sensing (CS) technique is applied over the sparse signals. A theoretical proof analysis is derived regarding the reliability of the network coded symbol formed in the proposed protocol. The proposed protocol results in a better bit error rate (BER) performance in comparison to the direct implementation of CS on the EF protocol. Simulation results validate our analyses. Another hot topic is the application of relay technologies to the cellular networks. In this thesis, a practical two-way transmission scheme is proposed based on the EF protocol and the network coding technique. A trellis coded quantization/modulation (TCQ/M) scheme is used in the network coding process. The soft network coded symbols are quantized into only one bit thus requiring the same transmission bandwidth as the simplest decode-and-forward protocol. The probability density function of the network coded symbol is derived to help to form the quantization codebook for the TCQ. Simulations show that the proposed soft forwarding protocol can achieve full diversity with only a transmission rate of 1, and its BER performance is equivalent to that of an unquantized EF protocol

Soft information based protocols in network coded relay networks

Future wireless networks aim at providing higher quality of service (QoS) to mobile users. The emergence of relay technologies has shed light on new methodologies through which the system capacity can be dramatically increased with low deployment cost. In this thesis, novel relay technologies have been proposed in two practical scenarios: wireless sensor networks (WSN) and cellular networks. In practical WSN designs, energy conservation is the single most important requirement. This thesis draws attention to a multiple access relay channels model in the WSN. The network coded symbol for the received signals from correlated sources has been derived; the network coded symbol vector is then converted into a sparse vector, after which a compressive sensing (CS) technique is applied over the sparse signals. A theoretical proof analysis is derived regarding the reliability of the network coded symbol formed in the proposed protocol. The proposed protocol results in a better bit error rate (BER) performance in comparison to the direct implementation of CS on the EF protocol. Simulation results validate our analyses. Another hot topic is the application of relay technologies to the cellular networks. In this thesis, a practical two-way transmission scheme is proposed based on the EF protocol and the network coding technique. A trellis coded quantization/modulation (TCQ/M) scheme is used in the network coding process. The soft network coded symbols are quantized into only one bit thus requiring the same transmission bandwidth as the simplest decode-and-forward protocol. The probability density function of the network coded symbol is derived to help to form the quantization codebook for the TCQ. Simulations show that the proposed soft forwarding protocol can achieve full diversity with only a transmission rate of 1, and its BER performance is equivalent to that of an unquantized EF protocol

Physical Layer Cooperation:Theory and Practice

Information theory has long pointed to the promise of physical layer cooperation in boosting the spectral efficiency of wireless networks. Yet, the optimum relaying strategy to achieve the network capacity has till date remained elusive. Recently however, a relaying strategy termed Quantize-Map-and-Forward (QMF) was proved to achieve the capacity of arbitrary wireless networks within a bounded additive gap. This thesis contributes to the design, analysis and implementation of QMF relaying by optimizing its performance for small relay networks, proposing low-complexity iteratively decodable codes, and carrying out over-the-air experiments using software-radio testbeds to assess real-world potential and competitiveness. The original QMF scheme has each relay performing the same operation, agnostic to the network topology and the channel state information (CSI); this facilitates the analysis for arbitrary networks, yet comes at a performance penalty for small networks and medium SNR regimes. In this thesis, we demonstrate the benefits one can gain for QMF if we optimize its performance by leveraging topological and channel state information. We show that for the N-relay diamond network, by taking into account topological information, we can exponentially reduce the QMF additive approximation gap from $\Theta(N)$ bits/s/Hz to $\Theta(\log N)$ bits/s/Hz, while for the one-relay and two-relay networks, use of topological information and CSI can help to gain as much as $6$ dB. Moreover, we explore what benefits we can realize if we jointly optimize QMF and half-duplex scheduling, as well as if we employ hybrid schemes that combine QMF and Decode-and-Forward (DF) relay operations. To take QMF from being a purely information-theoretic idea to an implementable strategy, we derive a structure employing Low-Density-Parity-Check (LDPC) ensembles for the relay node operations and message-passing algorithms for decoding. We demonstrate through extensive simulation results over the full-duplex diamond network, that our designs offer a robust performance over fading channels and achieves the full diversity order of our network at moderate SNRs. Next, we explore the potential real-world impact of QMF and present the design and experimental evaluation of a wireless system that exploits relaying in the context of WiFi. We deploy three main competing strategies that have been proposed for relaying, Amplify-and-Forward (AF), DF and QMF, on the WarpLab software radio platform. We present experimental results--to the best of our knowledge, the first ones--that compare QMF, AF and DF in a realistic indoor setting. We find that QMF is a competitive scheme to the other two, offering in some cases up to 12% throughput benefits and up to 60% improvement in frame error-rates over the next best scheme. We then present a more advanced architecture for physical layer cooperation (termed QUILT), that seamlessly adapts to the underlying network configuration to achieve competitive or better performance than the best current approaches. It combines on-demand, opportunistic use of DF or QMF followed by interleaving at the relay, with hybrid decoding at the destination that extracts information from even potentially undecodable received frames. We theoretically quantify how our design choices affect the system performance. We also deploy QUILT on WarpLab and show through over-the-air experiments up to $5$ times FER improvement over the next best cooperative protocol

Physical Layer Secret Key Agreement Using One-Bit Quantization and Low-Density Parity-Check Codes

Physical layer approaches for generating secret encryption keys for wireless systems using channel information have attracted increased interest from researchers in recent years. This paper presents a new approach for calculating log-likelihood ratios (LLRs) for secret key generation that is based on one-bit quantization of channel measurements and the difference between channel estimates at legitimate reciprocal nodes. The studied secret key agreement approach, which implements advantage distillation along with information reconciliation using Slepian-Wolf low-density parity-check (LDPC) codes, is discussed and illustrated with numerical results obtained from simulations. These results show the probability of bit disagreement for keys generated using the proposed LLR calculations compared with alternative LLR calculation methods for key generation based on channel state information. The proposed LLR calculations are shown to be an improvement to the studied approach of physical layer secret key agreement

Esquemas de cooperação entre estações base para o LTE no sentido descendente

The explosive growth in wireless traffic and in the number of connected devices as smart phones or computers, are causing a dramatic increase in the levels of interference, which significantly degrades the capacity gains promised by the point-to-point multi input, multi output (MIMO) based techniques. Therefore, it is becoming increasingly clear that major new improvements in spectral efficiency of wireless networks will have to entail addressing intercell interference. So, there is a need for a new cellular architecture that can take these factors under consideration. It is in this context that LTE-Advanced arises. One of the most promising LTE-Advanced technology is Coordinated Multipoint (CoMP), which allows base stations to cooperate among them, in order to mitigate or eliminate the intercell interference and, by doing so, increase the system’s capacity. This thesis intends to study this concept, implementing some schemes that fall under the CoMP concept. In this thesis we consider a distributed precoded multicell approach, where the precoders are computed locally at each BS to mitigate the intercell interference. Two precoder are considered: distributed zero forcing (DZF) and distributed virtual signal-to-interference noise ratio (DVSINR) recently proposed. Then the system is further optimized by computing a power allocation algorithm over the subcarriers that minimizes the average bit error rate (BER). The considered algorithms are also evaluated under imperfect channel state information. A quantized version of the CSI associated to the different links between the BS and the UT is feedback from the UT to the BS. This information is then employed by the different BSs to perform the precoding design. A new DVSINR precoder explicitly designed under imperfect CSI is proposed. The proposed schemes were implemented considering the LTE specifications, and the results show that the considered precoders are efficiently to remove the interference even under imperfect CSI.O crescimento exponencial no tráfego de comunicações sem-fios e no número de dispositivos utilizados (smart phones, computadores portáteis, etc.) está a causar um aumento significativo nos níveis de interferência, que prejudicam significativamente os ganhos de capacidade assegurados pelas tecnologias baseadas em ligações ponto-a-ponto MIMO. Deste modo, torna-se cada vez mais necessário que os grandes aperfeiçoamentos na eficiência espectral de sistemas de comunicações sem-fios tenham em consideração a interferência entre células. De forma a tomar em consideração estes aspectos, uma nova arquitectura celular terá de ser desenvolvida. É assim, neste contexto, que surge o LTE-Advanced. Uma das tecnologias mais promissoras do LTE-Advanced é a Coordenação Multi-Ponto (CoMP), que permite que as estações base cooperem de modo a mitigar a interferência entre células e, deste modo, aumentar a capacidade do sistema. Esta dissertação pretende estudar este conceito, implementando para isso algumas técnicas que se enquadram no conceito do CoMP. Nesta dissertação iremos considerar a implementação de um sistema de pré-codificação em múltiplas células, em que os pré-codificadores são calculados em cada BS, de modo a mitigar a interferência entre células. São considerados dois pré-codificadores: Distributed Zero Forcing (DZF) e Distributed Virtual Signal-to-Interferance Noise Ratio (DVSINR), recentemente proposto. De seguida o sistema é optimizado com a introdução de algoritmos de alocação de potência entre as sub-portadoras com o objectivo de minimizar a taxa média de erros (BER). Os algoritmos considerados são também avaliados em situações em que a informação do estado do canal é imperfeita. Uma versão quantizada da CSI associada a cada uma das diferentes ligações entre as BS e os UT é assim enviada do UT para a BS. Esta informação é então utilizada para calcular os diferentes pré-codificadores em cada BS. Uma nova versão do pré-codificador DVSINR é proposta de modo a lidar com CSI imperfeito. Os esquemas propostos foram implementados considerandos especificações do LTE, e os resultados obtidos demonstram que os pré-codificadores removem de uma forma eficiente a interferência, mesmo em situações em que a CSI é imperfeita

On Non-Binary Constellations for Channel Encoded Physical Layer Network Coding

This thesis investigates channel-coded physical layer network coding, in which the relay directly transforms the noisy superimposed channel-coded packets received from the two end nodes, to the network-coded combination of the source packets. This is in contrast to the traditional multiple-access problem, in which the goal is to obtain each message explicitly at the relay. Here, the end nodes $A$ and $B$ choose their symbols, $S_A$ and $S_B$, from a small non-binary field, $\mathbb{F}$, and use non-binary PSK constellation mapper during the transmission phase. The relay then directly decodes the network-coded combination ${aS_A+bS_B}$ over $\mathbb{F}$ from the noisy superimposed channel-coded packets received from two end nodes. Trying to obtain $S_A$ and $S_B$ explicitly at the relay is overly ambitious when the relay only needs $aS_B+bS_B$. For the binary case, the only possible network-coded combination, ${S_A+S_B}$ over the binary field, does not offer the best performance in several channel conditions. The advantage of working over non-binary fields is that it offers the opportunity to decode according to multiple decoding coefficients $(a,b)$. As only one of the network-coded combinations needs to be successfully decoded, a key advantage is then a reduction in error probability by attempting to decode against all choices of decoding coefficients. In this thesis, we compare different constellation mappers and prove that not all of them have distinct performance in terms of frame error rate. Moreover, we derive a lower bound on the frame error rate performance of decoding the network-coded combinations at the relay. Simulation results show that if we adopt concatenated Reed-Solomon and convolutional coding or low density parity check codes at the two end nodes, our non-binary constellations can outperform the binary case significantly in the sense of minimizing the frame error rate and, in particular, the ternary constellation has the best frame error rate performance among all considered cases