English
Related papers

Related papers: Analysis of Non-Persistent CSMA Protocols with Exp…

200 papers

This paper proposes a Markovian model of 1-persistent CSMA/CA protocols with K-Exponential Backoff scheduling algorithms. The input buffer of each access node is modeled as a Geo/G/1 queue, and the service time distribution of each…

Networking and Internet Architecture · Computer Science 2011-03-09 Pui King Wong , Dongjie Yin , Tony T. Lee

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

This paper presents the delay analysis for buffered Aloha networks with K-Exponential Backoff. Mean access delay and mean queueing delay are derived and demonstrated via the examples of Geometric Retransmission (K=1) and Exponential Backoff…

Networking and Internet Architecture · Computer Science 2009-07-27 Lin Dai , 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

A widely adopted two-dimensional Markov chain model of the IEEE 802.11 DCF was introduced by Bianchi to characterize the backoff behavior of a single node under a saturated traffic condition. Using this approach, we propose a queuing model…

Networking and Internet Architecture · Computer Science 2012-01-12 Dongjie Yin , Pui King Wong , Tony T. Lee

This paper provides proofs of the rate stability, Harris recurrence, and epsilon-optimality of CSMA algorithms where the backoff parameter of each node is based on its backlog. These algorithms require only local information and are easy to…

Information Theory · Computer Science 2009-07-08 Libin Jiang , Devavrat Shah , Jinwoo Shin , Jean Walrand

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

Recent studies on MAC scheduling have shown that carrier sense multiple access (CSMA) algo- rithms can be throughput optimal for arbitrary wireless network topology. However, these results are highly sensitive to the underlying assumption…

Networking and Internet Architecture · Computer Science 2013-06-11 Se-Young Yun , Jinwoo Shin , Yung Yi

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

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

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

Many modern wireless networks integrate carrier sense mul-tiple access/collision avoidance (CSMA/CA) with exponential backoff as medium access control (MAC) technique. In order to decrease the MAC overhead and the collision probability, we…

Networking and Internet Architecture · Computer Science 2015-01-08 Baher Mawlawi , Jean-Baptiste Doré

Recently, it has been shown that CSMA-type random access algorithms can achieve the maximum possible throughput in ad hoc wireless networks. However, these algorithms assume an idealized continuous-time CSMA protocol where collisions can…

Networking and Internet Architecture · Computer Science 2019-11-13 Jian Ni , Bo Tan , R. Srikant

Collisions are a main cause of throughput degradation in WLANs. The current contention mechanism used in IEEE 802.11 networks is called Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA). It uses a Binary Exponential Backoff…

Networking and Internet Architecture · Computer Science 2016-11-15 Luis Sanabria-Russo , Jaume Barcelo , Boris Bellalta , Francesco Gringoli

Randomized backoff protocols, such as exponential backoff, are a powerful tool for managing access to a shared resource, often a wireless communication channel (e.g., [1]). For a wireless device to transmit successfully, it uses a backoff…

Data Structures and Algorithms · Computer Science 2022-07-26 Michael A. Bender , Seth Gilbert , Fabian Kuhn , John Kuszmaul , Muriel Médard

Recently, low-complexity and distributed Carrier Sense Multiple Access (CSMA)-based scheduling algorithms have attracted extensive interest due to their throughput-optimal characteristics in general network topologies. However, these…

Networking and Internet Architecture · Computer Science 2014-05-06 Bin Li , Atilla Eryilmaz

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

Carrier Sense Multiple Access with Enhanced Collision Avoidance (CSMA/ECA) is a distributed MAC protocol that allows collision-free access to the medium in WLAN. The only difference between CSMA/ECA and the well-known CSMA/CA is that the…

Networking and Internet Architecture · Computer Science 2010-11-29 Jaume Barcelo , Boris Bellalta , Cristina Cano , Anna Sfairopoulou , Miquel Oliver , Kshitiz Verma

The effect of signals on stability, throughput region, and delay in a two-user slotted ALOHA based random-access system with collisions is considered. This work gives rise to the development of random access G-networks, which can model…

Information Theory · Computer Science 2019-02-08 Ioannis Dimitriou , Nikolaos Pappas

We consider a generalized processing system having several queues, where the available service rate combinations are fluctuating over time due to reliability and availability variations. The objective is to allocate the available resources,…

Networking and Internet Architecture · Computer Science 2011-05-04 Kevin Ross , Nicholas Bambos , George Michailidis
‹ Prev 1 2 3 10 Next ›