Related papers: Which Broadcast Abstraction Captures $k$-Set Agree…
All to all broadcast is a collective communication in a network with the constraint that every node must send to each other certain piece of its data. This paper addresses the problem of optimal all port all to all broadcast in…
We study the distributed average consensus problem in multi-agent systems with directed communication links that are subject to quantized information flow. The goal of distributed average consensus is for the nodes, each associated with…
This paper presents generalized channel coding theorems for a time-slotted distributed communication system where a transmitter-receiver pair is communicating in parallel with other transmitters. Assume that the channel code of each…
We consider wireless networks operating under the SINR model of interference. Nodes have limited individual knowledge and capabilities: they do not know their positions in a coordinate system in the plane, further they do not know their…
We consider a wireless network with a base station broadcasting and collecting time-sensitive data to and from spatially distributed nodes in the presence of wireless interference. The Age of Information (AoI) is the time that has elapsed…
This paper re-visits a multi-agent deployment problem where agents are restricted from requesting information from other agents as well as sending acknowledgments when information is received. These communication constraints relax the…
The bursting aggregation assembly in edge nodes is one of the key technologies in OBS (Optical Burst Switching) network, which has a direct impact on flow characteristics and packet loss rate. An optical burst assembly technique supporting…
In this work we look at Byzantine consensus in asynchronous systems under the local broadcast model. In the local broadcast model, a message sent by any node is received identically by all of its neighbors in the communication network,…
This work considers the problem of mitigating information leakage between communication and sensing in systems jointly performing both operations. Specifically, a discrete memoryless state-dependent broadcast channel model is studied in…
We study the compound multi-input multi-output (MIMO) broadcast channel with confidential messages (BCC), where one transmitter sends a common message to two receivers and two confidential messages respectively to each receiver. The channel…
Biological systems, particularly the human brain, achieve remarkable energy efficiency by abstracting information across multiple hierarchical levels. In contrast, modern artificial intelligence and communication systems often consume…
Implementations of Broadcast based on some information dissemination algorithm -- e.g., gossip or tree-based communication -- followed by a correction algorithm has been proposed previously. This work describes an approach to apply a…
There is a fundamental trade-off between the communication cost and latency in information aggregation. Aggregating multiple communication messages over time can alleviate overhead and improve energy efficiency on one hand, but inevitably…
A k-order coverage control problem is studied where a network of agents must deploy over a desired area. The objective is to deploy all the agents in a decentralized manner such that a certain coverage performance metric of the network is…
This paper focuses on $ K $-receiver discrete-time memoryless broadcast channels (DM-BCs) with private messages, where the transmitter wishes to convey $K$ private messages to $K$ receivers respectively. A general inner bound on the…
We propose a distributed control strategy to allow the control of a multi-agent system requiring k-hop interactions based on the design of distributed state and input observers. In particular, we design for each agent a finite time…
The two-user computation broadcast problem is introduced as the setting where User $1$ wants message $W_1$ and has side-information $W_1'$, User $2$ wants message $W_2$ and has side-information $W_2'$, and $(W_1, W_1', W_2, W_2')$ may have…
We consider a basic communication and sensing setup comprising a transmitter, a receiver and a sensor. The transmitter sends an encoded sequence to the receiver through a discrete memoryless channel, and the receiver is interested in…
The problem of communication and state estimation is considered in the context of channels with actiondependent states. Given the message to be communicated, the transmitter chooses an action sequence that affects the formation of the…
We consider the problem of broadcast with common messages, and focus on the case that the common message rate $R_{\mathcal{A}}$, i.e., the rate of the message intended for all the receivers in the set $\mathcal{A}$, is the same for all the…