English
Related papers

Related papers: On Spatial Capacity of Wireless Ad Hoc Networks wi…

200 papers

This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fraction of packets must be transmitted before the end of the deadline.…

Networking and Internet Architecture · Computer Science 2010-07-12 Juan Jose Jaramillo , R. Srikant , Lei Ying

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

This paper investigates a multi-antenna cache-enabled network with interference nulling (IN) employed at base stations. Two IN schemes, namely, the fixed IN scheme and the flexible IN scheme are considered to improve the received…

Information Theory · Computer Science 2024-03-05 Tianming Feng , Chenyu Wu , Xiaodong Zheng , Peilin Chen , Yilong Liu , Shuai Han

In this paper the problem of scheduling with power control in wireless networks is studied: given a set of communication requests, one needs to assign the powers of the network nodes, and schedule the transmissions so that they can be done…

Networking and Internet Architecture · Computer Science 2015-05-20 Tigran Tonoyan

In this paper, we consider the problem of link scheduling in multi-hop wireless networks under general interference constraints. Our goal is to design scheduling schemes that do not use per-flow or per-destination information, maintain a…

Networking and Internet Architecture · Computer Science 2012-06-14 Bo Ji , Changhee Joo , Ness B. Shroff

In recent work, Ozgur, Leveque, and Tse (2007) obtained a complete scaling characterization of throughput scaling for random extended wireless networks (i.e., $n$ nodes are placed uniformly at random in a square region of area $n$). They…

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

We consider an ad hoc network in which each multi-antenna transmitter sends independent streams to multiple receivers in a Poisson field of interferers. We provide the outage probability and transmission capacity scaling laws, aiming at…

Information Theory · Computer Science 2009-01-19 Marios Kountouris , Jeffrey G. Andrews

Capacity scaling of a large hybrid network with unit node density, consisting of $n$ wireless ad hoc nodes, base stations (BSs) equipped with multiple antennas, and one remote central processor (RCP), is analyzed when wired backhaul links…

Information Theory · Computer Science 2014-07-29 Cheol Jeong , Won-Yong Shin

This work analyzes the gains of cooperative relaying in interference-limited networks, in which outages can be due to interference and fading. A stochastic model based on point process theory is used to capture the spatial randomness…

Information Theory · Computer Science 2016-11-17 Ralph Tanbourgi , Holger Jäkel , Friedrich K. Jondral

We consider the problem of distributed admission control without knowledge of the capacity region in single-hop wireless networks, for flows that require a pre-specified bandwidth from the network. We present an optimization framework that…

Networking and Internet Architecture · Computer Science 2013-01-16 Juan Jose Jaramillo , Lei Ying

Earlier definitions of capacity for wireless networks, e.g., transport or transmission capacity, for which exact theoretical results are known, are well suited for ad hoc networks but are not directly applicable for cellular wireless…

Information Theory · Computer Science 2017-04-19 Rahul Vaze , Srikanth Iyer

Imposing fairness in resource allocation incurs a loss of system throughput, known as the Price of Fairness ($PoF$). In wireless scheduling, $PoF$ increases when serving users with very poor channel quality because the scheduler wastes…

Networking and Internet Architecture · Computer Science 2018-01-08 Apostolos Destounis , Georgios S. Paschos , David Gesbert

In this paper we consider prioritized maximal scheduling in multi-hop wireless networks, where the scheduler chooses a maximal independent set greedily according to a sequence specified by certain priorities. We show that if the probability…

Information Theory · Computer Science 2009-01-20 Qiao Li , Rohit Negi

This paper addresses the following question, which is of interest in the design and deployment of a multiuser decentralized network. Given a total system bandwidth of W Hz and a fixed data rate constraint of R bps for each transmission, how…

Information Theory · Computer Science 2007-07-13 Nihar Jindal , Jeffrey Andrews , Steven Weber

In this paper we develop scheduling policies that maximize the stability region of a wireless network under the assumption that mutual information accumulation is implemented at the physical layer. When the link quality between nodes is not…

Information Theory · Computer Science 2012-07-17 Jing Yang , Yanpei Liu , Stark C. Draper

The link scheduling in wireless multi-hop networks is addressed. Different from most of work that adopt the protocol interference model which merely take consideration of packet collisions, our proposed algorithms use the physical…

Networking and Internet Architecture · Computer Science 2009-10-28 Shuai Fan , Lin Zhang , Yong Ren

To improve signal-to-interference ratio (SIR) and make better use of file diversity provided by random caching, we consider two types of linear receivers, i.e., maximal ratio combining (MRC) receiver and partial zero forcing (PZF) receiver,…

Information Theory · Computer Science 2018-01-10 Dongdong Jiang , Ying Cui

This paper presents a stochastic geometry model for the investigation of fundamental information theoretic limitations in wireless networks. We derive a new unified multi-parameter cut-set bound on the capacity of networks of arbitrary…

Information Theory · Computer Science 2013-05-02 Georgios Rodolakis

In modern wireless networks, interference is no longer negligible since each cell becomes smaller to support high throughput. The reduced size of each cell forces to install many cells, and consequently causes to increase inter-cell…

Information Theory · Computer Science 2012-09-19 Hyukjoon Kwon , Jungwon Lee , Inyup Kang

Reconfigurable intelligent surface (RIS) is promising for future 6G wireless communications. However, the increased number of RIS elements results in the high overhead for channel acquisition and the non-negligible power consumption.…

Information Theory · Computer Science 2023-01-16 Ruochen Su , Linglong Dai , Jingbo Tan , Mo Hao , Richard MacKenzie