English
Related papers

Related papers: Throughput Scaling Laws for Wireless Networks with…

200 papers

Two mobile users communicate with a central decoder via two base stations. Communication between the mobile users and the base stations takes place over a Gaussian interference channel with constant channel gains or quasi-static fading.…

Information Theory · Computer Science 2013-01-30 Roy Karasik , Osvaldo Simeone , Shlomo Shamai

In this work, for the first time, we tackle channel estimation design with pilots in the context of covert wireless communication. Specifically, we consider Rayleigh fading for the communication channel from a transmitter to a receiver and…

Information Theory · Computer Science 2019-08-02 Tingzhen Xu , Linlin Sun , Shihao Yan , Jinsong Hu , Feng Shu

We characterize the maximum achievable broadcast rate in a wireless network under various fading assumptions. Our result exhibits a duality between the performance achieved in this context by collaborative beamforming strategies and the…

Information Theory · Computer Science 2016-01-26 Serj Haddad , Olivier Leveque

The characteristics of wireless communication channels may vary with time due to fading, environmental changes and movement of mobile wireless devices. Tracking and estimating channel gains of wireless channels is therefore a fundamentally…

Networking and Internet Architecture · Computer Science 2010-08-17 Hongyi Yao , Xiaohang Li , Soung Chang Liew

In wireless networks, communication links may be subject to random fatal impacts: for example, sensor networks under sudden power losses or cognitive radio networks with unpredictable primary user spectrum occupancy. Under such…

Information Theory · Computer Science 2016-11-15 Meng Zeng , Rui Zhang , Shuguang Cui

The throughput of a linear cellular uplink with a random number of users, different power control schemes, and cooperative base stations is considered in the large system limit where the number of cells is large for non fading Gaussian…

Information Theory · Computer Science 2016-11-18 Oren Somekh , Osvaldo Simeone , H. Vincent Poor , Shlomo Shamai

We consider a data aggregating wireless network where all nodes have data to send to a single destination node, the sink. We consider a linear placement of nodes with the sink at one end. The nodes communicate directly to the sink (single…

Networking and Internet Architecture · Computer Science 2013-02-14 Easwar Vivek Mangipudi , Venkatesh Ramaiyan , Srikrishna Bhashyam

In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, the node locations are assumed to form a Poisson clustered…

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

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

This paper examines the problem of rate allocation for multicasting over slow Rayleigh fading channels using network coding. In the proposed model, the network is treated as a collection of Rayleigh fading multiple access channels. In this…

Networking and Internet Architecture · Computer Science 2014-03-27 Avi Zanko , Amir Leshem , Ephraim Zehavi

Driven by new types of wireless devices and the proliferation of bandwidth-intensive applications, data traffic and the corresponding network load are increasing dramatically. Network densification has been recognized as a promising and…

Networking and Internet Architecture · Computer Science 2016-03-01 Van Minh Nguyen , Marios Kountouris

This paper studies optimum power control and sum-rate scaling laws for the distributed cognitive uplink. It is first shown that the optimum distributed power control policy is in the form of a threshold based water-filling power control.…

Information Theory · Computer Science 2013-04-09 Ehsan Nekouei , Hazer Inaltekin , Subhrakanti Dey

A cross-layer design along with an optimal resource allocation framework is formulated for wireless fading networks, where the nodes are allowed to perform network coding. The aim is to jointly optimize end-to-end transport layer rates,…

Networking and Internet Architecture · Computer Science 2011-05-06 Ketan Rajawat , Nikolaos Gatsis , Georgios B. Giannakis

This paper investigates point-to-point information transmission over a wideband slow-fading channel, modeled as an (asymptotically) large number of independent identically distributed parallel channels, with the random channel fading…

Information Theory · Computer Science 2007-11-29 Wenyi Zhang , Urbashi Mitra

The fading wire-tap channel is investigated, where the source-to-destination channel and the source-to-wire-tapper channel are corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel…

Information Theory · Computer Science 2007-08-22 Yingbin Liang , H. Vincent Poor

A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. We consider the the path-loss plus fading model of wireless signal…

Information Theory · Computer Science 2012-05-23 Rahul Vaze

Although the performance of the medium access control (MAC) of the IEEE 802.15.4 has been investigated under the assumption of ideal wireless channel, the understanding of the cross-layer dynamics between MAC and physical layer is an open…

Networking and Internet Architecture · Computer Science 2013-07-25 Piergiuseppe Di Marco , Carlo Fischione , Fortunato Santucci , Karl Henrik Johansson

In recent years, the application of artificial intelligence (AI) in wireless communications has demonstrated inherent robustness against wireless channel distortions. Most existing works empirically leverage this robustness to yield…

Information Theory · Computer Science 2025-07-09 Yangshuo He , Guanding Yu , Huaiyu Dai

We present an achievable rate for general deterministic relay networks, with broadcasting at the transmitters and interference at the receivers. In particular we show that if the optimizing distribution for the information-theoretic cut-set…

Information Theory · Computer Science 2007-10-24 A. S. Avestimehr , S. N. Diggavi , D. N. C. Tse

We consider the problem of rate and power allocation in a fading multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a utility function defined over average transmission rates. In contrast…

Information Theory · Computer Science 2008-10-08 Ali ParandehGheibi , Atilla Eryilmaz , Asuman Ozdaglar , Muriel Medard
‹ Prev 1 3 4 5 6 7 10 Next ›