Dispensing with channel estimation: differentially modulated cooperative wireless communications

As a benefit of bypassing the potentially excessive complexity and yet inaccurate channel estimation, differentially encoded modulation in conjunction with low-complexity noncoherent detection constitutes a viable candidate for user-cooperative systems, where estimating all the links by the relays is unrealistic. In order to stimulate further research on differentially modulated cooperative systems, a number of fundamental challenges encountered in their practical implementations are addressed, including the time-variant-channel-induced performance erosion, flexible cooperative protocol designs, resource allocation as well as its high-spectral-efficiency transceiver design. Our investigations demonstrate the quantitative benefits of cooperative wireless networks both from a pure capacity perspective as well as from a practical system design perspective

Splitting algorithm for DMT optimal cooperative MAC protocols in wireless mesh networks

A cooperative protocol for wireless mesh networks is proposed in this paper. The protocol implements both on-demand relaying and a selection of the best relay terminal so only one terminal is relaying the source message when cooperation is needed. Two additional features are also proposed. The best relay is selected with a splitting algorithm. This approach allows fast relay selection within less than three time-slots, on average. Moreover, a pre-selection of relay candidates is performed prior to the splitting algorithm. Only terminals that are able to improve the direct path are pre-selected. So efficient cooperation is now guaranteed. We prove that this approach is optimal in terms of diversity-multiplexing trade-off. The protocol has been designed in the context of Nakagami-mfading channels. Simulation results show that the performance of the splitting algorithm does not depend on channel statistics

Comprehensive performance analysis of fully cooperative communication in WBANs

© 2013 IEEE. While relay-based cooperative networks (widely known in the literature as cooperative communication), where relays only forward signals from the sources to the destination, have been extensively researched, fully cooperative systems have not been thoroughly examined. Unlike relay networks, in a fully cooperative network, each node acts as both a source node sending its own data and a relay forwarding its partner's data to the destination. Mutual cooperation between neighboring nodes is believed to improve the overall system error performance, especially when space-time codes are incorporated. However, a comprehensive performance analysis of space-time-coded fully cooperative communication from all three perspectives, namel,y error performance, outage probability, and energy efficiency, is still missing. Answers to the commonly asked questions of whether, in what conditions, and to what extent the space-time-coded fully cooperative communication is better than direct transmission are still unknown. Motivated by this fact and inspired by the increasing popularity of healthcare applications in wireless body area networks (WBANs), this paper derives for the first time a comprehensive performance analysis of a decode-and-forward space-time coded fully cooperative communication network in Rayleigh and Rician fading channels in either identically or non-identically distributed fading scenario. Numerical analysis of error performance, outage probability, and energy efficiency, validated by simulations, show that fully cooperative communication is better than direct transmission from all three aspects in many cases, especially at a low-power and low signal-to-noise ratio regime, which is a typical working condition in WBANs

DMT Optimal Cooperative Protocols with Destination-Based Selection of the Best Relay

We design a cooperative protocol in the context of wireless mesh networks in order to increase the reliability of wireless links. Destination terminals ask for cooperation when they fail in decoding data frames transmitted by source terminals. In that case, each destination terminal D calls a specific relay terminal B with a signaling frame to help its transmission with source terminal S. To select appropriate relays, destination terminals maintain tables of relay terminals, one for each possible source address. These tables are constituted by passively overhearing ongoing transmissions. Hence, when cooperation is needed between S and D, and when a relay B is found by terminal D in the relay table associated with terminal S, the destination terminal sends a negative acknowledgment frame that contains the address of B. When the best relay B has successfully decoded the source message, it sends a copy of the data frame to D using a selective decode-andforward transmission scheme. The on-demand approach allows maximization of the spatial multiplexing gain and the cooperation of the best relay allows maximization of the spatial diversity order. Hence, the proposed protocol achieves optimal diversitymultiplexing trade-off performance. Moreover, this performance is achieved through a collision-free selection process

DMT Optimal On-Demand Relaying for Mesh Networks

This paper presents a new cooperative MAC (Medium Access Control) protocol called BRIAF (Best Relay based Incremental Amplify-and-Forward). The proposed protocol presents two features: on-demand relaying and selection of the best relay terminal. “On-demand relaying” means that a cooperative transmission is implemented between a source terminal and a destination terminal only when the destination terminal fails in decoding the data transmitted by the source terminal. This feature maximizes the spatial multiplexing gain r of the transmission. “Selection of the best relay terminal” means that a selection of the best relay among a set of (m-1) relay candidates is implemented when a cooperative transmission is needed. This feature maximizes the diversity order d(r) of the transmission. Hence, an optimal DMT (Diversity Multiplexing Tradeoff) curve is achieved with a diversity order d(r) = m(1-r) for 0 ≤ r ≤ 1

Distributed transmission schemes for wireless communication networks

In this thesis new techniques are presented to achieve performance enhancement in wireless cooperative networks. In particular, techniques to improve transmission rate and maximise end-to-end signal-to-noise ratio are described. An offset transmission scheme with full interference cancellation for a wireless cooperative network with frequency flat links and four relays is introduced. This method can asymptotically, as the size of the symbol block increases, achieve maximum transmission rate together with full cooperative diversity provided the destination node has multiple antennas. A novel full inter-relay interference cancellation method that also achieves asymptotically maximum rate and full cooperative diversity is then designed for which the destination node only requires a single antenna. Two- and four-relay selection schemes for wireless cooperative amplify and forward type networks are then studied in order to overcome the degradation of end-to-end bit error rate performance in single-relay selection networks when there are feedback errors in the relay to destination node links. Outage probability analysis for a four-relay selection scheme without interference is undertaken. Outage probability analysis of a full rate distributed transmission scheme with inter-relay interference is also studied for best single- and two-relay selection networks. The advantage of multi-relay selection when no interference occurs and when adjacent cell interference is present at the relay nodes is then shown theoretically. Simulation results for outage probability analysis are included which support the theoretical expressions. Finally, outage probability analysis of a cognitive amplify and forward type relay network with cooperation between certain secondary users, chosen by best single-, two- and four-relay selection is presented. The cognitive amplify and forward relays are assumed to exploit an underlay approach, which requires adherence to an interference constraint on the primary user. The relay selection scheme is performed either with a max−min strategy or one based on maximising exact end-to-end signal-to-noise ratio. The outage probability analyses are again confirmed by numerical evaluations

Pragmatic Space-Time Codes for Cooperative Relaying in Block Fading Channels

We address the problem of construction of space-time codes for cooperative communications in block fading channels. More precisely, we consider a pragmatic approach based on the concatenation of convolutional codes and BPSK/QPSK modulation to obtain cooperative codes for relay networks, for which we derive the pairwise error probability, an asymptotic bound for frame error probability, and a design criterion to optimize both diversity and coding gain. Based on this framework, we set up a code search procedure to obtain a set of good pragmatic space-time codes (P-STCs) with overlay construction, suitable for cooperative communication with a variable number of relays in quasistatic channel, which outperform in terms of coding gain other space-time codes (STCs) proposed in the literature. We also find that, despite the fact that the implementation of pragmatic space-time codes requires standard convolutional encoders and Viterbi decoders with suitable generators and branch metric, thus having low complexity, they perform quite well in block fading channels, including quasistatic channel, even with a low number of states and relays

Técnicas de pré-codificação para sistemas multicelulares coordenados

Doutoramento em TelecomunicaçõesCoordenação Multicélula é um tópico de investigação em rápido crescimento e uma solução promissora para controlar a interferência entre células em sistemas celulares, melhorando a equidade do sistema e aumentando a sua capacidade. Esta tecnologia já está em estudo no LTEAdvanced sob o conceito de coordenação multiponto (COMP). Existem várias abordagens sobre coordenação multicélula, dependendo da quantidade e do tipo de informação partilhada pelas estações base, através da rede de suporte (backhaul network), e do local onde essa informação é processada, i.e., numa unidade de processamento central ou de uma forma distribuída em cada estação base. Nesta tese, são propostas técnicas de pré-codificação e alocação de potência considerando várias estratégias: centralizada, todo o processamento é feito na unidade de processamento central; semidistribuída, neste caso apenas parte do processamento é executado na unidade de processamento central, nomeadamente a potência alocada a cada utilizador servido por cada estação base; e distribuída em que o processamento é feito localmente em cada estação base. Os esquemas propostos são projectados em duas fases: primeiro são propostas soluções de pré-codificação para mitigar ou eliminar a interferência entre células, de seguida o sistema é melhorado através do desenvolvimento de vários esquemas de alocação de potência. São propostas três esquemas de alocação de potência centralizada condicionada a cada estação base e com diferentes relações entre desempenho e complexidade. São também derivados esquemas de alocação distribuídos, assumindo que um sistema multicelular pode ser visto como a sobreposição de vários sistemas com uma única célula. Com base neste conceito foi definido uma taxa de erro média virtual para cada um desses sistemas de célula única que compõem o sistema multicelular, permitindo assim projectar esquemas de alocação de potência completamente distribuídos. Todos os esquemas propostos foram avaliados em cenários realistas, bastante próximos dos considerados no LTE. Os resultados mostram que os esquemas propostos são eficientes a remover a interferência entre células e que o desempenho das técnicas de alocação de potência propostas é claramente superior ao caso de não alocação de potência. O desempenho dos sistemas completamente distribuídos é inferior aos baseados num processamento centralizado, mas em contrapartida podem ser usados em sistemas em que a rede de suporte não permita a troca de grandes quantidades de informação.Multicell coordination is a promising solution for cellular wireless systems to mitigate inter-cell interference, improving system fairness and increasing capacity and thus is already under study in LTE-A under the coordinated multipoint (CoMP) concept. There are several coordinated transmission approaches depending on the amount of information shared by the transmitters through the backhaul network and where the processing takes place i.e. in a central processing unit or in a distributed way on each base station. In this thesis, we propose joint precoding and power allocation techniques considering different strategies: Full-centralized, where all the processing takes place at the central unit; Semi-distributed, in this case only some process related with power allocation is done at the central unit; and Fulldistributed, where all the processing is done locally at each base station. The methods are designed in two phases: first the inter-cell interference is removed by applying a set of centralized or distributed precoding vectors; then the system is further optimized by centralized or distributed power allocation schemes. Three centralized power allocation algorithms with per-BS power constraint and different complexity tradeoffs are proposed. Also distributed power allocation schemes are proposed by considering the multicell system as superposition of single cell systems, where we define the average virtual bit error rate (BER) of interference-free single cell system, allowing us to compute the power allocation coefficients in a distributed manner at each BS. All proposed schemes are evaluated in realistic scenarios considering LTE specifications. The numerical evaluations show that the proposed schemes are efficient in removing inter-cell interference and improve system performance comparing to equal power allocation. Furthermore, fulldistributed schemes can be used when the amounts of information to be exchanged over the backhaul is restricted, although system performance is slightly degraded from semi-distributed and full-centralized schemes, but the complexity is considerably lower. Besides that for high degrees of freedom distributed schemes show similar behaviour to centralized ones