English
Related papers

Related papers: To Achieve Maximal Throughputs in CSMA Wireless Ne…

200 papers

Wireless local area networks (WLAN) still suffer from a severe performance discrepancy between different users in the uplink. This is because of the spatially varying channel conditions provided by the wireless medium. Cooperative medium…

Information Theory · Computer Science 2009-11-04 Georg Böcherer

In this paper, we consider a wireless powered multi-relay network in which a multi-antenna hybrid access point underlaying a cellular system transmits information to distant receivers. Multiple relays capable of energy harvesting are…

Information Theory · Computer Science 2018-10-23 Jing Xu , Yuze Zou , Shimin Gong , Lin Gao , Dusit Niyato , Wenqing Cheng

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

Future wireless networks are envisioned to integrate multi-hop, multi-operator, multi-technology (m3) components in order to meet the increasing traffic demand at an acceptable price for subscribers. The performance of such a network…

Networking and Internet Architecture · Computer Science 2016-12-19 Beatriz Lorenzo , Savo Glisic

Multi-connectivity is emerging as promising solution to provide reliable communications and seamless connectivity at the millimeter-wave frequency range. Due to the obstacles that cause frequent interruptions at such high frequency range,…

Networking and Internet Architecture · Computer Science 2018-12-18 Cristian Tatino , Ilaria Malanchini , Nikolaos Pappas , Di Yuan

A well-known expression for the saturation throughput of heterogeneous transmitting nodes in a wireless network using p-CSMA, derived from Renewal Theory, implicitly assumes that all transmitting nodes are in range of, and therefore…

Networking and Internet Architecture · Computer Science 2025-10-27 Faezeh Dehghan Tarzjani , Bhaskar Krishnamachari

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

This work addresses the problem of evaluating optimal link capacities of a packet-flow network for the objective of congestion minimization. We present a simple model of packet flow in networks and present a numerical approach to evaluate…

Networking and Internet Architecture · Computer Science 2020-02-10 Saptarshi Pal , Ayan Chatterjee , Dripto Bakshi , Amitava Mukherjee

Link adaptation is the terminology used to describe techniques that improve multicarrier communication systems performance by dynamically adapting the transmission parameters, i.e., transmit power and number of bits per subcarrier, to the…

Information Theory · Computer Science 2018-01-17 Ebrahim Bedeer

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

Recent work has shown that adaptive CSMA algorithms can achieve throughput optimality. However, these adaptive CSMA algorithms assume a rather simplistic model for the wireless medium. Specifically, the interference is typically modelled by…

Networking and Internet Architecture · Computer Science 2015-04-30 Peruru Subrahmanya Swamy , Radha Krishna Ganti , Krishna Jagannathan

This paper proposes a new protocol called Optimal DCF (O-DCF). Inspired by a sequence of analytic results, O-DCF modifies the rule of adapting CSMA parameters, such as backoff time and transmission length, based on a function of the…

Networking and Internet Architecture · Computer Science 2012-07-17 Jinsung Lee , Yung Yi , Song Chong , Bruno Nardelli , Edward W. Knightly , Mung Chiang

Modern networks exhibit a high degree of variability in link rates. Cellular network bandwidth inherently varies with receiver motion and orientation, while class-based packet scheduling in datacenter and service provider networks induces…

Networking and Internet Architecture · Computer Science 2022-02-10 Prateesh Goyal , Mohammad Alizadeh , Thomas E. Anderson

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

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

We consider wireless mesh networks and the problem of scheduling the links of a given set of routes under the assumption of a heavy-traffic pattern. We assume some TDMA protocol provides a background of synchronized time slots and seek to…

Networking and Internet Architecture · Computer Science 2012-03-12 Fabio R. J. Vieira , José F. de Rezende , Valmir C. Barbosa , Serge Fdida

We consider scheduling problems in wireless networks with respect to flexible data rates. That is, more or less data can be transmitted per time depending on the signal quality, which is determined by the signal-to-interference-plus-noise…

Networking and Internet Architecture · Computer Science 2012-05-08 Thomas Kesselheim

This paper is focused on the problem of optimizing the aggregate throughput of the Distributed Coordination Function (DCF) employing the basic access mechanism at the data link layer of IEEE 802.11 protocols. In order to broaden the…

Networking and Internet Architecture · Computer Science 2008-12-18 Massimiliano Laddomada , Fabio Mesiti

This paper concerns sub-channel allocation in multi-user wireless networks with a view to increasing the network throughput. It is assumed there are some sub-channels to be equally divided among active links, such that the total sum rate…

Information Theory · Computer Science 2016-01-21 Mohammadreza Darabi , Amin Roustaei

This paper has been withdrawn because of some paper issues. Recent studies on MAC scheduling have shown that carrier sense multiple access (CSMA) can be controlled to be achieve optimality in terms of throughput or utility. These results…

Networking and Internet Architecture · Computer Science 2012-12-18 Se-Young Yun , Jinwoo Shin , Yung Yi