5G wireless systems: principles, IoT connectivity, and slicing of radio resources

In the conference, the landscape of future wireless connectivity is first described. Later, a glimpse into the new radio and standardization is given. New modes in 5G are treated in deep, emphasizing those related to Ultra-­Reliable Low Latency Communication and massive Machine Type Communication (mMTC). Finally, an overview is given on slicing and modeling of 5G systems.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

Ultra-Reliable Communication in 5G Wireless Systems

Wireless 5G systems will not only be "4G, but faster". One of the novel features discussed in relation to 5G is Ultra-Reliable Communication (URC), an operation mode not present in today's wireless systems. URC refers to provision of certain level of communication service almost 100 % of the time. Example URC applications include reliable cloud connectivity, critical connections for industrial automation and reliable wireless coordination among vehicles. This paper puts forward a systematic view on URC in 5G wireless systems. It starts by analyzing the fundamental mechanisms that constitute a wireless connection and concludes that one of the key steps towards enabling URC is revision of the methods for encoding control information (metadata) and data. It introduces the key concept of Reliable Service Composition, where a service is designed to adapt its requirements to the level of reliability that can be attained. The problem of URC is analyzed across two different dimensions. The first dimension is the type of URC problem that is defined based on the time frame used to measure the reliability of the packet transmission. Two types of URC problems are identified: long-term URC (URC-L) and short-term URC (URC-S). The second dimension is represented by the type of reliability impairment that can affect the communication reliability in a given scenario. The main objective of this paper is to create the context for defining and solving the new engineering problems posed by URC in 5G.Comment: To be presented at the 1st International Conference on 5G for Ubiquitous Connectivit

ALOHA Random Access that Operates as a Rateless Code

Various applications of wireless Machine-to-Machine (M2M) communications have rekindled the research interest in random access protocols, suitable to support a large number of connected devices. Slotted ALOHA and its derivatives represent a simple solution for distributed random access in wireless networks. Recently, a framed version of slotted ALOHA gained renewed interest due to the incorporation of successive interference cancellation (SIC) in the scheme, which resulted in substantially higher throughputs. Based on similar principles and inspired by the rateless coding paradigm, a frameless approach for distributed random access in slotted ALOHA framework is described in this paper. The proposed approach shares an operational analogy with rateless coding, expressed both through the user access strategy and the adaptive length of the contention period, with the objective to end the contention when the instantaneous throughput is maximized. The paper presents the related analysis, providing heuristic criteria for terminating the contention period and showing that very high throughputs can be achieved, even for a low number for contending users. The demonstrated results potentially have more direct practical implications compared to the approaches for coded random access that lead to high throughputs only asymptotically.Comment: Revised version submitted to IEEE Transactions on Communication

Zero-Error Capacity of a Class of Timing Channels

We analyze the problem of zero-error communication through timing channels that can be interpreted as discrete-time queues with bounded waiting times. The channel model includes the following assumptions: 1) Time is slotted, 2) at most $N$ "particles" are sent in each time slot, 3) every particle is delayed in the channel for a number of slots chosen randomly from the set $\{0, 1, \ldots, K\}$, and 4) the particles are identical. It is shown that the zero-error capacity of this channel is $\log r$, where $r$ is the unique positive real root of the polynomial $x^{K+1} - x^{K} - N$. Capacity-achieving codes are explicitly constructed, and a linear-time decoding algorithm for these codes devised. In the particular case $N = 1$, $K = 1$, the capacity is equal to $\log \phi$, where $\phi = (1 + \sqrt{5}) / 2$ is the golden ratio, and the constructed codes give another interpretation of the Fibonacci sequence.Comment: 5 pages (double-column), 3 figures. v3: Section IV.1 from v2 is replaced with Remark 1, and Section IV.2 is removed. Accepted for publication in IEEE Transactions on Information Theor

Coded Slotted ALOHA with Varying Packet Loss Rate across Users

The recent research has established an analogy between successive interference cancellation in slotted ALOHA framework and iterative belief-propagation erasure-decoding, which has opened the possibility to enhance random access protocols by utilizing theory and tools of erasure-correcting codes. In this paper we present a generalization of the and-or tree evaluation, adapted for the asymptotic analysis of the slotted ALOHA-based random-access protocols, for the case when the contending users experience different channel conditions, resulting in packet loss probability that varies across users. We apply the analysis to the example of frameless ALOHA, where users contend on a slot basis. We present results regarding the optimal access probabilities and contention period lengths, such that the throughput and probability of user resolution are maximized.Comment: 4 pages, submitted to GlobalSIP 201

Network-Assisted Device-to-Device (D2D) Direct Proximity Discovery with Underlay Communication

Device-to-Device communications are expected to play an important role in current and future cellular generations, by increasing the spatial reuse of spectrum resources and enabling lower latency communication links. This paradigm has two fundamental building blocks: (i) proximity discovery and (ii) direct communication between proximate devices. While (ii) is treated extensively in the recent literature, (i) has received relatively little attention. In this paper we analyze a network-assisted underlay proximity discovery protocol, where a cellular device can take the role of: announcer (which announces its interest in establishing a D2D connection) or monitor (which listens for the transmissions from the announcers). Traditionally, the announcers transmit their messages over dedicated channel resources. In contrast, inspired by recent advances on receivers with multiuser decoding capabilities, we consider the case where the announcers underlay their messages in the downlink transmissions that are directed towards the monitoring devices. We propose a power control scheme applied to the downlink transmission, which copes with the underlay transmission via additional power expenditure, while guaranteeing both reliable downlink transmissions and underlay proximity discovery.Comment: Accepted for presentation at Globecom 201