English
Related papers

Related papers: Towards Tight Bounds for Local Broadcasting

200 papers

Massive MIMO (Multiple-Input Multiple-Output) is a key enabler for 5G and future wireless systems, boosting channel capacity, energy efficiency, and spectral efficiency. However, high power consumption and hardware costs of…

Optimization and Control · Mathematics 2025-12-08 Jie Zhang , Huifu Xu

We study the information loss of a class of inference strategies that is solely based on time averaging. For an array of independent binary sensors (e.g., receptors, single electron transistors) measuring a weak random signal (e.g., ligand…

Statistical Mechanics · Physics 2016-10-25 David Hartich , Udo Seifert

In this paper we consider the problem of finding a maximum weight set subject to a $k$-extendible constraint in the data stream model. The only non-trivial algorithm known for this problem to date---to the best of our knowledge---is a…

Data Structures and Algorithms · Computer Science 2019-06-12 Moran Feldman , Ran Haba

Consider a wireless network of transmitter-receiver pairs where the transmitters adjust their powers to maintain a target SINR level in the presence of interference. In this paper, we analyze the optimal power vector that achieves this…

Information Theory · Computer Science 2014-01-16 Aris L. Moustakas , Panayotis Mertikopoulos , Nicholas Bambos

We consider the problem of data exchange by a group of closely-located wireless nodes. In this problem each node holds a set of packets and needs to obtain all the packets held by other nodes. Each of the nodes can broadcast the packets in…

Information Theory · Computer Science 2016-11-15 Salim El Rouayheb , Alex Sprintson , Parastoo Sadeghi

One of the oldest problems in the data stream model is to approximate the $p$-th moment $\|\mathcal{X}\|_p^p = \sum_{i=1}^n |\mathcal{X}_i|^p$ of an underlying vector $\mathcal{X} \in \mathbb{R}^n$, which is presented as a sequence of…

Data Structures and Algorithms · Computer Science 2019-07-15 Rajesh Jayaram , David P. Woodruff

Distance estimation is vital for localization and many other applications in wireless sensor networks (WSNs). Particularly, it is desirable to implement distance estimation as well as localization without using specific hardware in low-cost…

Signal Processing · Electrical Eng. & Systems 2018-01-30 Qing Miao , Baoqi Huang , Bing Jia

In this paper, we design an optimal sensor collaboration strategy among neighboring nodes while tracking a time-varying parameter using wireless sensor networks in the presence of imperfect communication channels. The sensor network is…

Signal Processing · Electrical Eng. & Systems 2018-07-04 Shan Zhang , Sijia Liu , Vinod Sharma , Pramod K. Varshney

We formulate and study the thinnest path problem in wireless ad hoc networks. The objective is to find a path from a source to its destination that results in the minimum number of nodes overhearing the message by a judicious choice of…

Networking and Internet Architecture · Computer Science 2013-08-08 Jianhang Gao , Qing Zhao , Ananthram Swami

Signal to Noise Ratio (SNR) is an important index for wireless communications. There are many methods for increasing SNR. In CDMA systems, spreading sequences are used. We consider the frequency-selective wide-sense-stationary…

Information Theory · Computer Science 2016-10-17 Hirofumi Tsuda , Ken Umeno

We study the problem of assigning transmission ranges to radio stations placed arbitrarily in a $d$-dimensional ($d$-D) Euclidean space in order to achieve a strongly connected communication network with minimum total power consumption. The…

Computational Geometry · Computer Science 2015-02-17 Paz Carmi , Lilach Chaitman-Yerushalmi

Previous work on network coding capacity for random wired and wireless networks have focused on the case where the capacities of links in the network are independent. In this paper, we consider a more realistic model, where wireless…

Information Theory · Computer Science 2008-11-11 Zhenning Kong , Salah A. Aly , Emina Soljanin , Edmund M. Yeh , Andreas Klappenecker

To achieve a good tradeoff between the consumed power and the harvested power, a robust resource optimization problem is studied in a multiple-input single-output cognitive radio network with simultaneous wireless information and power…

Information Theory · Computer Science 2018-06-26 Xiongjian Zhang , Yuhao Wang , Fuhui Zhou , Naofal Al-Dhahir , Xiaohua Deng

In multi-user communication from one base station (BS) to multiple users, the problem of minimizing the transmit power to achieve some target guaranteed performance (rates) at users has been well investigated in the literature. Similarly…

Information Theory · Computer Science 2015-03-17 Umer Salim , Dirk Slock

This work considers a system with two energy harvesting (EH) nodes transmitting to a common destination over a random access channel. The amount of harvested energy is assumed to be random and independent over time, but correlated among the…

Performance · Computer Science 2019-02-14 Mehdi Salehi Heydar Abad , Deniz Gunduz , Ozgur Ercetin

Local Fourier analysis is a useful tool for predicting and analyzing the performance of many efficient algorithms for the solution of discretized PDEs, such as multigrid and domain decomposition methods. The crucial aspect of local Fourier…

Optimization and Control · Mathematics 2020-07-29 Jed Brown , Yunhui He , Scott MacLachlan , Matt Menickelly , Stefan M. Wild

Given a set ${\cal V}$ of $n$ sensor node distributed on a 2-dimensional plane and a source node $s \in {\cal V}$, the {\it interference problem} deals with assigning transmission range to each $v \in {\cal V}$ such that the members in…

Networking and Internet Architecture · Computer Science 2012-07-25 Pragya Agrawal , Gautam K. Das

The rate optimization for wireless networks with low SNR is investigated. While the capacity in the limit of disappearing SNR is known to be linear for fading and non-fading channels, we study the problem of operating in low SNR wireless…

Information Theory · Computer Science 2010-08-03 Mohit Thakur , Muriel Médard

Wireless sensor networks consisting of great number of cheap and tiny sensor nodes which are used for military environment controlling, natural events recording, traffic monitoring, robot navigation, and etc. Such a networks encounter with…

Networking and Internet Architecture · Computer Science 2011-11-23 Marida Dossena

In this paper, a lower bound on the capacity of wireless ad hoc erasure networks is derived in closed form in the canonical case where $n$ nodes are uniformly and independently distributed in the unit area square. The bound holds almost…

Information Theory · Computer Science 2009-01-15 Rayyan G. Jaber , Jeffrey G. Andrews