English
Related papers

Related papers: Throughput Scaling Laws for Wireless Networks with…

200 papers

This paper studies the structure of downlink sum-rate maximizing selective decentralized feedback policies for opportunistic beamforming under finite feedback constraints on the average number of mobile users feeding back. Firstly, it is…

Information Theory · Computer Science 2011-07-26 Tharaka Samarasinghe , Hazer Inaltekin , Jamie S. Evans

We develop a general approach for designing scheduling policies for real-time traffic over wireless channels. We extend prior work, which characterizes a real-time flow by its traffic pattern, delay bound, timely-throughput requirement, and…

Networking and Internet Architecture · Computer Science 2009-08-06 I-Hong Hou , P. R. Kumar

We consider the wireless Rayleigh fading relay channel with finite complex input constellations. Assuming global knowledge of the channel state information and perfect synchronization, upper and lower bounds on the achievable rate, for the…

Information Theory · Computer Science 2011-02-22 Vijayvaradharaj T Muralidharan , B. Sundar Rajan

In this paper, we consider a multiple-access fading channel where $N$ users transmit to a single base station (BS) within a limited number of time slots. We assume that each user has a fixed amount of energy available to be consumed over…

Information Theory · Computer Science 2017-02-10 Antonious M. Girgis , Amr El-Keyi , Mohammed Nafie

The scaling laws of the achievable communication rates and the corresponding upper bounds of distributed reception in the presence of an interfering signal are investigated. The scheme includes one transmitter communicating to a remote…

Information Theory · Computer Science 2009-12-08 Amichai Sanderovich , Michael Peleg , Shlomo Shamai

We propose a novel data-driven approach to allocate transmit power for federated learning (FL) over interference-limited wireless networks. The proposed method is useful in challenging scenarios where the wireless channel is changing during…

Machine Learning · Computer Science 2023-12-14 Boning Li , Jake Perazzone , Ananthram Swami , Santiago Segarra

The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable attention in the last years. Many consensus algorithms have…

Distributed, Parallel, and Cluster Computing · Computer Science 2009-11-13 Gesualdo Scutari , Sergio Barbarossa

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

We study the throughput and delay characteristics of wireless caching networks, where users are mainly interested in retrieving content stored in the network, rather than in maintaining source-destination communication. Nodes are assumed to…

Networking and Internet Architecture · Computer Science 2017-04-25 Milad Mahdian , Edmund Yeh

Traditionally, the capacity region of a coherent fading multiple access channel (MAC) is analyzed in two popular contexts. In the first, a centralized system with full channel state information at the transmitters (CSIT) is assumed, and the…

Information Theory · Computer Science 2014-09-17 Sreejith Sreekumar , Bikash K. Dey , Sibi Raj B. Pillai

Compute-and-forward (CF) is a relaying strategy which allows the relay to decode a linear combination of the transmitted messages. This work studies the optimal power allocation problem for the CF scheme in fast fading channels for…

Information Theory · Computer Science 2024-11-18 Lanwei Zhang , Jamie Evans , Jingge Zhu

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 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

Future wireless standards such as 5G envision dense wireless networks with large number of simultaneously connected devices. In this context, interference management becomes critical in achieving high spectral efficiency. Orthogonal…

Information Theory · Computer Science 2015-04-14 Subhashini Krishnasamy , Urs Niesen , Piyush Gupta

A central problem in analog wireless sensor networks is to design the gain or phase-shifts of the sensor nodes (i.e. the relaying configuration) in order to achieve an accurate estimation of some parameter of interest at a fusion center, or…

Signal Processing · Electrical Eng. & Systems 2019-08-05 Shahin Khobahi , Mojtaba Soltanalian , Feng Jiang , A. Lee Swindlehurst

In this work, we consider a discrete-time stationary Rayleigh flat-fading channel with unknown channel state information at transmitter and receiver. The law of the channel is presumed to be known to the receiver. In addition, we assume the…

Information Theory · Computer Science 2011-03-03 Meik Dörpinghaus , Heinrich Meyr

We consider scheduling problems in wireless networks with respect to flexible data rates. That is, more or less data can be transmitted per time depending on the signal quality, which is determined by the signal-to-interference-plus-noise…

Networking and Internet Architecture · Computer Science 2012-05-08 Thomas Kesselheim

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

In this paper, we consider maximizing the sum-rate in the uplink of a multi-cell OFDMA network. The problem has a non-convex combinatorial structure and is known to be NP hard. Due to the inherent complexity of implementing the optimal…

Optimization and Control · Mathematics 2011-09-22 Hina Tabassum , Zaher Dawy , Mohamed Slim Alouini

Improving throughput for cell-edge users through coordinated resource allocation has been a long-standing driver of research in wireless cellular networks. While a variety of wireless resource management problems focus on sum utility,…

Information Theory · Computer Science 2024-03-26 Ahmad Ali Khan , Raviraj Adve
‹ Prev 1 3 4 5 6 7 10 Next ›