English
Related papers

Related papers: Optimal Tradeoff Between Exposed and Hidden Nodes …

200 papers

The discrepancy between the upper bound on throughput in wireless networks and the throughput scaling in random networks which is also known as the connectivity-throughput trade-off is analyzed. In a random network with $\lambda$ nodes per…

Information Theory · Computer Science 2010-08-23 Ralph Tanbourgi , Holger Jäkel , Friedrich K. Jondral

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

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

We consider a distributed edge computing scenario consisting of several wireless nodes that are located over an area of interest. Specifically, some of the "master" nodes are tasked to sense the environment (e.g., by acquiring images or…

Information Theory · Computer Science 2019-10-31 Erdem Koyuncu

In this paper, the optimal spectral efficiency (data rate divided by the message bandwidth) that minimizes the probability of causing disruptive interference for ad hoc wireless networks or cognitive radios is investigated. Two basic…

Information Theory · Computer Science 2015-03-18 Daniel W. Bliss , Siddhartan Govindasamy

In this paper, we investigate the fundamental tradeoff between communication and sensing performance of \emph{ad hoc} integrated sensing and communication (ISAC) wireless networks. Specifically, we consider that $n$ nodes are randomly…

Information Theory · Computer Science 2025-02-17 Min Qiu , Ming-Chun Lee , Yu-Chih Huang , Jinhong Yuan

Multi-access networks may exhibit severe unfairness in throughput. Recent studies show that this unfairness is due to local differences in the neighborhood structure: Nodes with less neighbors receive better access. We study the unfairness…

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

Consider a consensus-driven multi-agent dynamic system. The interaction range, which defines the set of neighbors for each agent, plays a key role in influencing connectivity of the underlying network. In this paper, we assume the system is…

Systems and Control · Electrical Eng. & Systems 2020-04-28 Saad J Saleh

In wireless local area networks, spatially varying channel conditions result in a severe performance discrepancy between different nodes in the uplink, depending on their position. Both throughput and energy expense are affected.…

Information Theory · Computer Science 2010-06-22 Georg Bocherer , Rudolf Mathar

We consider a fundamental problem concerning the deployment of a wireless robotic network: to fulfill various end-to-end performance requirements, a "sufficient" number of robotic relays must be deployed to ensure that links are of…

Robotics · Computer Science 2016-11-28 Pradipta Ghosh , Bhaskar Krishnamachari

A network of $n$ wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power $P$ or remain silent. The objective is to maximize the number of…

Information Theory · Computer Science 2007-10-30 Masoud Ebrahimi , Amir K. Khandani

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

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

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

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

We investigate the optimal carrier sensing threshold in random CSMA/CA networks considering the effect of binary exponential backoff. We propose an iterative algorithm for optimizing the carrier sensing threshold and hence maximizing the…

Information Theory · Computer Science 2013-12-23 Dong Min Kim , Seong-Lyun Kim

In this paper, we consider contention resolution on a multiple-access communication channel. In this problem, a set of nodes arrive over time, each with a message it intends to send. In each time slot, each node may attempt to broadcast its…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-02-22 Haimin Chen , Yonggang Jiang , Chaodong Zheng

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

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

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
‹ Prev 1 2 3 10 Next ›