Related papers: Modelling simultaneous broadcasting by level-disjo…
We propose an algorithm for distributed optimization over time-varying communication networks. Our algorithm uses an optimized ratio between the number of rounds of communication and gradient evaluations to achieve fast convergence. The…
We consider message and time efficient broadcasting and multi-broadcasting in wireless ad-hoc networks, where a subset of nodes, each with a unique rumor, wish to broadcast their rumors to all destinations while minimizing the total number…
Probabilistic message-passing algorithms are developed for routing transmissions in multi-wavelength optical communication networks, under node and edge-disjoint routing constraints and for various objective functions. Global routing…
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…
Information-theoretic arguments focus on modeling the reliability of information transmission, assuming availability of infinite data at sources, thus ignoring randomness in message generation times at the respective sources. However, in…
In this work, a relay channel is studied in which a source encoder communicates with a destination decoder through a number of out-of-band relays that are connected to the decoder through capacity-constrained digital backhaul links. This…
In this paper, the problem of distributed opportunistic channel access in wireless relaying is investigated. A relay network with multiple source-destination pairs and multiple relays is considered. All the source nodes contend through a…
Federated learning has emerged as a privacy-preserving technique for collaborative model training across heterogeneously distributed silos. Yet, its reliance on a single central server introduces potential bottlenecks and risks of…
In this paper, a two-hop network in which information is transmitted from a source via a relay to a destination is considered. It is assumed that the channels are static fading with additive white Gaussian noise. All nodes are equipped with…
Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfying approximation ratios, and those that guarantee high quality ratios but are slow. In this paper we prove that…
When several wireless users are sharing the spectrum, packet collision is a simple, yet widely used model for interference. Under this model, when transmitters cause interference at any of the receivers, their collided packets are discarded…
We study private broadcasting of two messages to two groups of receivers over independent parallel channels. One group consists of an arbitrary number of receivers interested in a common message, whereas the other group has only one…
This paper explores the distributed broadcast problem within the context of network communications, a critical challenge in decentralized information dissemination. We put forth a novel hypergraph-based approach to address this issue,…
Optimizing embedded systems, where the optimization of one depends on the state of another, is a formidable computational and algorithmic challenge, that is ubiquitous in real world systems. We study flow networks, where bilevel…
We study the energy performance of random linear network coding for time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data…
A communication setup is considered where a transmitter wishes to convey a message to a receiver and simultaneously estimates the state of that receiver through a common waveform. The state is estimated at the transmitter by means of…
The number of spanning trees in a graph $G$ is the total number of distinct spanning subgraphs of $G$ that are trees. In this paper we characterize the unique graph with a prescribed vertex (resp. edge) connectivity, minimum degree and…
Large data sets often require performing distributed statistical estimation, with a full data set split across multiple machines and limited communication between machines. To study such scenarios, we define and study some refinements of…
A number of stations, independently activated over time, is able to communicate by transmitting and listening to a shared channel in discrete time slots, and a message is successfully delivered to all stations if and only if its source…
The fundamental limit of Semantic Communications (joint source-channel coding) is established when the transmission needs to be kept covert from an external warden. We derive information-theoretic achievability and matching converse results…