English
Related papers

Related papers: Irregular Repetition Slotted Aloha with Multipacke…

200 papers

We model a dense wireless local area network where the access points (APs) employ carrier sense multiple access (CSMA)-type medium access control protocol. In our model, the spatial locations of the set of active APs are modeled using the…

Information Theory · Computer Science 2022-09-05 Priyabrata Parida , Harpreet S. Dhillon

In random sequential adsorption (RSA), objects are deposited randomly, irreversibly, and sequentially; attempts leading to an overlap with previously deposited objects are discarded. The process continues until the system reaches a jammed…

Statistical Mechanics · Physics 2020-12-04 P. L. Krapivsky

We propose an uncoordinated medium access control (MAC) protocol, called all-to-all broadcast coded slotted ALOHA (B-CSA) for reliable all-to-all broadcast with strict latency constraints. In B-CSA, each user acts as both transmitter and…

Information Theory · Computer Science 2016-05-26 Mikhail Ivanov , Fredrik Brannstrom , Alexandre Graell i Amat , Petar Popovski

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…

Information Theory · Computer Science 2019-06-11 Zhuo Sun

This paper considers an unsourced random access (URA) set-up equipped with a passive reconfigurable intelligent surface (RIS), where a massive number of unidentified users (only a small fraction of them being active at any given time) are…

Information Theory · Computer Science 2024-08-27 Mohammad Javad Ahmadi , Mohammad Kazemi , Tolga M. Duman

Rateless Multiple Access (RMA) is a novel non-orthogonal multiple access framework that is promising for massive access in Internet of Things (IoT) due to its high efficiency and low complexity. In the framework, after certain…

Information Theory · Computer Science 2016-11-17 Zhaoyang Zhang , Xianbin Wang , Yu Zhang , Yan Chen

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,…

Information Theory · Computer Science 2025-05-06 Linjie Yang , Pingzhi Fan , Zhiguo Ding , Jingqiu Gao

This paper introduces a new source coding paradigm called Sequential Massive Random Access (SMRA). In SMRA, a set of correlated sources is encoded once for all and stored on a server, and clients want to successively access to only a subset…

Information Theory · Computer Science 2017-08-31 Elsa Dupraz , Thomas Maugey , Aline Roumy , Michel Kieffer

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…

Information Theory · Computer Science 2022-06-03 Qian Wang , He Chen

In this paper, a novel uncoordinated random access (URA) protocol is presented to address the pressing demand for massive connectivity with low access latency in future massive machine type communication (mMTC) scenarios. The proposed URA…

Signal Processing · Electrical Eng. & Systems 2025-10-28 Pengyu Gao , Qu Luo , Jing Zhu , Gaojie Chen , Pei Xiao , Chuan Heng Foh

In this paper, we develop a hybrid multiple access (MA) protocol for an intelligent reflecting surface (IRS) aided uplink transmission network by incorporating the IRS-aided time-division MA (I-TDMA) protocol and the IRS-aided…

Information Theory · Computer Science 2023-06-27 Piao Zeng , Guangji Chen , Qingqing Wu , Deli Qiao , Abbas Jamalipour

A well-known inner bound on the stability region of the finite-user slotted Aloha protocol is the set of all arrival rates for which there exists some choice of the contention probabilities such that the associated worst-case service rate…

Information Theory · Computer Science 2017-01-06 Nan Xie , John MacLaren Walsh , Steven Weber

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…

Information Theory · Computer Science 2017-07-03 Federico Clazzer

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…

Information Theory · Computer Science 2015-05-05 Dong Min Kim , Seong-Lyun Kim

We study the interference and outage statistics in a slotted Aloha ad hoc network, where the spatial distribution of nodes is non-stationary and isotropic. In such a network, outage probability and local throughput depend on both the…

Information Theory · Computer Science 2014-01-03 Ralph Tanbourgi , Holger Jäkel , Leonid Chaichenets , Friedrich K. Jondral

For wireless systems in which randomly arriving devices attempt to transmit a fixed payload to a central receiver, we develop a framework to characterize the system throughput as a function of arrival rate and per-user data rate. The…

Information Theory · Computer Science 2013-10-04 Harpreet S. Dhillon , Howard C. Huang , Harish Viswanathan , Reinaldo A. Valenzuela

The effect of signals on stability, throughput region, and delay in a two-user slotted ALOHA based random-access system with collisions is considered. This work gives rise to the development of random access G-networks, which can model…

Information Theory · Computer Science 2019-02-08 Ioannis Dimitriou , Nikolaos Pappas

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…

Information Theory · Computer Science 2024-10-24 Dick Maryopi , Daud Al Adumy , Osman Musa , Peter Jung , Agus Virgono

We consider the problem of determining asymptotic bounds on the capacity of a random ad hoc network. Previous approaches assumed a link layer model in which if a transmitter-receiver pair can communicate with each other, i.e., the Signal to…

Information Theory · Computer Science 2008-11-24 Vivek P. Mhatre , Catherine P. Rosenberg , Ravi R. Mazumdar

We present a comprehensive steady-state analysis of threshold-ALOHA, a distributed age-aware modification of slotted ALOHA proposed in recent literature. In threshold-ALOHA, each terminal suspends its transmissions until the Age of…

Information Theory · Computer Science 2021-02-24 Orhan Tahir Yavascan , Elif Uysal