English
Related papers

Related papers: A Random Access G-Network: Stability, Stable Throu…

200 papers

In this paper, we investigate the random access problem for a delay-constrained heterogeneous wireless network. As a first attempt to study this new problem, we consider a network with two users who deliver delay-constrained traffic to an…

Networking and Internet Architecture · Computer Science 2021-07-16 Danzhou Wu , Lei Deng , Zilong Liu , Yijin Zhang , Yunghsiang S. Han

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

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

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

Stability with respect to a given scheduling policy has become an important issue for wireless communication systems, but it is hard to prove in particular scenarios. In this paper two simple conditions for stability in broadcast channels…

Networking and Internet Architecture · Computer Science 2009-04-16 Chan Zhou , Gerhard Wunder

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 study, from a network layer perspective, the effect of an Ad-Hoc secondary network with N nodes randomly accessing the spectrum licensed to a primary node during the idle slots of the primary user. If the sensing is perfect, then the…

Information Theory · Computer Science 2012-05-09 Anthony Fanous , Anthony Ephremides

In this letter, we obtain the stable throughput region for a cognitive relaying scheme with a finite relaying buffer and imperfect sensing. The analysis investigates the effect of the secondary user's finite relaying capabilities under…

Networking and Internet Architecture · Computer Science 2018-03-20 Ahmed M. Alaa

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 study the throughput and delay performances of the slotted Aloha with batch service, which has wide applications in random access networks. Different from the classical slotted Aloha, each node in the slotted Aloha with…

Performance · Computer Science 2019-10-17 Huanhuan Huang , Tong Ye , Tony T. Lee

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

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 this work, we analyze the throughput of random access multi-user relay-assisted millimeter-wave wireless networks, in which both the destination and the relay have multipacket reception capability. We consider a full-duplex network…

Networking and Internet Architecture · Computer Science 2018-10-08 Cristian Tatino , Nikolaos Pappas , Ilaria Malanchini , Lutz Ewe , Di Yuan

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

We study and compare the Shannon capacity region and the stable throughput region for a random access system in which source nodes multicast their messages to multiple destination nodes. Under an erasure channel model which accounts for…

Information Theory · Computer Science 2007-09-20 Brooke Shrader , Anthony Ephremides

This paper studies the stability and $\mathcal{H}_{\infty}$ performance analysis problem for linear networked and quantized control systems with both communication delays random packet losses. To deal with the network-induced uncertainties…

Systems and Control · Electrical Eng. & Systems 2021-03-05 Wei Ren , Junlin Xiong

Recent information-theoretic studies have resulted in several interference management (IM) techniques that promise significant capacity improvements over interference avoidance techniques. However, in practice, the stable throughput region…

Information Theory · Computer Science 2021-05-18 Sajjad Nassirpour , Alireza Vahid

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

We consider a classical multiple access system with a single transmission channel, finite number of users (users), and randomized transmission protocol (ALOHA). We assume that every user sends messages to the base station with various…

Information Theory · Computer Science 2022-05-04 Dmitriy Kim , Georgi Georgiev , Natalya Markovskaya

The recent research has established an analogy between successive interference cancellation in slotted ALOHA framework and iterative belief-propagation erasure-decoding, which has opened the possibility to enhance random access protocols by…

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