English
Related papers

Related papers: Computing the Saturation Throughput for Heterogene…

200 papers

The performance analysis of wireless CSMA networks is notoriously difficult due to the intricate sensing and interference relationships among links. Even the fundamental problem of throughput characterization remains open when sensing and…

Networking and Internet Architecture · Computer Science 2026-04-15 Xinghua Sun , Wenhai Lin , Ruike Zhou

The p-persistent CSMA protocol is central to random-access MAC analysis, but predicting saturation throughput in heterogeneous multi-hop wireless networks remains a hard problem. Simplified models that assume a single, shared interference…

Machine Learning · Computer Science 2025-10-29 Faezeh Dehghan Tarzjani , Bhaskar Krishnamachari

We analytically study a carrier sense multiple access (CSMA)-based network. In the network, the nodes have their own average throughput demands for transmission to a common base station. The CSMA is based on the request-to-send…

Computer Science and Game Theory · Computer Science 2015-03-13 Fu-Te Hsu , Hsuan-Jung Su

It was shown recently that CSMA (Carrier Sense Multiple Access)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing networks) under certain assumptions. One important, but idealized…

Networking and Internet Architecture · Computer Science 2016-11-18 Libin Jiang , Jean Walrand

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

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é

This paper derives a lower bound to the per-node throughput achievable by a wireless network when n source-destination pairs are randomly distributed throughout a disk of radius $n^\gamma$, $ \gamma \geq 0$, propagation is modeled by…

Information Theory · Computer Science 2007-08-01 Enrique J. Duarte-Melo , Awlok Josan , Mingyan Liu , David L. Neuhoff , Sandeep Pradhan

Wireless charging is a promising way to power wireless nodes' transmissions. This paper considers new dual-function access points (APs) which are able to support the energy/information transmission to/from wireless nodes. We focus on a…

Information Theory · Computer Science 2016-11-18 Yue Ling Che , Lingjie Duan , Rui Zhang

This paper proposes an approximate method, equivalent access intensity (EAI), for the throughput analysis of CSMA wireless networks in which links have finite offered-load and their MAC-layer transmit buffers may be empty from time to time.…

Networking and Internet Architecture · Computer Science 2013-02-20 Caihong Kai , Shengli Zhang

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

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 analytically analyzed the impact of an error-prone channel over all performance measures in a trafficsaturated IEEE 802.11 WLAN. We calculated station's transmission probability by using the modified Markov chain model of…

Networking and Internet Architecture · Computer Science 2010-05-18 Zoran Hadzi-Velkov , Boris Spasenovski

This paper analyzes the saturation throughput of a cognitive single hop WLAN overlaid on a primary IEEE 802.16e TDD WiMAX network. After the contention among the secondary nodes, the winner node transmits its data packet in the empty slots…

Networking and Internet Architecture · Computer Science 2014-10-06 Parisa Rahimzadeh , Farid Ashtiani

It is well known that links in CSMA wireless networks are prone to starvation. Prior works focused almost exclusively on equilibrium starvation. In this paper, we show that links in CSMA wireless networks are also susceptible to temporal…

Networking and Internet Architecture · Computer Science 2010-09-20 Cai Hong Kai , Soung Chang Liew

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

In the literature, asymptotic studies of multi-hop wireless network capacity often consider only centralized and deterministic TDMA (time-division multi-access) coordination schemes. There have been fewer studies of the asymptotic capacity…

Networking and Internet Architecture · Computer Science 2017-09-25 Chi-Kin Chau , Minghua Chen , Soung Chang Liew

CSMA (Carrier Sense Multiple Access), which resolves contentions over wireless networks in a fully distributed fashion, has recently gained a lot of attentions since it has been proved that appropriate control of CSMA parameters guarantees…

Networking and Internet Architecture · Computer Science 2015-01-16 Se-Young Yun , Jinwoo Shin , Yung Yi

In many wireless systems, interference is the main performance-limiting factor, and is primarily dictated by the locations of concurrent transmitters. In many earlier works, the locations of the transmitters is often modeled as a Poisson…

Information Theory · Computer Science 2016-11-17 Radha Krishna Ganti , Jeffrey G. Andrews , Martin Haenggi

We consider a stylized stochastic model for a wireless CSMA network. Experimental results in prior studies indicate that the model provides remarkably accurate throughput estimates for IEEE 802.11 systems. In particular, the model offers an…

Probability · Mathematics 2012-09-14 Alessandro Zocca , Sem C. Borst , Johan S. H. van Leeuwaarden

This paper surveys and unifies a number of recent contributions that have collectively developed a metric for decentralized wireless network analysis known as transmission capacity. Although it is notoriously difficult to derive general…

Information Theory · Computer Science 2016-11-17 Steven Weber , Jeffrey G. Andrews , Nihar Jindal
‹ Prev 1 2 3 10 Next ›