English
Related papers

Related papers: Convergence and Tradeoff of Utility-Optimal CSMA

200 papers

We address fair sensor scheduling over bandwidth-constrained communication channels. While existing literature on fair scheduling overlooks overall system efficiency, we introduce a novel $q$-fairness framework to balance efficiency and…

Systems and Control · Electrical Eng. & Systems 2025-09-22 Yuxing Zhong , Yuchi Wu , Daniel E. Quevedo , Ling Shi

In multi-access wireless networks, transmission scheduling is a key component that determines the efficiency and fairness of wireless spectrum allocation. At one extreme, greedy opportunistic scheduling that allocates airtime to the user…

Networking and Internet Architecture · Computer Science 2011-07-28 Suzhi Bi , Ying Jun , Zhang

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

Wireless networks equipped with the CSMA protocol are subject to collisions due to interference. For a given interference range we investigate the tradeoff between collisions (hidden nodes) and unused capacity (exposed nodes). We show that…

Networking and Internet Architecture · Computer Science 2010-04-08 P. M. van de Ven , A. J. E. M. Janssen , J. S. H. van Leeuwaarden

In this paper, we study the downlink multiuser scheduling problem for systems with simultaneous wireless information and power transfer (SWIPT). We design optimal scheduling algorithms that maximize the long-term average system throughput…

Information Theory · Computer Science 2015-05-26 Maryna Chynonova , Rania Morsi , Derrick Wing Kwan Ng , Robert Schober

This paper studies how to achieve the maximal link throughputs in a CSMA wireless network through offered-load control. First, we propose an analytical model, contention-graph-combination (CGC), to describe the relationship between the…

Networking and Internet Architecture · Computer Science 2014-04-29 Caihong Kai , Qi Zhang , Lusheng Wang

In this paper, we study the transport capacity of large multi-hop wireless CSMA networks. Different from previous studies which rely on the use of centralized scheduling algorithm and/or centralized routing algorithm to achieve the optimal…

Networking and Internet Architecture · Computer Science 2016-11-17 Tao Yang , Guoqiang Mao , Wei Zhang , Xiaofeng Tao

Distributed Opportunistic Scheduling (DOS) techniques have been recently proposed to improve the throughput performance of wireless networks. With DOS, each station contends for the channel with a certain access probability. If a contention…

Networking and Internet Architecture · Computer Science 2014-12-16 Andres Garcia-Saavedra , Albert Banchs , Pablo Serrano , Joerg Widmer

Distributed allocation finds applications in many scenarios including CPU scheduling, distributed energy resource management, and networked coverage control. In this paper, we propose a fast convergent optimization algorithm with a tunable…

Signal Processing · Electrical Eng. & Systems 2024-01-30 Mohammadreza Doostmohammadian , Alireza Aghasi

CSMA (Carrier Sense Multiple Access) algorithms based on Gibbs sampling can achieve throughput optimality if certain parameters called the fugacities are appropriately chosen. However, the problem of computing these fugacities is NP-hard.…

Networking and Internet Architecture · Computer Science 2017-02-23 Peruru Subrahmanya Swamy , Venkata Pavan Kumar Bellam , Radha Krishna Ganti , Krishna Jagannathan

In this paper, we investigate a distributed learning scheme for a broad class of stochastic optimization problems and games that arise in signal processing and wireless communications. The proposed algorithm relies on the method of matrix…

Information Theory · Computer Science 2017-04-05 Panayotis Mertikopoulos , E. Veronica Belmega , Romain Negrel , Luca Sanguinetti

We consider the design of distributed scheduling algorithms that minimize age of information in single-hop wireless networks. The centralized max-weight policy is known to be nearly optimal in this setting; hence, our goal is to design a…

Networking and Internet Architecture · Computer Science 2023-07-13 Vishrant Tripathi , Nicholas Jones , Eytan Modiano

Simulated annealing (SA) method has had significant recent success in designing distributed control algorithms for wireless networks. These SA based techniques formed the basis of new CSMA algorithms and gave rise to the development of…

Optimization and Control · Mathematics 2018-09-11 Jaewook Kwak , Ness B. Shroff

This paper considers a wireless link with randomly arriving data that is queued and served over a time-varying channel. It is known that any algorithm that comes within $\epsilon$ of the minimum average power required for queue stability…

Optimization and Control · Mathematics 2014-11-19 Michael J. Neely

This paper focuses on the cross-layer issue of joint multiuser detection and resource allocation for energy efficiency in wireless CDMA networks. In particular, assuming that a linear multiuser detector is adopted in the uplink receiver,…

Information Theory · Computer Science 2007-12-11 Stefano Buzzi , H. Vincent Poor

In this paper, we examine the fundamental trade-off between radiated power and achieved throughput in wireless multi-carrier, multiple-input and multiple-output (MIMO) systems that vary with time in an unpredictable fashion (e.g. due to…

Information Theory · Computer Science 2015-03-10 Ioannis Stiakogiannakis , Panayotis Mertikopoulos , Corinne Touati

Energy consumption is a main issue of concern in wireless networks. Energy minimization increases the time that networks' nodes work properly without recharging or substituting batteries. Another criterion for network performance is data…

Information Theory · Computer Science 2010-12-13 Amirmahdi Khodaian , Babak H. Khalaj

In this paper the issue of energy efficiency in CDMA wireless data networks is addressed through a game theoretic approach. Building on a recent paper by the first two authors, wherein a non-cooperative game for spreading-code optimization,…

Information Theory · Computer Science 2007-07-13 Stefano Buzzi , H. Vincent Poor , Daniela Saturnino

CSMA/ECA is a contention protocol that makes it possible to construct a collision-free schedule by using a deterministic backoff after successful transmissions. In this paper, we further enhance the CSMA/ECA protocol with two properties…

Networking and Internet Architecture · Computer Science 2013-02-08 Luis Sanabria-Russo , Jaume Barcelo , Boris Bellalta

Low latency and reliable information transfer are highly demanded in fifth generation (5G) and beyond 5G wireless communications. A novel delay-bounded wireless media access control (MAC) protocol called Carrier Sense Multiple Access with…

Networking and Internet Architecture · Computer Science 2022-11-14 Haruaki Tanaka , Yusuke Yamasaki , Satoshi Yasuda , Nobuyasu Shiga , Kenichi Takizawa , Nicolas Chauvet , Ryoichi Horisaki , Makoto Naruse