English
Related papers

Related papers: Fairness in Collision-Free WLANs

200 papers

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

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

In wireless local area networks (WLANs), a media access protocol arbitrates access to the channel. In current IEEE 802.11 WLANs, carrier sense multiple access with collision avoidance (CSMA/CA) is used. Carrier sense multiple access with…

Networking and Internet Architecture · Computer Science 2013-11-05 Jaume Barcelo , Azadeh Faridi , Boris Bellalta , Gabriel Martorell , David Malone

The ability to perform traffic differentiation is a promising feature of the current Medium Access Control (MAC) in Wireless Local Area Networks (WLANs). The Enhanced Distributed Channel Access (EDCA) protocol for WLANs proposes up to four…

Networking and Internet Architecture · Computer Science 2016-05-30 Luis Sanabria-Russo , Boris Bellalta

In today's WLANs, scheduling of packet transmissions solely relies on the collision and success a station may experience. To better support traffic differentiation in dense WLANs, in this paper, we propose a distributed reservation…

Networking and Internet Architecture · Computer Science 2018-06-26 Seyedmohammad Salehi , Li Li , Chien-Chung Shen , Leonard Cimini , John Graybeal

Collisions are a main cause of throughput degradation in Wireless LANs. The current contention mechanism for these networks is based on a random backoff strategy to avoid collisions with other transmitters. Even though it can reduce the…

Networking and Internet Architecture · Computer Science 2014-10-30 Luis Sanabria-Russo , Francesco Gringoli , Jaume Barcelo , Boris Bellalta

In this paper a candidate protocol to replace the prevalent CSMA/CA medium access control in Wireless Local Area Networks is presented. The proposed protocol can achieve higher throughput than CSMA/CA, while maintaining fairness, and…

Networking and Internet Architecture · Computer Science 2016-11-15 Luis Sanabria-Russo , Azadeh Faridi , Boris Bellalta , Jaume Barcelo , Miquel Oliver

WiFi's popularity has led to crowded scenarios composed of many Access Points (AP) and clients, often operating on overlapping channels, producing interference that gravely degrades performance. This misallocation of resources is often the…

Networking and Internet Architecture · Computer Science 2016-07-28 Luis Sanabria-Russo , Boris Bellalta , Nicolò Facchi , Francesco Gringoli

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

Carrier sense multiple access collision avoidance (CSMA/CA) is the basic scheme upon which access to the shared medium is regulated in many wireless networks. With CSMA/CA a station willing to start a transmission has first to find the…

Networking and Internet Architecture · Computer Science 2019-01-15 Paolo Ballarini , Benoit Barbot , Nicolas Vasselin

It has been recently suggested that in wireless networks, CSMA-based distributed MAC algorithms could achieve optimal utility without any message passing. We present the first proof of convergence of such adaptive CSMA algorithms towards an…

Information Theory · Computer Science 2016-11-18 Jiaping Liu , Yung Yi , Alexandre Proutiere , Mung Chiang , H. Vincent Poor

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

Wireless objects equipped with multiple antennas are able to simultaneously transmit multiple packets by exploiting the channel's spatial dimensions. In this paper, we study the benefits of such Multiple Packet Transmission (MPT) approach,…

Networking and Internet Architecture · Computer Science 2013-06-25 Boris Bellalta , Azadeh Faridi , Dirk Staehle , Jaume Barcelo , Alexey Vinel , Miquel Oliver

We consider a network of selfish nodes that would like to minimize the age of their updates at the other nodes. The nodes send their updates over a shared spectrum using a CSMA/CA based access mechanism. We model the resulting competition…

Computer Science and Game Theory · Computer Science 2020-01-27 Sneihil Gopal , Sanjit K. Kaul , Rakesh Chaturvedi , Sumit Roy

In this technical report, the throughput performance of CSMA networks with two representative receiver structures, i.e., the collision model and the capture model, is characterized and optimized. The analysis is further applied to an IEEE…

Networking and Internet Architecture · Computer Science 2019-06-18 Xinghua Sun , Lin Dai

In the context of radio distributed networks, we present a generalized approach for the Medium Access Control (MAC) with fixed congestion window. Our protocol is quite simple to analyze and can be used in a lot of different situations. We…

Networking and Internet Architecture · Computer Science 2007-12-19 Jerome Galtier

Carrier Sense Multiple Access (CSMA) protocols have been shown to reach the full capacity region for data communication in wireless networks, with polynomial complexity. However, current literature achieves the throughput optimality with an…

Networking and Internet Architecture · Computer Science 2014-01-16 Hongxing Li , Nitin Vaidya

We consider a wireless network where each flow (instead of each link) runs its own CSMA (Carrier Sense Multiple Access) algorithm. Specifically, each flow attempts to access the radio channel after some random time and transmits a packet if…

Performance · Computer Science 2011-02-23 T. Bonald , M. Feuillet

Rate-Splitting Multiple Access (RSMA) has been recognized as a promising multiple access technique for future wireless communication systems. Recent research demonstrates that RSMA can maintain its superiority without relying on Successive…

Information Theory · Computer Science 2025-07-16 Sibo Zhang , Bruno Clerckx , David Vargas

Contention resolution addresses the problem of coordinating access to a shared communication channel. Time is discretized into synchronized slots, and a packet can be sent in any slot. If no packet is sent, then the slot is empty; if a…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-08-22 Umesh Biswas , Trisha Chakraborty , Maxwell Young
‹ Prev 1 2 3 10 Next ›