English
Related papers

Related papers: Stability and Throughput of Buffered Aloha with Ba…

200 papers

In-band full-duplex is emerging as a promising solution to enhance throughput in wireless networks. Allowing nodes to simultaneously send and receive data over the same bandwidth can potentially double the system capacity, and a good degree…

Networking and Internet Architecture · Computer Science 2017-09-25 Andrea Munari , Petri Mähönen , Marina Petrova

In the recent past, new enhancements based on the well established Aloha technique (CRDSA, CRDSA++, IRSA) have demonstrated the capability to reach higher throughput than traditional SA, in bursty traffic conditions and without any need of…

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

In this paper, we generalize a positive recurrence criterion for multidimensional discrete-time Markov chains over countable state spaces due to Rosberg (JAP, Vol. 17, No. 3, 1980). We revisit the stability analysis of well known…

Information Theory · Computer Science 2009-06-08 Sayee C. Kompalli , Ravi R. Mazumdar

In this work we consider a two-user and a three-user slotted ALOHA network with multi-packet reception (MPR) capabilities. The nodes can adapt their transmission probabilities and their transmission parameters based on the status of the…

Information Theory · Computer Science 2017-04-11 Ioannis Dimitriou , Nikolaos Pappas

ALOHA is one of the most basic Medium Access Control (MAC) protocols and represents a foundation for other more sophisticated distributed and asynchronous MAC protocols, e.g., CSMA. In this paper, unlike in the traditional work that focused…

Performance · Computer Science 2009-02-27 Predrag R. Jelenkovic , Jian Tan

A well-known inner bound of the stability region of the slotted Aloha protocol on the collision channel with n users assumes worst-case service rates (all user queues non-empty). Using this inner bound as a feasible set of achievable rates,…

Information Theory · Computer Science 2016-05-06 Nan Xie , Steven Weber

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…

Information Theory · Computer Science 2014-01-28 Dusan Jakovetic , Dragana Bajovic , Dejan Vukobratovic , Vladimir Crnojevic

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 this paper we propose two analytically tractable stochastic-geometric models of interference in ad-hoc networks using pure (non-slotted) Aloha as the medium access. In contrast the slotted model, the interference in pure Aloha may vary…

Networking and Internet Architecture · Computer Science 2015-10-15 Bartlomiej Blaszczyszyn , Paul Muhlethaler

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

The sum rate performance of random-access networks crucially depends on the access protocol and receiver structure. Despite extensive studies, how to characterize the maximum sum rate of the simplest version of random access, Aloha, remains…

Information Theory · Computer Science 2015-12-18 Yitong Li , Lin Dai

We consider a switched network, a fairly general constrained queueing network model that has been used successfully to model the detailed packet-level dynamics in communication networks, such as input-queued switches and wireless networks.…

Networking and Internet Architecture · Computer Science 2010-04-01 Devavrat Shah , John N. Tsitsiklis , Yuan Zhong

Randomized exponential backoff is a widely deployed technique for coordinating access to a shared resource. A good backoff protocol should, arguably, satisfy three natural properties: (i) it should provide constant throughput, wasting as…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-07-14 Michael A. Bender , Jeremy T. Fineman , Seth Gilbert , Maxwell Young

Various random access mechanisms, such as Aloha protocol and its corresponding variants have been widely studied as efficient methods to coordinate the medium access among competing users. But when two or more wireless users transmit…

Information Theory · Computer Science 2015-01-07 Zaaloul Abdellah , Haqiq Abdelkrim

Random Access (RA) Medium Access (MAC) protocols are simple and effective when the nature of the traffic is unpredictable and random. In the following paper, a novel RA protocol called Enhanced Contention Resolution ALOHA (ECRA) is…

Information Theory · Computer Science 2012-11-22 Federico Clazzer , Christian Kissling

The purpose of this paper is to analyze the so-called back-off technique of the IEEE 802.11 protocol in broadcast mode with waiting queues. In contrast to existing models, packets arriving when a station (or node) is in back-off state are…

Performance · Computer Science 2018-12-05 Guy Fayolle , Paul Muhlethaler

Stability is an important issue in order to characterize the performance of a network, and it has become a major topic of study in the last decade. Roughly speaking, a communication network system is said to be stable if the number of…

Networking and Internet Architecture · Computer Science 2020-05-06 Vicent Cholvi , Paweł Garncarek , Tomasz Jurdzinski , Dariusz R. Kowalski

In this paper we prove Aldous's conjecture from 1987 that there is no backoff protocol that is stable for any positive arrival rate. The setting is a communication channel for coordinating requests for a shared resource. Each user who wants…

Probability · Mathematics 2026-03-04 Leslie Ann Goldberg , John Lapinskas

This paper introduces a protocol that distributively constructs a collision-free schedule for multi-hop packet radio networks in the presence of hidden terminals. As a preliminary step, each wireless station computes the schedule length…

Networking and Internet Architecture · Computer Science 2012-06-21 Jaume Barcelo , Boris Bellalta , Cristina Cano , Azadeh Faridi , Miquel Oliver

Irregular repetition slotted Aloha (IRSA) has shown significant advantages as a modern technique for uncoordinated random access with massive number of users due to its capability of achieving theoretically a throughput of $1$ packet per…

Information Theory · Computer Science 2023-12-12 Manuel Fernández-Veiga , M. E. Sousa-Vieira , Ana Fernández-Vilas , Rebeca P Díaz-Redondo