Enabling Efficient, Robust, and Scalable Wireless Multi-Hop Networks: A Cross-Layer Approach Exploiting Cooperative Diversity

The practical performance in terms of throughput, robustness, and scalability of traditional Wireless Multihop Networks (WMNs) is limited. The key problem is that such networks do not allow for advanced physical layers, which typically require (a) spatial diversity via multiple antennas, (b) timely Channel State Information (CSI) feedback, and (c) a central instance that coordinates nodes. We propose Corridor-based Routing to address these issues. Our approach widens traditional hop-by-hop paths to span multiple nodes at each hop, and thus provide spatial diversity. As a result, at each hop, a group of transmitters cooperates at the physical layer to forward data to a group of receivers. We call two subsequent groups of nodes a stage. Since all nodes participating in data forwarding at a certain hop are part of the same fully connected stage, corridors only require one-hop CSI feedback. Further, each stage operates independently. Thus, Corridor-based Routing does not require a network-wide central instance, and is scalable. We design a protocol that builds end-to-end corridors. As expected, this incurs more overhead than finding a traditional WMN path. However, if the resulting corridor provides throughput gains, the overhead compensates after a certain number of transmitted packets. We adapt two physical layers to the aforementioned stage topology, namely, Orthogonal Frequency-Division Multiple Access (OFDMA), and Interference Alignment (IA). In OFDMA, we allocate each subchannel to a link of the current stage which provides good channel conditions. As a result, we avoid deep fades, which enables OFDMA to transmit data robustly in scenarios in which traditional schemes cannot operate. Moreover, it achieves higher throughputs than such schemes. To minimize the transmission time at each stage, we present an allocation mechanism that takes into account both the CSI, and the amount of data that each transmitter needs to transmit. Further, we address practical issues and implement our scheme on software-defined radios. We achieve roughly 30% average throughput gain compared to a WMN not using corridors. We analyze OFDMA in theory, simulation, and practice. Our results match in all three domains. Further, we design a physical layer for corridor stages based on IA in the frequency domain. Our practical experiments show that IA often performs poorly because the decoding process augments noise. We find that the augmentation factor depends only on the channel coefficients of the subchannels that IA uses. We design a mechanism to determine which transmitters should transmit to which receivers on which subchannels to minimize noise. Since the number of possible combinations is very large, we use heuristics that reduce the search space significantly. Based on this design, we present the first practical frequency IA system. Our results show that our approach avoids noise augmentation efficiently, and thus operates robustly. We observe that IA is most suitable for stages with specific CSI and traffic conditions. In such scenarios, the throughput gain compared to a WMN not using corridors is 25% on average, and 150% in the best case. Finally, we design a decision engine which estimates the performance of both OFDMA and IA for a given stage, and chooses the one which achieves the highest throughput. We evaluate corridors with up to five stages, and achieve roughly 20% average throughput gain. We conclude that switching among physical layers to adapt to the particular CSI and traffic conditions of each stage is crucial for efficient and robust operation

D 3. 3 Final performance results and consolidated view on the most promising multi -node/multi -antenna transmission technologies

This document provides the most recent updates on the technical contributions and research challenges focused in WP3. Each Technology Component (TeC) has been evaluated under possible uniform assessment framework of WP3 which is based on the simulation guidelines of WP6. The performance assessment is supported by the simulation results which are in their mature and stable state. An update on the Most Promising Technology Approaches (MPTAs) and their associated TeCs is the main focus of this document. Based on the input of all the TeCs in WP3, a consolidated view of WP3 on the role of multinode/multi-antenna transmission technologies in 5G systems has also been provided. This consolidated view is further supported in this document by the presentation of the impact of MPTAs on METIS scenarios and the addressed METIS goals.Aziz, D.; Baracca, P.; De Carvalho, E.; Fantini, R.; Rajatheva, N.; Popovski, P.; Sørensen, JH.... (2015). D 3. 3 Final performance results and consolidated view on the most promising multi -node/multi -antenna transmission technologies. http://hdl.handle.net/10251/7675

Heterogeneous Networks for the IoT and Machine Type Communications

The Internet of Things promises to be a key-factor in the forthcoming industrial and social revolution. The Internet of Things concept rely on pervasive communications where ’things’ are ’always connected’. The focus of the thesis is on Heterogeneous Networks for Internet of Things and Machine Type Communications. Heterogeneous Networks are an enabling factor of paramount important in order to achieve the ’always connected’ paradigm. On the other hand, Machine Type Communications are deeply different from Human-to-Human communications both in terms of traffic patterns and requirements. This thesis investigate both concepts. In particular, here are studied short and long range solutions for Machine-to-machine applications. For this work a dual approach has been followed: for the short-range solutions analysis an experimental approach has been privileged; meanwhile for the long-range solutions analysis a theoretical and simulation approach has been preferred. In both case, a particular attention has been given to the feasibility of the solutions proposed, hence solutions based on products that already exist in the market have been privileged

Radio Resource Management for Cellular Networks Enhanced by Inter-User Communication

The importance of radio resource management will be more and more emphasized in future wireless communication systems. For fair penetration of wireless services and for improved local services, inter-user communication has been receiving wide attention as it opens up various possibilities for user cooperation. The capability of inter-user communication imposes higher demands on radio resource management as additional considerations are needed. The demands for intelligent management of radio resources is also emphasized by the sparsity of radio resources. As the available spectral resources are assessed as under-utilized, much effort is devoted to developing advanced resource management methods for improving the spectral usage efficiency. The research of this thesis has contributed to the radio resource management for cellular networks enhanced by inter-user communication. Recognizing that inter-user communication can be used for message relaying or for direct communication purposes, two use cases are considered that leverage the synergy of users: cooperative relay selection and Device-to-Device (D2D) communication. We identify the importance of stochastic geometry consideration on cellular users for evaluating system performance in cooperative networking. We develop an algorithm for efficiently selecting cooperative users to maximize an End-to-End (e2e) performance metric. We analyze the optimal resource sharing problem between D2D communication and infrastructure-supported communication. We study the impact of imperfect Channel State Information (CSI) on the performance of systems with inter-user communication. Simulation results show that the performance of users with unfavorable propagation conditions can be improved with cooperative communication in a multi-cell cellular environment, at the expense of radio resources. Further, our results show that the selection of multiple cooperative users is beneficial in cases where the candidate cooperative users are spatially distributed. For resource sharing between the D2D and infrastructure-supported communication, our results show that the proposed resource sharing scheme enables higher intra-cell resource reuse without blocking the infrastructure-supported communication

D3.2 First performance results for multi -node/multi -antenna transmission technologies

This deliverable describes the current results of the multi-node/multi-antenna technologies investigated within METIS and analyses the interactions within and outside Work Package 3. Furthermore, it identifies the most promising technologies based on the current state of obtained results. This document provides a brief overview of the results in its first part. The second part, namely the Appendix, further details the results, describes the simulation alignment efforts conducted in the Work Package and the interaction of the Test Cases. The results described here show that the investigations conducted in Work Package 3 are maturing resulting in valuable innovative solutions for future 5G systems.Fantini. R.; Santos, A.; De Carvalho, E.; Rajatheva, N.; Popovski, P.; Baracca, P.; Aziz, D.... (2014). D3.2 First performance results for multi -node/multi -antenna transmission technologies. http://hdl.handle.net/10251/7675

Busy burst technology applied to OFDMA–TDD systems

The most significant bottleneck in wireless communication systems is an ever-increasing disproportion between the bandwidth demand and the available spectrum. A major challenge in the field of wireless communications is to maximise the spatial reuse of resources whilst avoiding detrimental co-channel interference (CCI). To this end, frequency planning and centralised coordination approaches are widely used in wireless networks. However, the networks for the next generation of wireless communications are often envisioned to be decentralised, randomly distributed in space, hierarchical and support heterogeneous traffic and service types. Fixed frequency allocation would not cater for the heterogeneous demands and centralised resource allocation would be cumbersome and require a lot of signalling. Decentralised radio resource allocation based on locally available information is considered the key. In this context, the busy burst (BB) signalling concept is identified as a potential mechanism for decentralised interference management in future generation networks. Interference aware allocation of time-frequency slots (chunks) is accomplished by letting receivers transmit a BB in a time-multiplexed mini-slot, upon successful reception of data. Exploiting channel reciprocity of the time division duplex (TDD) mode, the transmitters avoid reusing the chunks where the received BB power is above a pre-determined threshold so as to limit the CCI caused towards the reserved chunks to a threshold value. In this thesis, the performance of BB signalling mechanism in orthogonal frequency division multiple access - time division duplexing (OFDMA-TDD) systems is evaluated by means of system level simulations in networks operating in ad hoc and cellular scenarios. Comparisons are made against the state-of-the-art centralised CCI avoidance and mitigation methods, viz. frequency planning, fractional frequency reuse, and antenna array with switched grid of beams, as well as decentralised methods such as the carrier sense multiple access method that attempt to avoid CCI by avoiding transmission on chunks deemed busy. The results demonstrate that with an appropriate choice of threshold parameter, BB-based techniques outperform all of the above state-of-the-art methods. Moreover, it is demonstrated that by adjusting the BB-specific threshold parameter, the system throughput can be traded off for improving throughput for links with worse channel condition, both in the ad hoc and cellular scenario. Moreover, by utilising a variable BB power that allows a receiver to signal the maximum CCI it can tolerate, it is shown that a more favourable trade-off between total system throughput and link throughput can be made. Furthermore, by performing link adaptation, it is demonstrated that the spatial reuse and the energy efficiency can be traded off by adjusting the threshold parameter. Although the BB signalling mechanism is shown to be effective in avoiding detrimental CCI, it cannot mitigate CCI by itself. On the other hand, multiple antenna techniques such as adaptive beamforming or switched beam approaches allow CCI to be mitigated but suffer from hidden node problems. The final contribution of this thesis is that by combining the BB signalling mechanism with multiple antenna techniques, it is demonstrated that the hybrid approach enhances spatial reusability of resources whilst avoiding detrimental CCI. In summary, this thesis has demonstrated that BB provides a flexible radio resource mechanism that is suitable for future generation networks

Collaborative Broadcast in O(log log n) Rounds

We consider the multihop broadcasting problem for $n$ nodes placed uniformly at random in a disk and investigate the number of hops required to transmit a signal from the central node to all other nodes under three communication models: Unit-Disk-Graph (UDG), Signal-to-Noise-Ratio (SNR), and the wave superposition model of multiple input/multiple output (MIMO). In the MIMO model, informed nodes cooperate to produce a stronger superposed signal. We do not consider the problem of transmitting a full message nor do we consider interference. In each round, the informed senders try to deliver to other nodes the required signal strength such that the received signal can be distinguished from the noise. We assume sufficiently high node density $\rho= \Omega(\log n)$. In the unit-disk graph model, broadcasting needs $O(\sqrt{n/\rho})$ rounds. In the other models, we use an Expanding Disk Broadcasting Algorithm, where in a round only triggered nodes within a certain distance from the initiator node contribute to the broadcasting operation. This algorithm achieves a broadcast in only $O(\frac{\log n}{\log \rho})$ rounds in the SNR-model. Adapted to the MIMO model, it broadcasts within $O(\log \log n - \log \log \rho)$ rounds. All bounds are asymptotically tight and hold with high probability, i.e. $1- n^{-O(1)}$.Comment: extended abstract accepted for ALGOSENSORS 201

Advances in Multi-User Scheduling and Turbo Equalization for Wireless MIMO Systems

Nach einer Einleitung behandelt Teil 2 Mehrbenutzer-Scheduling für die Abwärtsstrecke von drahtlosen MIMO Systemen mit einer Sendestation und kanaladaptivem precoding: In jeder Zeit- oder Frequenzressource kann eine andere Nutzergruppe gleichzeitig bedient werden, räumlich getrennt durch unterschiedliche Antennengewichte. Nutzer mit korrelierten Kanälen sollten nicht gleichzeitig bedient werden, da dies die räumliche Trennbarkeit erschwert. Die Summenrate einer Nutzermenge hängt von den Antennengewichten ab, die wiederum von der Nutzerauswahl abhängen. Zur Entkopplung des Problems schlägt diese Arbeit Metriken vor basierend auf einer geschätzten Rate mit ZF precoding. Diese lässt sich mit Hilfe von wiederholten orthogonalen Projektionen abschätzen, wodurch die Berechnung von Antennengewichten beim Scheduling entfällt. Die Ratenschätzung kann basierend auf momentanen Kanalmessungen oder auf gemittelter Kanalkenntnis berechnet werden und es können Datenraten- und Fairness-Kriterien berücksichtig werden. Effiziente Suchalgorithmen werden vorgestellt, die die gesamte Systembandbreite auf einmal bearbeiten können und zur Komplexitätsreduktion die Lösung in Zeit- und Frequenz nachführen können. Teil 3 zeigt wie mehrere Sendestationen koordiniertes Scheduling und kooperative Signalverarbeitung einsetzen können. Mittels orthogonalen Projektionen ist es möglich, Inter-Site Interferenz zu schätzen, ohne Antennengewichte berechnen zu müssen. Durch ein Konzept virtueller Nutzer kann der obige Scheduling-Ansatz auf mehrere Sendestationen und sogar Relays mit SDMA erweitert werden. Auf den benötigten Signalisierungsaufwand wird kurz eingegangen und eine Methode zur Schätzung der Summenrate eines Systems ohne Koordination besprochen. Teil4 entwickelt Optimierungen für Turbo Entzerrer. Diese Nutzen Signalkorrelation als Quelle von Redundanz. Trotzdem kann eine Kombination mit MIMO precoding sinnvoll sein, da bei Annahme realistischer Fehler in der Kanalkenntnis am Sender keine optimale Interferenzunterdrückung möglich ist. Mit Hilfe von EXIT Charts wird eine neuartige Methode zur adaptiven Nutzung von a-priori-Information zwischen Iterationen entwickelt, die die Konvergenz verbessert. Dabei wird gezeigt, wie man semi-blinde Kanalschätzung im EXIT chart berücksichtigen kann. In Computersimulationen werden alle Verfahren basierend auf 4G-Systemparametern überprüft.After an introduction, part 2 of this thesis deals with downlink multi-user scheduling for wireless MIMO systems with one transmitting station performing channel adaptive precoding:Different user subsets can be served in each time or frequency resource by separating them in space with different antenna weight vectors. Users with correlated channel matrices should not be served jointly since correlation impairs the spatial separability.The resulting sum rate for each user subset depends on the precoding weights, which in turn depend on the user subset. This thesis manages to decouple this problem by proposing a scheduling metric based on the rate with ZF precoding such as BD, written with the help of orthogonal projection matrices. It allows estimating rates without computing any antenna weights by using a repeated projection approximation.This rate estimate allows considering user rate requirements and fairness criteria and can work with either instantaneous or long term averaged channel knowledge.Search algorithms are presented to efficiently solve user grouping or selection problems jointly for the entire system bandwidth while being able to track the solution in time and frequency for complexity reduction. Part 3 shows how multiple transmitting stations can benefit from cooperative scheduling or joint signal processing. An orthogonal projection based estimate of the inter-site interference power, again without computing any antenna weights, and a virtual user concept extends the scheduling approach to cooperative base stations and finally included SDMA half-duplex relays in the scheduling.Signalling overhead is discussed and a method to estimate the sum rate without coordination. Part 4 presents optimizations for Turbo Equalizers. There, correlation between user signals can be exploited as a source of redundancy. Nevertheless a combination with transmit precoding which aims at reducing correlation can be beneficial when the channel knowledge at the transmitter contains a realistic error, leading to increased correlation. A novel method for adaptive re-use of a-priori information between is developed to increase convergence by tracking the iterations online with EXIT charts.A method is proposed to model semi-blind channel estimation updates in an EXIT chart. Computer simulations with 4G system parameters illustrate the methods using realistic channel models.Im Buchhandel erhältlich: Advances in Multi-User Scheduling and Turbo Equalization for Wireless MIMO Systems / Fuchs-Lautensack,Martin Ilmenau: ISLE, 2009,116 S. ISBN 978-3-938843-43-