English
Related papers

Related papers: On the stability of asynchronous Random Access Sch…

200 papers

We focus on a slotted ALOHA system without feedback, in which nodes transmit time-stamped updates to a common gateway. Departing from the classical generate-at-will model, we assume that each transmitter may not always have fresh…

Information Theory · Computer Science 2022-05-31 Andrea Munari

Motivated by the need to hide the complexity of the physical layer from performance analysis in a layer 2 protocol, a class of abstract receivers, called Poisson receivers, was recently proposed in [1] as a probabilistic framework for…

Networking and Internet Architecture · Computer Science 2025-07-17 Tzu-Hsuan Liu , Che-Hao Yu , Yi-Jheng Lin , Cheng-Shang Chang , Duan-Shin Lee

Non-orthogonal multiple access (NOMA) has been considered as a promising solution for improving the spectrum efficiency of next-generation wireless networks. In this paper, the performance of a p-persistent slotted ALOHA system in support…

Networking and Internet Architecture · Computer Science 2020-02-25 Ziru Chen , Yong Liu , Sami Khairy , Lin X. Cai , Yu Cheng , Ran Zhang

This paper deals with the reliability of random access (RA) protocols for massive wireless smart grid communication (m-SGC). We propose and analyze an improved grant-free RA (GF-RA) protocol for critical SG applications under strict QoS…

Networking and Internet Architecture · Computer Science 2023-05-04 Angel Esteban Labrador Rivas , Taufik Abrão

We develop a framework for communication-control co-design in a wireless networked control system with multiple geographically separated controllers and controlled systems, modeled via a Poisson point process. Each controlled system…

Information Theory · Computer Science 2024-12-02 Gourab Ghatak , Geethu Joseph , Chen Quan

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…

Information Theory · Computer Science 2018-08-21 Shun Ogata , Koji Ishibashi , Giuseppe Abreu

We investigate fully asynchronous unsourced random access (URA), and propose a high-performing scheme that employs on-off division multiple access (ODMA). In this scheme, active users distribute their data over the transmit block based on a…

Signal Processing · Electrical Eng. & Systems 2025-04-16 Mert Ozates , Mohammad Kazemi , Gianluigi Liva , Deniz Gündüz

Reliable simultaneous localization and mapping (SLAM) algorithms are necessary for safety-critical autonomous navigation. In the communication-constrained multi-agent setting, navigation systems increasingly use point-to-point range sensors…

Robotics · Computer Science 2025-05-15 Alexander Thoms , Alan Papalia , Jared Velasquez , David M. Rosen , Sriram Narasimhan

In the current context of massive IoT, the Pure-Aloha scheme used in LoRaWAN is reaching its limit, and Slotted-Aloha is being considered as an alternative, as it offers twice Pure-Aloha's packet success rate. It however requires…

Networking and Internet Architecture · Computer Science 2024-05-24 Amavi Dossa , El Mehdi Amhoud

The paper proposes Resource Allocation (RA) schemes for a closed loop feedback control system by analysing the control-communication dependencies. We consider an Automated Guided Vehicle (AGV) that communicates with a controller located in…

Systems and Control · Electrical Eng. & Systems 2023-01-24 Shreya Tayade , Peter Rost , Andreas Maeder , Hans Schotten

In a wireless network the set of transmitting nodes changes frequently because of the MAC scheduler and the traffic load. Previously, connectivity in wireless networks was analyzed using static geometric graphs, and as we show leads to an…

Information Theory · Computer Science 2015-03-13 RadhaKrishna Ganti , Martin Haenggi

Artificial intelligence-generated traffic is changing the shape of wireless networks. Specifically, as the amount of data generated to train machine learning models is massive, network resources must be carefully allocated to continue…

Networking and Internet Architecture · Computer Science 2026-02-03 Giovanni Perin , Eunjeong Jeong , Nikolaos Pappas

We propose a contention-based random-access protocol, designed for wireless networks where the number of users is not a priori known. The protocol operates in rounds divided into equal-duration slots, performing at the same time estimation…

Information Theory · Computer Science 2012-10-03 Čedomir Stefanović , Kasper F. Trilingsgaard , Nuno K. Pratas , Petar Popovski

This paper studies low-power random access protocols for timely status update systems with information freshness requirements, measured by age of information (AoI). In an extensive network, a fundamental challenge is scheduling a large…

Networking and Internet Architecture · Computer Science 2023-12-14 Tse-Tin Chan , Jian Feng , Haoyuan Pan

Stability region of random access wireless networks is known for only simple network scenarios. The main problem in this respect is due to interaction among queues. When transmission probabilities during successive transmissions change,…

Networking and Internet Architecture · Computer Science 2014-06-18 Farzaneh Farhadi , Farid Ashtiani

In this work, we present a variant of the multilayer random sequential adsorption (RSA) process that is inspired by orthogonal resource sharing in wireless communication networks. In the one-dimensional (1D) version of this variant, the…

Information Theory · Computer Science 2022-02-23 Priyabrata Parida , Harpreet S. Dhillon

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

In our basic model, we study a stationary Poisson pattern of nodes on a line embedded in an independent planar Poisson field of interfering nodes. Assuming slotted Aloha and the signal-to-interference-and-noise ratio capture condition, with…

Networking and Internet Architecture · Computer Science 2015-03-20 Bartlomiej Blaszczyszyn , Paul Muhlethaler

Contention tree algorithm is initially invented as a solution to improve the stable throughput problem of Slotted ALOHA in multiple access schemes. Even though the throughput is stabilized in tree algorithms, the delay of requests may grow…

Information Theory · Computer Science 2017-08-01 Murat Gürsu , Alberto Martínez Alba , Wolfgang Kellerer

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…

Networking and Internet Architecture · Computer Science 2014-05-27 Tanveer Ahmad , Yan tian feng