A new achievable sum DoF result in multi-user half-duplex relay networks

This is the author accepted manuscript. The final version is available from IEEE via the DOI in this recordThis paper investigates the achievable sum degrees of freedom (DoF) in a wireless single-antenna multi-user relay network, which consists of multiple sources, multiple destinations, and multiple layers of half-duplex relays in between. A cluster successive relaying (CSR) transmission scheme is applied to efficiently deliver information in this network. Different from existing works on the CSR scheme which normally divide each layer of relays into two alternatively activated equal-size clusters, we allow the clusters to contain different numbers of terminals in order to properly involve all available relays into the transmission process. Using the channel-extension based interference alignment technique, it is shown that the asymptotically achievable sum DoF can be larger than the previously known results and hence can serve as a new lower bound to the optimally achievable sum DoF in the considered relay network.National Natural Science Foundation of ChinaEuropean Union Horizon 2020European Union FP

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

Wireless Video Transmission with Over-the-Air Packet Mixing

In this paper, we propose a system for wireless video transmission with a wireless physical layer (PHY) that supports cooperative forwarding of interfered/superimposed packets. Our system model considers multiple and independent unicast transmissions between network nodes while a number of them serve as relays of the interfered/superimposed signals. For this new PHY the average transmission rate that each node can achieve is estimated first. Next, we formulate a utility optimization framework for the video transmission problem and we show that it can be simplified due to the features of the new PHY. Simulation results reveal the system operating regions for which superimposing wireless packets is a better choice than a typical cooperative PHY.Comment: 2012 Packet Video Worksho

Adaptive resource allocation within three-stage OFDM relay networks

In this work we consider OFDM transmission, due to its potential for meeting the stringent quality of service (QoS) targets of next-generation broadband distributed wireless networks, over three-stage relay networks. In particular, we examine distributed adaptive space-frequency coding for generally asynchronous links composed of four transmit and/or receive antennas, i.e. exploiting quasi-orthogonal and extended-orthogonal coding schemes. The successful deployment of these closed-loop methods is dependent upon channel state information (CSI) being available for each stage of the network. Taking the maximum end-to-end data rate as the optimal criterion, an adaptive resource allocation (RA) scheme suitable for a wide range of signal-to-noise-ratios (SNRs) and a prescribed transmit power budget is proposed to distribute appropriate resources to each stage based on the channel state information (CSI) and knowledge of the network topology

Efficient Transmission in Multi-user Relay Networks with Node Clustering and Network Coding

This is the author accepted manuscript. The final version is available from IEEE via the DOI in this recordThis paper investigates the communication problem in a class of multi-user dual-hop networks in which multiple source terminals desire to distribute their independent messages to multiple destinations through the assistance of multiple relay terminals. We consider an efficient transmission strategy that combines network coding and non-orthogonal transmission techniques to balance the achievability of spatial diversity and channel utilization. Specifically, in addition to applying a class of finite-field network codes in the relays, we divide the sources and the relays into clusters such that terminals within each cluster can access the same channel resource. The achievable error performance under Nakagami-m fading environment is derived and is shown to significantly outperform the conventional transmission methods.National Natural Science Foundation of ChinaEuropean Union Horizon 202

Linear transceiver design in nonregenerative relays with channel state information

This paper deals with the design of nonregenerative relaying transceivers in cooperative systems where channel state information (CSI) is available at the relay station. The conventional nonregenerative approach is the amplify and forward (A&F) approach, where the signal received at the relay is simply amplified and retransmitted. In this paper, we propose an alternative linear transceiver design for nonregenerative relaying (including pure relaying and the cooperative transmission cases), making proper use of CSI at the relay station. Specifically, we design the optimum linear filtering performed on the data to be forwarded at the relay. As optimization criteria, we have considered the maximization of mutual information (that provides an information rate for which reliable communication is possible) for a given available transmission power at the relay station. Three different levels of CSI can be considered at the relay station: only first hop channel information (between the source and relay); first hop channel and second hop channel (between relay and destination) information, or a third situation where the relay may have complete cooperative channel information including all the links: first and second hop channels and also the direct channel between source and destination. Despite the latter being a more unrealistic situation, since it requires the destination to inform the relay station about the direct channel, it is useful as an upper benchmark. In this paper, we consider the last two cases relating to CSI.We compare the performance so obtained with the performance for the conventional A&F approach, and also with the performance of regenerative relays and direct noncooperative transmission for two particular cases: narrowband multiple-input multiple-output transceivers and wideband single input single output orthogonal frequency division multiplex transmissions.Peer Reviewe

Relay-Aided Communication in Large Interference Limited Wireless Networks

In recent years, the number of active wireless devices increases exponentially and it is, therefore, to expect that the interference increases as well. Interference between communication links is the major performance limiting factor in today's communication networks. Hence, the handling of the overall interference in a network is one major challenge in wireless communication networks of the future. If the interference signals are weak in comparison to the useful signal, they can be simply treated as noise. If the interference signals are strong in comparison to the useful signal, they can be reliably decoded and subtracted from the received signal at the receivers. However, in multiuser communication networks, the interference and the useful signal are often of comparable signal strength. The conventional approach to handle these interference signals is to orthogonalize the useful signal and the interference signals using, e.g., time division multiple access (TDMA) or frequency division multiple access (FDMA). In the past few years, instead of orthogonalization, interference alignment (IA) has been developed as an efficient technique to handle interference signals, especially in the high signal to noise ratio (SNR) region. The basic idea of IA is to align multiple interference signals in a particular subspace of reduced dimension at each receiver. The objective is to minimize the signal dimensions occupied by interference at each receiver. In order to perform IA, the receive space is divided into two disjoint subspaces, the useful signal subspace and the interference signal subspace. Each transmitting node designs its transmit filters in such a way that at each receiving node, all interference signals are within the interference subspace and only the useful signal is in the useful subspace. In this thesis, the focus is on large interference limited wireless communication networks. In contrast to the conventional use of relays, for extending the coverage, in this thesis, the relays are used to manipulate the effective end-to-end channel between the transmitters and receivers to perform IA in the network. Since the relays are used to assist the process of IA and not interested in the data streams transmitted by the nodes, amplify-and-forward relays are sufficient to support the process of IA. Therefore, the main focus of this thesis is on amplify-and-forward relays. Throughout this thesis, it is assumed that all nodes and relays are multi-antenna half-duplex devices. When considering large networks, the assumption that all nodes are connected to all relays does not hold due to physical propagation phenomena, e.g., high path loss and shadowing. In such large networks, the distances between different nodes may differ a lot, leading to links of considerably different signal strengths, where sufficiently weak links may be neglected. Hence, large networks are in general partially connected. In this thesis, three important interference-limited relay aided wireless network topologies are investigated, the partially connected relay aided multi-pair pair-wise communication network, the fully connected multi-group multi-way relaying network and the partially connected multi-group multi-way relaying network. For each of these topologies, new algorithms to perform IA are developed in this thesis. First, a large partially connected relay aided pair-wise communication network is considered. The concept of an appropriate partitioning of a partially connected network into subnetworks which are themselves fully connected is introduced. Each of these subnetworks contains a single relay and all nodes being connected to this relay. Some nodes or even communication pairs may be connected to multiple relays. The bidirectional pair-wise communication between the nodes takes place via the intermediate relays, using the two-way relaying protocol. Only relays which are connected to both nodes of a communication pair can serve this pair. Hence, it is assumed that all communication pairs in the entire network are served by at least one relay. The most challenging part of such a partially connected network is the handling of nodes which are connected to multiple relays. Hence, techniques called simultaneous signal alignment (SSA) and simultaneous channel alignment (SCA), are proposed to perform signal alignment (SA) and channel alignment (CA) with multiple relays simultaneously. SA means that all nodes transmit to the relay in such a way that the signals of each communicating pair are pair-wise aligned at the relay. For CA, which is dual to SA, the receive filter of each node is designed such that the effective channels between the relay and both nodes of a communicating pair span the same subspace. A closed-form solution to perform IA in this network topology is obtained and the properness conditions for SSA and SCA are derived. It is shown that local channel state information (CSI) is sufficient to perform IA in partially connected networks, whereas in fully connected relay aided networks, global CSI is required in general. Through simulations, it is shown that the proposed closed-form solution achieves more degrees of freedom (DoF) than the reference algorithms and has better sum-rate performance, especially in the high SNR-region. Especially in large wireless networks, it may happen that not both nodes of a communication pair are connected to the same relays. If a single node of a communication pair is in addition connected to a relay which, therefore, cannot assist the communication, this node receives only interference and no useful signal from this relay. Such a node suffers from inter-subnetwork interference, due to the connection by an inter-subnetwork link to the additional relay. Hence, in this thesis, a closed form algorithm which minimizes the inter-subnetwork interference power in the whole partially connected network is proposed and the properness conditions are derived. The condition under which an interference free-communication can be achieved by the proposed inter-subnetwork interference power minimization algorithm is derived. Further, it is shown that the proposed inter-subnetwork interference power minimization algorithm achieves a higher sum rate in comparison to the considered reference algorithm. Secondly, a fully connected multi-group multi-way relaying networks is considered. In such a network, multiple nodes form a group and each node wants to share its message with all other nodes in its group via an intermediate relay. The group-wise communication between the nodes inside a group takes place via the intermediate relay, using a transmission strategy considering several multiple access (MAC) phases and several multicast (MC) phases, in general. In this thesis, a multicast IA algorithm to handle the interference in such a network is proposed. The idea of the proposed algorithm is that in each of the MC phases, a multiple input multiple output (MIMO) interference multicast channel is created by separating the antennas of the relay into as many clusters as groups in the network. Each of these clusters serves a specific group of nodes and transmits in such a way that the signals transmitted from different clusters are aligned at the receiving nodes of the non-intended multicast groups. It is shown that the minimum required number of antennas at the relay is independent of the number of nodes per group, which is an important property since the number of antennas available at the relay is limited in general. Furthermore, the properness conditions for the proposed multicast IA algorithm are derived. It is shown that the proposed multicast algorithm outperforms a reference algorithm for a broad range of SNR values, while still requiring less antennas at the relay. Finally, a large partially connected multi-group multi-way relay network is considered. In contrast to the fully connected multi-group multi-way relaying network, multiple relays are considered in this partially connected network. Such a partially connected network can be partitioned into subnetworks that are themselves fully connected. Hence, such a partially connected network consists of multiple subnetworks, where each of these contains a single relay and all groups of nodes which are connected to this relay. Each group of nodes may be connected to one or multiple relays. This means that not all groups of nodes are connected to all relays in the network. However, any group is connected to at least one relay which serves this group of nodes. The group-wise exchange of data between the nodes inside a group is performed via the multi-way relaying protocol. The most challenging part of such a partially connected network is the handling of the nodes inside groups which are connected to multiple relays. To overcome this challenge, new techniques called simultaneous group signal alignment (SGSA) and simultaneous group channel alignment (SGCA) are introduced to perform SA and CA in partially connected multi-group multi-way relaying networks. A closed-form IA solution for this network topology is obtained and the properness conditions for the solvability of SGSA and SGCA are derived. It is shown that the proposed IA algorithm outperforms the reference algorithm in terms of sum rate and DoF