English
Related papers

Related papers: A formal proof of the optimal frame setting for Dy…

200 papers

In this paper we investigate backlog estimation procedures for Dynamic Frame Aloha (DFA) in Radio Frequency Identification (RFID) environment. In particular, we address the tag identification efficiency with any tag number $N$, including…

Information Theory · Computer Science 2013-05-07 Luca Barletta , Flaminio Borgonovo , Matteo Cesana

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…

Information Theory · Computer Science 2016-06-15 Erik Sandgren , Alexandre Graell i Amat , Fredrik Brännström

This paper presents a finite length analysis of multi-slot type frameless ALOHA based on a dynamic programming approach. The analysis is exact, but its evaluation is only feasible for moderate number of users due to the computational…

Information Theory · Computer Science 2020-07-07 Francisco Lázaro , Čedomir Stefanović , Petar Popovski

We study the dynamic behavior of frameless ALOHA, both in terms of throughput and age of information (AoI). In particular, differently from previous studies, our analysis accounts for the fact that the number of terminals contending the…

Information Theory · Computer Science 2023-08-29 Andrea Munari , Francisco Lazaro , Giuseppe Durisi , Gianluigi Liva

In this paper we present an exact finite-length analysis of frameless ALOHA that is obtained through a dynamical programming approach. Monte Carlo simulations are performed in order to verify the analysis. Two examples are provided that…

Information Theory · Computer Science 2016-11-22 Francisco Lázaro , Čedomir Stefanović

We consider a frame asynchronous coded slotted ALOHA (FA-CSA) system for uncoordinated multiple access, where users join the system on a slot-by-slot basis according to a Poisson random process and, in contrast to standard frame synchronous…

Information Theory · Computer Science 2016-11-29 Erik Sandgren , Alexandre Graell i Amat , Fredrik Brännström

In this paper we present a finite-length analysis of frameless ALOHA for a k multi-user detection scenario, i.e., assuming the receiver can resolve collisions of size k or smaller. The analysis is obtained via a dynamical programming…

Information Theory · Computer Science 2017-01-01 Francisco Lazaro , Cedomir Stefanovic

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

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 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 this paper we propose two analytically tractable stochastic models of non-slotted Aloha for Mobile Ad-hoc NETworks (MANETs): one model assumes a static pattern of nodes while the other assumes that the pattern of nodes varies over time.…

Networking and Internet Architecture · Computer Science 2010-10-28 Bartek Blaszczyszyn , Paul Muhlethaler

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

This letter offers the first characterisation of the stability for full-duplex large size networks. Through stochastic geometry tools, key performance metrics like delay and maximum stable arrival rate are derived for the non saturated…

Networking and Internet Architecture · Computer Science 2016-09-19 Andrea Munari , Francesco Rossetto , Petri Mähönen , Marina Petrova

One of the novelties brought by 5G is that wireless system design has increasingly turned its focus on guaranteeing reliability and latency. This shifts the design objective of random access protocols from throughput optimization towards…

Information Theory · Computer Science 2017-09-08 Cedomir Stefanovic , Francisco Lazaro , Petar Popovski

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…

Information Theory · Computer Science 2022-06-23 Lei Deng , Danzhou Wu , Jing Deng , Po-Ning Chen , Yunghsiang S. Han

Non-orthogonal multiple-access (NOMA) is a leading technology which gain a lot of interest this past several years. It enables larger user density and therefore is suited for modern systems such as 5G and IoT. In this paper we examined…

Information Theory · Computer Science 2021-02-09 Maya Slamovich , Ram Zamir

Information aging has gained prominence in characterizing communication protocols for timely remote estimation and control applications. This work proposes an Age of Information (AoI)-aware threshold-based dynamic frame slotted ALOHA…

Networking and Internet Architecture · Computer Science 2024-01-04 Masoumeh Moradian , Aresh Dadlani , Ahmad Khonsari , Hina Tabassum

Based on a stochastic geometry framework, we establish an analysis of the multi-hop spatial reuse aloha protocol (MSR-Aloha) in ad hoc networks. We compare MSR-Aloha to a simple routing strategy, where a node selects the next relay of the…

Information Theory · Computer Science 2010-01-20 Olfa Ben Sik Ali , Christian Cardinal , Francois Gagnon

This paper considers the requirements to ensure bounded mean queuing delay and non-starvation in a slotted Aloha network operating the exponential backoff protocol. It is well-known that the maximum possible throughput of a slotted Aloha…

Networking and Internet Architecture · Computer Science 2008-07-14 Soung Chang Liew , Ying Jun Zhang , Da Rui Chen

In this paper, a simple variation of classical Slotted Aloha is introduced and analyzed. The enhancement relies on adding multiple receivers that gather different observations of the packets transmitted by a user population in one slot. For…

Networking and Internet Architecture · Computer Science 2014-01-16 Andrea Munari , Michael Heindlmaier , Gianluigi Liva , Matteo Berioli
‹ Prev 1 2 3 10 Next ›