English
Related papers

Related papers: Approaching Throughput-optimality in Distributed C…

200 papers

The strength of carrier-sense multiple access with collision avoidance (CSMA/CA) can be combined with that of time-division multiple access (TDMA) to enhance the channel access performance in wireless networks such as the IEEE…

Networking and Internet Architecture · Computer Science 2016-11-18 Bharat Shrestha , Ekram Hossain , Kae Won Choi

Throughput-optimal transmission scheduling in wireless networks has been a well considered problem in the literature, and the method for achieving optimality, MaxWeight scheduling, has been known for several decades. This algorithm achieves…

Networking and Internet Architecture · Computer Science 2020-08-05 Thomas Stahlbuhk , Brooke Shrader , Eytan Modiano

This book chapter introduces the use of Continuous Time Markov Networks (CTMN) to analytically capture the operation of Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) networks. It is of tutorial nature, and it aims to be…

Networking and Internet Architecture · Computer Science 2014-05-15 B. Bellalta , A. Zocca , C. Cano , A. Checco , J. Barcelo , A. Vinel

This paper develops a distributed algorithm for rate allocation in wireless networks that achieves the same throughput region as optimal centralized algorithms. This cross-layer algorithm jointly performs medium access control (MAC) and…

Information Theory · Computer Science 2015-03-13 Jubin Jose , Sriram Vishwanath

This paper focuses on achieving optimal multi-user channel access in distributed networks using a reconfigurable intelligent surface (RIS). The network includes wireless channels with direct links between users and RIS links connecting…

Information Theory · Computer Science 2023-09-25 Zhou Zhang , Saman Atapattu , Yizhu Wang , Marco Di Renzo

In this paper, we consider CSMA policies for scheduling of multihop wireless networks with one-hop traffic. The main contribution of this paper is to propose Unlocking CSMA (U-CSMA) policy that enables to obtain high throughput with low…

Information Theory · Computer Science 2010-09-30 Mahdi Lotfinezhad , Peter Marbach

Carrier Sense Multiple Access (CSMA) MAC protocols are known to suffer from the hidden station (HS) problem. The complete mathematical analysis of CSMA networks with HSs is still an open problem, even for broadcast communication with a…

Networking and Internet Architecture · Computer Science 2016-12-20 Yunpeng Zang , Bernhard Walke , Guido Hiertz , Christian Wietfeld

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 consider a Carrier Sense Multiple Access (CSMA) based scheduling algorithm for a single-hop wireless network under a realistic Signal-to-interference-plus-noise ratio (SINR) model for the interference. We propose two local optimization…

Information Theory · Computer Science 2017-02-24 Peruru Subrahmanya Swamy , Radha Krishna Ganti , Krishna Jagannathan

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

In this paper, we propose a novel adaptive carrier sense multiple access scheme with collision avoidance (CSMA/CA) to perform efficient and reliable data transfer with increased throughput across multiple coexisting wireless body area…

Networking and Internet Architecture · Computer Science 2018-03-18 Samiya M. Shimly , David B. Smith , Samaneh Movassaghi

The complexity of a CSMA algorithm has been translated to the norm properties of a dependencies matrix. The maximum throughput optimization is reformulated by including the dependencies matrix in the formulations. It has been shown that for…

Information Theory · Computer Science 2015-09-22 Mahdi Azarafrooz , R. Chandramouli

Design of energy efficient protocols for modern wireless systems has become an important area of research. In this paper, we propose a distributed optimization algorithm for the channel assignment problem for multiple interfering…

Networking and Internet Architecture · Computer Science 2018-02-16 Oshri Naparstek , S. M. Zafaruddin , Amir Leshem , Eduard Jorswieck

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

We consider a general class of low complexity distributed scheduling algorithms in wireless networks, maximal scheduling with priorities, where a maximal set of transmitting links in each time slot are selected according to certain…

Information Theory · Computer Science 2011-12-05 Qiao Li , Rohit Negi

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

The thesis is dedicated to studying methods to improve the efficiency of random access schemes and to facilitate their deployment in machine-type communications (MTC). First, a joint user activity identification and channel estimation…

Information Theory · Computer Science 2019-06-11 Zhuo Sun

In this paper, we propose a distributed throughput-optimal ad hoc wireless network scheduling algorithm, which is motivated by the celebrated simplex algorithm for solving linear programming (LP) problems. The scheduler stores a sparse set…

Information Theory · Computer Science 2016-11-17 Qiao Li , Rohit Negi

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

We study algorithms for carrier and rate allocation in cellular systems with distributed components such as a heterogeneous LTE system with macrocells and femtocells. Existing work on LTE systems often involves centralized techniques or…

Networking and Internet Architecture · Computer Science 2013-01-04 Matthew Andrews , Lisa Zhang