Related papers: Asymptotic and Finite Frame Length Analysis of Fra…
Slotted Aloha-based Random Access (RA) techniques have recently regained attention in light of the use of Interference Cancellation (IC) as a mean to exploit diversity created through the transmission of multiple burst copies per packet…
In this paper, we introduce Multi-Slots Coded ALOHA (MuSCA) as a multiple random access method for satellite communications. This scheme can be considered as a generalization of the Contention Resolution Diversity Slotted Aloha (CRDSA)…
We study medium access in FMCW radar networks. We assume that all the radars use same parameters, e.g., chirp duration, chirp slope, cutoff frequency, number of chirps per packet, etc, and propose and analyze slotted ALOHA and CSMA…
We consider a random access network consisting of source-destination pairs. Each source node generates status updates and transmits this information to its intended destination over a shared spectrum. The goal is to minimize the…
In this paper, a random access scheme is introduced which relies on the combination of packet erasure correcting codes and successive interference cancellation (SIC). The scheme is named coded slotted ALOHA. A bipartite graph representation…
A finite length analysis is introduced for irregular repetition slotted ALOHA (IRSA) that enables to accurately estimate its performance in the moderate-to-high packet loss probability regime, i.e., in the so-called waterfall region. The…
Herein, we consider the problem of cooperative multi-access in the presence of overlapped coverage areas. Assuming a frameless ALOHA transmission scheme, we derive exact analytical throughput expressions for throughput in the aforementioned…
The efficiency of tag identification in an RFID system can be low down due to the tag collision problems. the tag collision problem occurs when a reader try to read multiple tags in an interrogation zone. as a result the reader does not…
In this paper, we review the key figures of merit to assess the performance of advanced random access (RA) schemes exploiting physical layer coding, repetitions and collision resolution techniques. We then investigate RA modeling aspects…
Slotted ALOHA (SA) algorithms with Successive Interference Cancellation (SIC) decoding have received significant attention lately due to their ability to dramatically increase the throughput of traditional SA. Motivated by increased density…
The thesis is dedicated to studying methods to improve the efficiency of random access schemes and to facilitate their deployment in machine-type communications (MTC). First, a joint user activity identification and channel estimation…
Grant Free Random Access (GFRA) is a popular protocol in the Internet of Things (IoT) to reduce the control signaling. GFRA is a framed protocol where each frame is split into two parts: device identification; and data transmission part…
We propose a novel distributed random access scheme for wireless networks based on slotted ALOHA, motivated by the analogies between successive interference cancellation and iterative belief-propagation decoding on erasure channels. The…
Information aging has gained prominence in characterizing communication protocols for timely remote estimation and control applications. This work proposes an Age of Information (AoI)-aware threshold-based dynamic frame slotted ALOHA…
Multiple connected devices sharing common wireless resources might create interference if they access the channel simultaneously. Medium access control (MAC) protocols gener- ally regulate the access of the devices to the shared channel to…
This paper introduces a random multiple access method for satellite communications, named Network Coding-based Slotted Aloha (NCSA). The goal is to improve diversity of data bursts on a slotted-ALOHA-like channel thanks to error correcting…
Machine-type communication services in mobile cel- lular systems are currently evolving with an aim to efficiently address a massive-scale user access to the system. One of the key problems in this respect is to efficiently identify active…
A deterministic finite-state automaton (FSA) is an abstract sequential machine that reads the symbols comprising an input word one at a time. An FSA is symmetric if its output is independent of the order in which the input symbols are read,…
This paper investigates the Age of Information (AoI) performance of Frame Slotted ALOHA with Reservation and Data slots (FSA-RD). We consider a symmetric multi-access network where each user transmits its randomly generated status updates…
We analyze the performance of enhanced spread spectrum Aloha (E-SSA) in the framework of unsourced multiple access (UMAC). The asynchronous, unframed transmission of E-SSA is modified to enable a direct comparison with framed UMAC schemes…