English
Related papers

Related papers: A Random Multiple Access Protocol with Spatial Int…

200 papers

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…

Information Theory · Computer Science 2015-01-29 Alessio Meloni , Maurizio Murroni

We consider a decentralised multi-access algorithm, motivated primarily by the control of transmissions in a wireless network. For a finite single-hop network with arbitrary interference constraints we prove stochastic stability under the…

Information Theory · Computer Science 2019-06-03 Seva Shneer , Alexander Stolyar

Slotted Aloha has been widely adopted in various communication networks. Yet if the transmission probabilities and traffic input rates of transmitters are not properly regulated, their data queues may easily become unstable. For stability…

Networking and Internet Architecture · Computer Science 2024-06-05 Yunshan Yang , Lin Dai

We present a novel access protocol for crowd scenarios in massive MIMO (Multiple-input multiple-output) systems. Crowd scenarios are characterized by a large number of users with intermittent access behavior, whereby orthogonal scheduling…

Information Theory · Computer Science 2016-05-20 Jesper H. Sørensen , Elisabeth de Carvalho , Čedomir Stefanović , Petar Popovski

Interference is a main limiting factor of the performance of a wireless ad hoc network. The temporal and the spatial correlation of the interference makes the outages correlated temporally (important for retransmissions) and spatially…

Information Theory · Computer Science 2010-10-11 Radha Krishna Ganti , Martin Haenggi

We investigate the scheduling of a common resource between several concurrent users when the feasible transmission rate of each user varies randomly over time. Time is slotted and users arrive and depart upon service completion. This may…

Performance · Computer Science 2015-03-18 U. Ayesta , M. Erausquin , M. Jonckheere , I. M. Verloop

The use of Aloha-based Random Access protocols is interesting when channel sensing is either not possible or not convenient and the traffic from terminals is unpredictable and sporadic. In this paper an analytic model for packet…

Information Theory · Computer Science 2015-02-05 Alessio Meloni , Maurizio Murroni

We analyze the stability of standard, buffered, slotted-Aloha systems. Specifically, we consider a set of $N$ users, each equipped with an infinite buffer. Packets arrive into user $i$'s buffer according to some stationary ergodic Markovian…

Information Theory · Computer Science 2009-09-29 Charles Bordenave , David McDonald , Alexandre Proutiere

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

Various applications of wireless Machine-to-Machine (M2M) communications have rekindled the research interest in random access protocols, suitable to support a large number of connected devices. Slotted ALOHA and its derivatives represent a…

Information Theory · Computer Science 2013-08-08 Cedomir Stefanovic , Petar Popovski

A wireless network in which packets are broadcast to a group of receivers through use of a random access protocol is considered in this work. The relation to previous work on networks of interacting queues is discussed and subsequently, the…

Information Theory · Computer Science 2007-11-05 Brooke Shrader , Anthony Ephremides

Modern random access protocols are emerging as an efficient yet simple solution for arising internet of things (IoT) applications in upcoming beyond-5G systems. In this context, both terrestrial and non-terrestrial scenarios can benefit…

Information Theory · Computer Science 2019-06-06 Andrea Munari , Federico Clazzer

In multi-class communication networks, traffic surges due to one class of users can significantly degrade the performance for other classes. During these transient periods, it is thus of crucial importance to implement priority mechanisms…

Performance · Computer Science 2011-12-12 Mathieu Feuillet , Matthieu Jonckheere , Balakrishna J. Prabhu

This paper considers a parallel system of queues fed by independent arrival streams, where the service rate of each queue depends on the number of customers in all of the queues. Necessary and sufficient conditions for the stability of the…

Probability · Mathematics 2010-01-12 Sem Borst , Matthieu Jonckheere , Lasse Leskelä

We introduce a new model of spatial random multiple access systems with a non-standard departure policy: all arriving messages are distributed uniformly on a finite sphere in the space, and when a successful transmission of a single message…

Networking and Internet Architecture · Computer Science 2017-08-29 Sergey Foss , Andrey Turlikov , Maxim Grankin

We consider a model of a decentralized multiple access system with a non-standard binary feedback where the empty and collision situations cannot be distinguished. We show that, like in the case of a ternary feedback, for any input rate…

Probability · Mathematics 2016-07-12 Sergey Foss , Bruce Hajek , Andrey Turlikov

In this paper, a network comprising wireless devices equipped with buffers transmitting deadline-constrained data packets over a slotted-ALOHA random-access channel is studied. Although communication protocols facilitating retransmissions…

Information Theory · Computer Science 2022-10-07 Nikolaos Nomikos , Themistoklis Charalambous , Yvonne-Anne Pignolet , Nikolaos Pappas

This article aims to investigate sufficient conditions for the stability of stochastic differential equations with a random structure, particularly in contexts involving the presence of concentration points. The proof of asymptotic…

Probability · Mathematics 2023-05-22 Taras Lukashiv , Igor V. Malyk , Maryna Chepeleva , Petr V. Nazarov

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

Information Theory · Computer Science 2012-12-27 Jasper Goseling , Michael Gastpar , Jos H. Weber

In this paper we study the impact of a relay node in a two-user network. We assume a random access collision channel model with erasures. In particular we obtain an inner and an outer bound for the stability region.

Information Theory · Computer Science 2016-11-15 Nikolaos Pappas , Marios Kountouris , Anthony Ephremides , Apostolos Traganitis