Related papers: High Throughput Random Access via Codes on Graphs:…
We consider framed slotted Aloha where $m$ base stations cooperate to decode messages from $n$ users. Users and base stations are placed uniformly at random over an area. At each frame, each user sends multiple replicas of its packet…
We evaluate a modification of irregular repetition slotted ALOHA (IRSA) involving intermediate decoding and early transmission termination by some nodes, upon their decoding success. This is meant to avoid unnecessary transmissions, thereby…
Leveraging recent progress in physical-layer network coding we propose a new approach to random access: When packets collide, it is possible to recover a linear combination of the packets at the receiver. Over many rounds of transmission,…
An information-theoretic approach to irregular repetition slotted ALOHA (IRSA) is proposed. In contrast with previous works, in which IRSA analysis is conducted only based on quantities that are typical of collision models such as the…
Irregular repetition slotted aloha (IRSA) is a grant-free random access protocol for massive machine-type communications, where a large number of users sporadically send their data packets to a base station (BS). IRSA is a completely…
Sparse Code Multiple Access (SCMA) is a disruptive code-domain non-orthogonal multiple access (NOMA) scheme to enable \color{black}future massive machine-type communication networks. As an evolved variant of code division multiple access…
We consider a frame-asynchronous coded slotted ALOHA (FA-CSA) system where users become active according to a Poisson random process. In contrast to standard frame-synchronous CSA (FS-CSA), users transmit a first replica of their message in…
In this paper a Time Division Multiple Access (TDMA) based Random Access (RA) channel with Successive Interference Cancellation (SIC) is considered for a finite user population and reliable retransmission mechanism on the basis of…
Random Access MAC protocols are simple and effective when the nature of the traffic is unpredictable and sporadic. In the following paper, investigations on the new Enhanced Contention Resolution ALOHA (ECRA) are presented, where some new…
In this letter, we develop a converse bound on the asymptotic load threshold of coded slotted ALOHA (CSA) schemes with K-multi packet reception capabilities at the receiver. Density evolution is used to track the average probability of…
In this letter we motivate the need to revisit the MAC protocol used in Gen2 RFID system in order to leverage receiver structures with Collision Recovery capabilities at the PHY layer. To this end we propose to consider a simple variant of…
We present a framework for the analysis of the error floor of coded slotted ALOHA (CSA) for finite frame lengths over the packet erasure channel. The error floor is caused by stopping sets in the corresponding bipartite graph, whose…
Motivated by the proliferation of real-time applications in multimedia communication systems, tactile Internet, and cyber-physical systems, supporting delay-constrained traffic becomes critical for such systems. In delay-constrained…
This article introduces a novel framework of multi-user detection (MUD) for K-repetition grant-free non-orthogonal multiple access (K-GF-NOMA), called $\alpha$ iterative interference cancellation diversity slotted aloha ($\alpha$-IIC-DSA).…
In this paper, an improved ALOHA-based unsourced random access (URA) scheme is proposed in MIMO channels. The channel coherent interval is divided into multiple sub-slots and each active user selects several sub-slots to send its codeword,…
Access reservation based on slotted ALOHA is commonly used in wireless cellular access. In this paper we investigate its enhancement based on the use of physical-layer network coding and signature coding, whose main feature is enabling…
To efficiently utilize the scarce wireless resource, the random access scheme has been attaining renewed interest primarily in supporting the sporadic traffic of a large number of devices encountered in the Internet of Things (IoT). In this…
This paper investigates the unsourced random access (URA) scheme to accommodate numerous machine-type users communicating to a base station equipped with multiple antennas. Existing works adopt a slotted transmission strategy to reduce…
In this paper, we develop a probabilistic framework for analyzing coded random access. Our framework is based on a new abstract receiver (decoder), called a Poisson receiver, that is characterized by a success probability function of a…
In this paper, we discuss the potential for improvement of the simple random access scheme by utilizing local information such as the received signal-to-interference-plus-noise-ratio (SINR). We propose a spatially adaptive random access…