English
Related papers

Related papers: Stability Analysis of Frame Slotted Aloha Protocol

200 papers

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

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

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

In this paper, we consider the standard discrete-time slotted ALOHA with a finite number of terminals with infinite size buffers. In our study, we jointly consider the stability of this system together with the physical layer security. We…

Information Theory · Computer Science 2009-10-29 Yunus Sarikaya , Ozgur Ercetin

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

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

This paper studies the buffered Aloha with K-exponential backoff collision resolution algorithms. The buffered Aloha network is modeled as a multi-queue single-server system. We adopt a widely used approach in packet switching systems to…

Networking and Internet Architecture · Computer Science 2008-04-23 Tony T. Lee , Lin Dai

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

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

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

This two-part paper series studies the performance of buffered Aloha networks with K-Exponential Backoff collision resolution algorithms. Part I focuses on stability and throughput analysis and Part II presents the delay analysis. In Part…

Networking and Internet Architecture · Computer Science 2009-07-27 Tony T. Lee , Lin Dai

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

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

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

Supporting massive device transmission is challenging in Machine-to-Machine (M2M) communications. Particularly, in event-driven M2M communications, a large number of devices activate within a short period of time, which in turn causes high…

Information Theory · Computer Science 2012-08-16 Huasen Wu , Chenxi Zhu , Richard J. La , Xin Liu , Youguang Zhang

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

Energy harvesting (EH) is a promising technology for realizing energy efficient wireless networks. In this paper, we utilize the ambient RF energy, particularly interference from neighboring transmissions, to replenish the batteries of the…

Networking and Internet Architecture · Computer Science 2015-07-28 Abdelrahman M. Ibrahim , Ozgur Ercetin , Tamer ElBatt

In this paper a Time Division Multiple Access (TDMA) based Random Access (RA) channel with Successive Interference Cancellation (SIC) is considered for a finite user population and reliable retransmission mechanism on the basis of…

Information Theory · Computer Science 2016-11-18 Christian Kissling

Wireless random access protocols are attracting a revived research interest as a simple yet effective solution for machine-type communications. In the quest to improve reliability and spectral efficiency of such schemes, the use of multiple…

Information Theory · Computer Science 2019-03-11 Andrea Munari , Federico Clazzer , Gianluigi Liva , Michael Heindlmaier

We analyse an ALOHA-type random multiple-access protocol where users have local interactions. We show that the fluid model of the system workload satisfies a certain differential equation. We obtain a sufficient condition for the stability…

Probability · Mathematics 2017-11-29 Charles Bordenave , Sergey Foss , Vsevolod Shneer
‹ Prev 1 2 3 10 Next ›