English
Related papers

Related papers: Linear Capacity Scaling in Wireless Networks: Beyo…

200 papers

Energy efficiency in wireless networks has become an important field of research due to ever increasing energy expenditure in battery supplied mobile terminals. In this paper we present an energy efficient routing scheme for multi-standard…

Networking and Internet Architecture · Computer Science 2016-11-17 Riccardo Fedrizzi , Tinku Rasheed

Consider a wireless Gaussian network where a source wishes to communicate with a destination with the help of N full-duplex relay nodes. Most practical systems today route information from the source to the destination using the best path…

Information Theory · Computer Science 2017-11-06 Yahya H. Ezzeldin , Ayan Sengupta , Christina Fragouli

In multi-user wireless packet networks interference, typically modeled as packet collision, is the throughput bottleneck. Users become aware of the interference pattern via feedback and use this information for contention resolution and for…

Information Theory · Computer Science 2018-07-24 Alireza Vahid , Robert Calderbank

We develop bounds on the capacity of wireless networks when the traffic is non-uniform, i.e., not all nodes are required to receive and send similar volumes of traffic. Our results are asymptotic, i.e., they hold with probability going to…

Networking and Internet Architecture · Computer Science 2013-10-24 Stavros Toumpis

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

We consider the question of determining the scaling of the $n^2$-dimensional balanced unicast and the $n 2^n$-dimensional balanced multicast capacity regions of a wireless network with $n$ nodes placed uniformly at random in a square region…

Information Theory · Computer Science 2016-11-18 Urs Niesen , Piyush Gupta , Devavrat Shah

The wireless channel changes continuously with time and frequency and the block-fading assumption, which is popular in many theoretical analyses, never holds true in practical scenarios. This discrepancy is critical for user activity…

Information Theory · Computer Science 2024-10-23 Jianan Bai , Erik G. Larsson

This paper gives the approximate capacity region of a two-user MIMO interference channel with limited receiver cooperation, where the gap between the inner and outer bounds is in terms of the total number of receive antennas at the two…

Information Theory · Computer Science 2014-07-08 Mehdi Ashraphijuo , Vaneet Aggarwal , Xiaodong Wang

We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the…

Information Theory · Computer Science 2016-11-18 Jeffrey G. Andrews , Steven Weber , Marios Kountouris , Martin Haenggi

Interference limits performance in wireless networks, and cooperation among receivers or transmitters can help mitigate interference by forming distributed MIMO systems. Earlier work shows how limited receiver cooperation helps mitigate…

Information Theory · Computer Science 2010-05-03 I-Hsiang Wang , David N. C. Tse

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

The transport capacity of a dense ad hoc network with n nodes scales like \sqrt(n). We show that the transport capacity divided by \sqrt(n) approaches a non-random limit with probability one when the nodes are i.i.d. distributed on the unit…

Information Theory · Computer Science 2010-10-11 Radha Krishna Ganti , Martin Haenggi

Extensive research has been done on studying the capacity of wireless multi-hop networks. These efforts have led to many sophisticated and customized analytical studies on the capacity of particular networks. While most of the analyses are…

Networking and Internet Architecture · Computer Science 2016-11-17 Guoqiang Mao , Zihuai Lin , Xiaohu Ge , Yang Yang

Low-altitude airspace, roughly defined as the region up to 3000 meters above ground level, is envisioned as a new spatial domain for daily human and machine activities. This article introduces the concept of the Low-Altitude Wireless…

Networking and Internet Architecture · Computer Science 2026-05-26 Yuanhao Cui , Jiali Nie , Weijie Yuan , Fan Liu , Ziye Jia , Jie Xu , Zhiyong Feng , Mohamed-Slim Alouini

A framework is developed for analyzing capacity gains from user cooperation in slow fading wireless networks when the number of nodes (network size) is large. The framework is illustrated for the case of a simple multipath-rich Rayleigh…

Information Theory · Computer Science 2009-09-29 Ashish Khisti , Uri Erez , Gregory Wornell

The problem of determining asymptotic bounds on the capacity of a random ad hoc network is considered. Previous approaches assumed a threshold-based link layer model in which a packet transmission is successful if the SINR at the receiver…

Information Theory · Computer Science 2007-07-13 Vivek P. Mhatre , Catherine P. Rosenberg

The capacity of a fractal wireless network with direct social interactions is studied in this paper. Specifically, we mathematically formulate the self-similarity of a fractal wireless network by a power-law degree distribution $ P(k) $,…

Information Theory · Computer Science 2017-05-30 Ying Chen , Rongpeng Li , Zhifeng Zhao , Honggang Zhang

We consider the following basic link capacity (a.k.a., one-shot scheduling) problem in wireless networks: Given a set of communication links, find a maximum subset of links that can successfully transmit simultaneously. Good performance…

Information Theory · Computer Science 2017-06-19 Magnus M. Halldorsson , Tigran Tonoyan

This paper analyzes the impact and benefits of infrastructure support in improving the throughput scaling in networks of $n$ randomly located wireless nodes. The infrastructure uses multi-antenna base stations (BSs), in which the number of…

Information Theory · Computer Science 2016-11-18 Won-Yong Shin , Sang-Woon Jeon , Natasha Devroye , Mai H. Vu , Sae-Young Chung , Yong H. Lee , Vahid Tarokh

Interference is a major issue limiting the performance in wireless networks. Cooperation among receivers can help mitigate interference by forming distributed MIMO systems. The rate at which receivers cooperate, however, is limited in most…

Information Theory · Computer Science 2009-11-12 I-Hsiang Wang , David N. C. Tse