Related papers: Rate and power allocation under the pairwise distr…
We investigate resource allocation for quantum entanglement distribution over an optical network. We characterize and model a network architecture that employs a single broadband quasi-deterministic time-frequency heralded…
In this paper we consider the problem of transmission power allocation for remote estimation of a dynamical system in the case where the estimator is able to simultaneously receive packets from multiple interfering sensors, as it is…
Given a limited number of entries from the superposition of a low-rank matrix plus the product of a known fat compression matrix times a sparse matrix, recovery of the low-rank and sparse components is a fundamental task subsuming…
In a cost sharing problem on a weighted undirected graph, all other nodes want to connect to the source node for some service. Each edge has a cost denoted by a weight and all the connected nodes should share the total cost for the…
Minimum power required to achieve a distortion-noise profile, i.e., a function indicating the maximum allowed distortion value for each noise level, is studied for the transmission of Gaussian sources over Gaussian channels under a regime…
This paper studies an important rate allocation problem that arises in many networked and distributed systems: steady-state traffic rate allocation from multiple sources to multiple service nodes when both (i) the access-path delay on each…
Consider the problem of joint uplink scheduling and power allocation. Being inherent to almost any wireless system, this resource allocation problem has received extensive attention. Yet, most common techniques either adopt classical power…
In this paper, we investigate optimal resource allocation in a power beacon-assisted wireless-powered communication network (PB-WPCN), which consists of a set of hybrid access point (AP)-source pairs and a power beacon (PB). Each source,…
We study multi-hop broadcast in wireless networks with one source node and multiple receiving nodes. The message flow from the source to the receivers can be modeled as a tree-graph, called broadcast-tree. The problem of finding the…
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…
Consider a lossy compression system with $\ell$ distributed encoders and a centralized decoder. Each encoder compresses its observed source and forwards the compressed data to the decoder for joint reconstruction of the target signals under…
In this paper, we study the resource allocation and user scheduling problem for a downlink nonorthogonal multiple access network where the base station allocates spectrum and power resources to a set of users. We aim to jointly optimize the…
We consider the optimal transmission of distributed correlated discrete memoryless sources across a network with capacity constraints. We present several previously undiscussed structural properties of the set of feasible rates and…
We focus on a particular form of network coding, reverse carpooling, in a wireless network where the potentially coded transmitted messages are to be decoded immediately upon reception. The network is fixed and known, and the system…
In this paper, tight upper and lower bounds are derived on the weighted sum of minimum mean-squared errors for additive Gaussian noise channels. The bounds are obtained by constraining the input distribution to be close to a Gaussian…
Autonomous robot networks are an effective tool for monitoring large-scale environmental fields. This paper proposes distributed control strategies for localizing the source of a noisy signal, which could represent a physical quantity of…
We study the distributed minimum spanning tree (MST) problem, a fundamental problem in distributed computing. It is well-known that distributed MST can be solved in $\tilde{O}(D+\sqrt{n})$ rounds in the standard CONGEST model (where $n$ is…
In distributed wireless networks, nodes often do not know the topology (network size, connectivity and the channel gains) of the network. Thus, they have to compute their transmission and reception parameters in a distributed fashion. In…
This paper proposes a novel low complexity joint bit and power suboptimal allocation algorithm for multicarrier systems operating in fading environments. The algorithm jointly maximizes the throughput and minimizes the transmitted power,…
A power constrained sensor network that consists of multiple sensor nodes and a fusion center (FC) is considered, where the goal is to estimate a random parameter of interest. In contrast to the distributed framework, the sensor nodes may…