Signal-Level Cooperative Spatial Multiplexing for Uplink Throughput Enhancement in MIMO Broadband Systems

International audienceIn this paper, we address the issue of throughputefficient half-duplex constrained relaying schemes for broadband uplink transmissions over multiple-input multiple-output (MIMO) channels. We introduce a low complexity signal-level cooperative spatial multiplexing (CM) architecture that allows for the shortening of the relaying phase without resorting to any symbol detection or re-mapping at the relay side. Half-duplex latency is thereby reduced, resulting in a remarkable throughput gain compared to amplify-and-forward (AF) relaying scheme. Surprisingly, we show that CM strategy becomes more powerful in boosting uplink throughput as the relay approaches cell edge

D13.2 Techniques and performance analysis on energy- and bandwidth-efficient communications and networking

Deliverable D13.2 del projecte europeu NEWCOM#The report presents the status of the research work of the various Joint Research Activities (JRA) in WP1.3 and the results that were developed up to the second year of the project. For each activity there is a description, an illustration of the adherence to and relevance with the identified fundamental open issues, a short presentation of the main results, and a roadmap for the future joint research. In the Annex, for each JRA, the main technical details on specific scientific activities are described in detail.Peer ReviewedPostprint (published version

Modelling, Dimensioning and Optimization of 5G Communication Networks, Resources and Services

This reprint aims to collect state-of-the-art research contributions that address challenges in the emerging 5G networks design, dimensioning and optimization. Designing, dimensioning and optimization of communication networks resources and services have been an inseparable part of telecom network development. The latter must convey a large volume of traffic, providing service to traffic streams with highly differentiated requirements in terms of bit-rate and service time, required quality of service and quality of experience parameters. Such a communication infrastructure presents many important challenges, such as the study of necessary multi-layer cooperation, new protocols, performance evaluation of different network parts, low layer network design, network management and security issues, and new technologies in general, which will be discussed in this book

Non-coherent MIMO Communication for the 5th Generation Mobile: Overview and Practical Aspects

Although there are many theoretical studies on the performance of non-coherent schemes in MIMO systems, their impact on real-world cellular systems is still unknown. This paper focuses on bringing noncoherent techniques into practical systems using CoMP and/or MIMO processing

MIMO-based Friendly Jamming and Interference Management Techniques for Secure Wireless Communications

The ever-increasing growth of wireless systems has made them an essential part of our daily life. People rely heavily on wireless networks for communications and to conduct critical transactions from their mobile devices, including financial transactions, access to health records, etc. The proliferation of wireless communication devices opens the door for many security breaches, ranging from eavesdropping to jamming attacks. Such a disadvantage stems from the broadcast nature of wireless transmissions, which creates an exposed environment. In this dissertation, we focus on eavesdropping attacks. While cryptographic techniques can be used to thwart eavesdropping attacks and enable secure wireless communications, they are not sufficient to protect the lower-layer headers of a packet (i.e., PHY and MAC headers). Hence, even though the secret message is encrypted, these unencrypted headers can be exploited by an adversary to extract invaluable information and initiate malicious attacks (e.g., traffic classification). Physical-layer (PHY-layer) security has been introduced as a promising candidate to prevent attacks that exploit unencrypted lower layer headers. PHY-layer security techniques typically rely on injecting an intentional interference into the medium so as to confuse nearby eavesdroppers (Eve). Specifically, a legitimate transmit-receive (Alice-Bob) pair generates a bogus signal, namely friendly jamming (FJ), along with the information signal, to increase interference at Eve(s) but without affecting the legitimate receiver (Bob). Depending on which end of a legitimate link is responsible for generating the FJ signal, two types of FJ techniques exist: transmitter-based (TxFJ) and receiver-based (RxFJ). In this dissertation, we propose to advance the state-of-art in PHY-layer security by considering multi-link scenarios, including multi-user multiple-input multiple-output (MU-MIMO) and peer-to-peer (P2P) networks. Specifically, we consider a scenario where one or more external Eve(s) attempt to snoop on communications of various links. In such networks, transmission of one link may be interfered with neighboring links' transmissions. Thus, special care must be dedicated to handling interference. In our first contribution in this dissertation, we consider a P2P network tapped by external Eve(s) in which each Alice-Bob pair conceals its communications using TxFJ. TxFJ is realized at Alice side using MIMO precoding. The goal is to design the precoders for both information and TxFJ signals at all Alices so as to maximize a given utility (e.g., sum of communication rates) while preventing eavesdropping elsewhere. Because legitimate links do not cooperate with each other and there is no centralized authority to perform optimization, every link selfishly aims at maximizing its secrecy rate. Using non-cooperative game theory, we design a distributed method for maximizing the sum of secrecy rates. Under the exact knowledge of eavesdropping channels, we show that our distributed method has a comparable secrecy sum-rate to a centralized approach. In our next contribution, we focus on employing practical precoders in our design for a P2P network. Specifically, we employed a zero-forcing-based (ZF-based) precoder for the TxFJ of each Alice-Bob pair in a P2P network. We also assume that each link has a certain rate demand to be satisfied. In such a scenario, even though the non-cooperative game designed for this P2P network is shown to be convergent to its unique Nash Equilibrium (NE), there is still no guarantee that the resulting NE is Pareto-optimal. Hence, we propose a modified price-based game, in which each link is penalized for generating interference on other legitimate links. We show that the price-based game converges to the Pareto-optimal point of secrecy rate region. We then leverage mixed-strategy games to provide solutions that are robust to uncertainties in knowledge of eavesdropping channels. The proposed ZF-based design of precoders is also implemented on software-defined radios to assess its performance on a single link in real-world scenarios. In another contribution of this dissertation, we consider to further enhance the secrecy of each link in a P2P network by equipping each receiver with RxFJ. Hence, in addition to the power allocation between TxFJ and information signals, we optimize RxFJ power as well. We show that by using RxFJ at each Bob, we could leverage the well-established concept of concave games, which compared to non-convex games enjoy more simplified game-theoretic analysis. We derive sufficient conditions under which the game admits a unique NE. We also propose another version of our power control algorithm that can be implemented asynchronously, making it robust to transmission delays in the network. In our last contribution, we consider the downlink of a MU-MIMO network in the presence of an external Eve. No knowledge of Eve's location is assumed at the access point. The network is studied in underloaded and overloaded conditions. In an underloaded (overloaded) network, the number of antennas at the access point is larger (smaller) than the total number of downlink users' antennas. In the overloaded setting, traditional methods of creating TxFJ, such as ZF-based methods, are infeasible. We propose a linear precoding scheme that relaxes such infeasibility in overloaded MU-MIMO networks. In the worst-case scenario where Eve has knowledge of the channels between access point and downlink users, we show that our method imposes the most stringent condition on the number of antennas required at Eve to cancel out TxFJ signals. We also show that choosing the number of independent streams to be sent to downlink users has an important role in achieving a tradeoff between security, reliability, and the achievable rate

Scaling up virtual MIMO systems

Multiple-input multiple-output (MIMO) systems are a mature technology that has been incorporated into current wireless broadband standards to improve the channel capacity and link reliability. Nevertheless, due to the continuous increasing demand for wireless data traffic new strategies are to be adopted. Very large MIMO antenna arrays represents a paradigm shift in terms of theory and implementation, where the use of tens or hundreds of antennas provides significant improvements in throughput and radiated energy efficiency compared to single antennas setups. Since design constraints limit the number of usable antennas, virtual systems can be seen as a promising technique due to their ability to mimic and exploit the gains of multi-antenna systems by means of wireless cooperation. Considering these arguments, in this work, energy efficient coding and network design for large virtual MIMO systems are presented. Firstly, a cooperative virtual MIMO (V-MIMO) system that uses a large multi-antenna transmitter and implements compress-and-forward (CF) relay cooperation is investigated. Since constructing a reliable codebook is the most computationally complex task performed by the relay nodes in CF cooperation, reduced complexity quantisation techniques are introduced. The analysis is focused on the block error probability (BLER) and the computational complexity for the uniform scalar quantiser (U-SQ) and the Lloyd-Max algorithm (LM-SQ). Numerical results show that the LM-SQ is simpler to design and can achieve a BLER performance comparable to the optimal vector quantiser. Furthermore, due to its low complexity, U-SQ could be consider particularly suitable for very large wireless systems. Even though very large MIMO systems enhance the spectral efficiency of wireless networks, this comes at the expense of linearly increasing the power consumption due to the use of multiple radio frequency chains to support the antennas. Thus, the energy efficiency and throughput of the cooperative V-MIMO system are analysed and the impact of the imperfect channel state information (CSI) on the system’s performance is studied. Finally, a power allocation algorithm is implemented to reduce the total power consumption. Simulation results show that wireless cooperation between users is more energy efficient than using a high modulation order transmission and that the larger the number of transmit antennas the lower the impact of the imperfect CSI on the system’s performance. Finally, the application of cooperative systems is extended to wireless self-backhauling heterogeneous networks, where the decode-and-forward (DF) protocol is employed to provide a cost-effective and reliable backhaul. The associated trade-offs for a heterogeneous network with inhomogeneous user distributions are investigated through the use of sleeping strategies. Three different policies for switching-off base stations are considered: random, load-based and greedy algorithms. The probability of coverage for the random and load-based sleeping policies is derived. Moreover, an energy efficient base station deployment and operation approach is presented. Numerical results show that the average number of base stations required to support the traffic load at peak-time can be reduced by using the greedy algorithm for base station deployment and that highly clustered networks exhibit a smaller average serving distance and thus, a better probability of coverage

Towards an enhanced noncoherent massive MU-MIMO system

PhD ThesisMany multiple-input multiple-output (MIMO) downlink transmission schemes assume channel state information (CSI) is available at the receiver/transmitter. In practice, knowledge of CSI is often obtained by using pilot symbols transmitted periodically. However, for some systems, due to high mobility and the cost of channel training and estimation, CSI acquisition is not always feasible. The problem becomes even more difficult when many antennas are used in the system and the channel is changing very rapidly before training is completed. Moreover, as the number of transmit/receive antennas grows large, the number of pilot symbols, system overheads, latency, and power consumption will grow proportionately and thereby the system becomes increasingly complex. As an alternative, a noncoherent system may be used wherein the transmitter/receiver does not need any knowledge of the CSI to perform precoding or detection. This thesis focuses on the design of a noncoherent downlink transmission system to jointly improve the performance and achieve a simple low complexity transmission scheme in three MIMO system scenarios: low rate differential spacetime block coding (STBC) in a downlink multiuser (MU-MIMO) system; high rate differential algebraic STBC in a downlink MU-MIMO system; and differential downlink transmission in a massive MU-MIMO system. Three novel design methods for each of these systems are proposed and analysed thoroughly. For the MIMO system with a low rate noncoherent scheme, a differential STBC MU-MIMO system with a downlink transmission scheme is considered. Specifically, downlink precoding combined with differential modulation (DM) is used to shift the complexity from the receivers to the transmitter. The block diagonalization (BD) precoding scheme is used to cancel co-channel interference (CCI) in addition to exploiting its advantage of enhancing diversity. Since the BD scheme requires channel knowledge at the transmitter, the downlink spreading technique along with DM is also proposed, which does not require channel knowledge neither at the transmitter nor at the receivers. The orthogonal spreading (OS) scheme is employed to have similar principle as code division multiple access (CDMA) multiplexing scheme in order to eliminate the interference between users. As a STBC scheme, the Alamouti code is used that can be encoded/decoded using DM thereby eliminating the need for channel knowledge at the receiver. The proposed schemes yield low complexity transceivers while providing good performance. For the MIMO system with a high rate noncoherent scheme, a differential STBC MU-MIMO system that operates at a high data rate is considered. In particular, a full-rate full-diversity downlink algebraic transmission scheme combined with a differential STBC systems is proposed. To achieve this, perfect algebraic space time codes and Cayley differential (CD) transforms are employed. Since CSI is not needed at the differential receiver, differential schemes are ideal for multiuser systems to shift the complexity from the receivers to the transmitter, thus simplifying user equipment. Furthermore, OS matrices are employed at the transmitter to separate the data streams of different users and enable simple single user decoding. In the OS scheme, the transmitter does not require any knowledge of the CSI to separate the data streams of multiple users; this results in a system which does not need CSI at either end. With this system, to limit the number of possible codewords, a sphere decoder (SD) is used to decode the signals at the receiving end. The proposed scheme yields low complexity transceivers while providing full-rate full-diversity system with good performance. Lastly, a differential downlink transmission scheme is proposed for a massive MIMO system without explicit channel estimation. In particular, a downlink precoding technique combined with a differential encoding scheme is used to simplify the overall system complexity. A novel precoder is designed which, with a large number of transmit antennas, can effectively precancel the multiple access interference (MAI) for each user, thus enhancing the system performance. Maximising the worst case signal-to-interference-plus-noise ratio (SINR) is adopted to optimise the precoder for the users in which full power space profile (PSP) knowledge is available to the base station (BS). Also, two suboptimal solutions based on the matched and the orthogonality approach of PSP are provided to separate the data streams of multiple users. The decision feedback differential detection (DFDD) technique is employed to further improve the performance. In summary, the proposed methods eliminate MAI, enhance system performance, and achieve a simple low complexity system. Moreover, transmission overheads are significantly reduced, the proposed methods avoid explicit channel estimation at both ends.King Fahad Security Collage at the Ministry of Interior - Saudi Arabia

Analysis of Gaussian Quadratic Forms with Application to Statistical Channel Modeling

Finalmente, en el contexto de modelado de canal, la metodología de análisis de variables propuesta permite obtener dos nuevas generalizaciones del conocido modelo de desvanecimiento kappa-mu shadowed. Estas dos nuevas distribuciones, nombradas Beckmann fluctuante y kappa-mu shadowed correlado, incluyen como casos particulares a la gran mayoría de distribuciones de desvanecimientos usadas en la literatura, abarcando desde los modelos clásicos de Rayleigh y Rice hasta otros más generales y complejos como el Beckmann y el kappa-mu. Para ambas distribuciones, se presenta su caracterización estadística de primer orden, i.e., función generadora de momentos (MGF), PDF y CDF; así como los estadísticos de segundo orden del modelo Beckmann fluctuante. Fecha de lectura de Tesis Doctoral: 24 Enero 2020En esta tesis se presenta una nueva aproximación a la distribución de de formas cuadráticas gaussianas (FCGs) no centrales tanto en variables reales como complejas. Para ello, se propone un nuevo método de análisis de variables aleatorias que, en lugar de centrarse en el estudio de la variable en cuestión, se basa en la caracterización estadística de una secuencia de variables aleatorias auxiliares convenientemente definida. Como consecuencia, las expresiones obtenidas, con independencia del grado de precisión adquirido, siempre representan una distribución válida, siendo ésta su principal ventaja. Aplicando este método, se obtienen simples expresiones recursivas para la función densidad de probabilidad (PDF) y la función de distribución (CDF) de las FCGs reales definidas positivas. En el caso de las formas complejas, esta nueva forma de análisis conduce a aproximaciones para los estadísticos de primer orden en términos de funciones elementales (exponenciales y potencias), siendo más convenientes para cálculos posteriores que otras soluciones disponibles en la literatura. La tratabilidad matemática se ejemplifica mediante el análisis de sistemas de combinación por razón máxima (MRC) sobre canales Rice correlados, proporcionando aproximaciones cerradas para la probabilidad de outage y la probabilidad de error de bit