Modern Random Access for Satellite Communications

The present PhD dissertation focuses on modern random access (RA) techniques. In the first part an slot- and frame-asynchronous RA scheme adopting replicas, successive interference cancellation and combining techniques is presented and its performance analysed. The comparison of both slot-synchronous and asynchronous RA at higher layer, follows. Next, the optimization procedure, for slot-synchronous RA with irregular repetitions, is extended to the Rayleigh block fading channel. Finally, random access with multiple receivers is considered.Comment: PhD Thesis, 196 page

On the Support of Massive Machine-to-Machine Traffic in Heterogeneous Networks and Fifth-Generation Cellular Networks

The widespread availability of many emerging services enabled by the Internet of Things (IoT) paradigm passes through the capability to provide long-range connectivity to a massive number of things, overcoming the well-known issues of ad-hoc, short-range networks. This scenario entails a lot of challenges, ranging from the concerns about the radio access network efficiency to the threats about the security of IoT networks. In this thesis, we will focus on wireless communication standards for long-range IoT as well as on fundamental research outcomes about IoT networks. After investigating how Machine-Type Communication (MTC) is supported nowadays, we will provide innovative solutions that i) satisfy the requirements in terms of scalability and latency, ii) employ a combination of licensed and license-free frequency bands, and iii) assure energy-efficiency and security

Self-organizing TDMA: a distributed contention-resolution MAC protocol

This paper presents a self-organizing time division multiple access (SO-TDMA) protocol for contention resolution aiming to support delay-sensitive applications. The proposed SOTDMA follows a cognition cycle where each node independently observes the operation environment, learns about the network traffic load, and then makes decisions to adapt the protocol for smart coexistence. Channel access operation in SO-TDMA is similar to carrier-sense multiple-access (CSMA) in the beginning, but then quickly converges to TDMA with an adaptive pseudo-frame structure. This approach has the benefits of TDMA in a highload traffic condition, and overcomes its disadvantages in lowload, heterogeneous traffic scenarios. Furthermore, it supports distributed and asynchronous channel-access operation. These are achieved by adapting the transmission-opportunity duration to the common idle/busy channel state information acquired by each node, without any explicit message passing among nodes. The process of adjusting the transmission duration is modeled as a congestion control problem to develop an additive-increasemultiplicative-decrease (AIMD) algorithm, which monotonically converges to fairness. Furthermore, the initial access phase of SO-TDMA is modeled as a Markov chain with one absorbing state and its required convergence time is studied accordingly. Performance of SO-TDMA in terms of effective capacity, system throughput, collision probability, delay-outage probability and fairness is investigated. Simulation results illustrate its effectiveness in performance improvement, approaching the ideal case that needs complete and precise information about the queue length and the channel conditions of all nodes

Multiple Access for Massive Machine Type Communications

The internet we have known thus far has been an internet of people, as it has connected people with one another. However, these connections are forecasted to occupy only a minuscule of future communications. The internet of tomorrow is indeed: the internet of things. The Internet of Things (IoT) promises to improve all aspects of life by connecting everything to everything. An enormous amount of effort is being exerted to turn these visions into a reality. Sensors and actuators will communicate and operate in an automated fashion with no or minimal human intervention. In the current literature, these sensors and actuators are referred to as machines, and the communication amongst these machines is referred to as Machine to Machine (M2M) communication or Machine-Type Communication (MTC). As IoT requires a seamless mode of communication that is available anywhere and anytime, wireless communications will be one of the key enabling technologies for IoT. In existing wireless cellular networks, users with data to transmit first need to request channel access. All access requests are processed by a central unit that in return either grants or denies the access request. Once granted access, users' data transmissions are non-overlapping and interference free. However, as the number of IoT devices is forecasted to be in the order of hundreds of millions, if not billions, in the near future, the access channels of existing cellular networks are predicted to suffer from severe congestion and, thus, incur unpredictable latencies in the system. On the other hand, in random access, users with data to transmit will access the channel in an uncoordinated and probabilistic fashion, thus, requiring little or no signalling overhead. However, this reduction in overhead is at the expense of reliability and efficiency due to the interference caused by contending users. In most existing random access schemes, packets are lost when they experience interference from other packets transmitted over the same resources. Moreover, most existing random access schemes are best-effort schemes with almost no Quality of Service (QoS) guarantees. In this thesis, we investigate the performance of different random access schemes in different settings to resolve the problem of the massive access of IoT devices with diverse QoS guarantees. First, we take a step towards re-designing existing random access protocols such that they are more practical and more efficient. For many years, researchers have adopted the collision channel model in random access schemes: a collision is the event of two or more users transmitting over the same time-frequency resources. In the event of a collision, all the involved data is lost, and users need to retransmit their information. However, in practice, data can be recovered even in the presence of interference provided that the power of the signal is sufficiently larger than the power of the noise and the power of the interference. Based on this, we re-define the event of collision as the event of the interference power exceeding a pre-determined threshold. We propose a new analytical framework to compute the probability of packet recovery failure inspired by error control codes on graph. We optimize the random access parameters based on evolution strategies. Our results show a significant improvement in performance in terms of reliability and efficiency. Next, we focus on supporting the heterogeneous IoT applications and accommodating their diverse latency and reliability requirements in a unified access scheme. We propose a multi-stage approach where each group of applications transmits in different stages with different probabilities. We propose a new analytical framework to compute the probability of packet recovery failure for each group in each stage. We also optimize the random access parameters using evolution strategies. Our results show that our proposed scheme can outperform coordinated access schemes of existing cellular networks when the number of users is very large. Finally, we investigate random non-orthogonal multiple access schemes that are known to achieve a higher spectrum efficiency and are known to support higher loads. In our proposed scheme, user detection and channel estimation are carried out via pilot sequences that are transmitted simultaneously with the user's data. Here, a collision event is defined as the event of two or more users selecting the same pilot sequence. All collisions are regarded as interference to the remaining users. We first study the distribution of the interference power and derive its expression. Then, we use this expression to derive simple yet accurate analytical bounds on the throughput and outage probability of the proposed scheme. We consider both joint decoding as well as successive interference cancellation. We show that the proposed scheme is especially useful in the case of short packet transmission

Novel Network Paradigms: Microfluidic and M2M Communications

The present thesis focuses on two appealing paradigms that are expected to characterize the next generation of communication systems: microfluidic networking and Machine to Machine (M2M) Communications. Concerning the former topic, we show how it is possible to introduce switching and routing mechanism in microfluidic systems. We define some simple mathematical models that capture the macroscopic behavior of droplets in microfluidic networks. Then, we use them to implement a simulator that is able to reproduce the motion and predict the path of droplets in a generic microfluidic system. We validate the simulator and apply it to design a network with bus topology. Finally, we prove the feasibility of attaining molecular communication in this domain by describing a simple protocol that exploits droplets length/interdistance modulation to send information. The research activity on M2M, instead, is aimed at the investigation of two critical issues that are expected to affect Machine-Type Communication (MTC), i.e. energy efficiency and massive access. Regarding energy efficiency, we address the problem of delivering a fixed data payload over a Rayleigh fading wireless channel with the purpose of minimizing the average total energy cost, given by the sum of the transmit energy and an overhead circuit energy, to complete it. This scenario is well suited for uplink cellular MTC in future 5G Internet of Things (IoT) use cases, where the focus is more on device energy efficiency than on throughput. We describe the optimal transmission policies to be used under various coordinated access scenarios with different levels of channel state information and transmitter/receiver capabilities, and show the corresponding theoretical bounds. In the last part of the work, we study the asymptotic performance of uncoordinated access schemes with Multi Packet Reception (MPR) and Successive Interference Cancellation (SIC) techniques for contention resolution at the receiver. The corresponding results in terms of throughput in a massive access M2M scenario are finally evaluated and discussed