Related papers: Fast Structuring of Radio Networks for Multi-Messa…
We study random linear network coding for broadcasting in time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data packets…
We consider the problem of scheduling communication on optical WDM (wavelength division multiplexing) networks using the light-trails technology. We seek to design scheduling algorithms such that the given transmission requests can be…
This paper seeks to address the question of designing distributed algorithms for the setting of compact memory i.e. sublinear bits working memory for arbitrary connected networks. The nodes in our networks may have much lower internal…
This paper considers the joint transceiver design for downlink multiuser multiple-input single-output (MISO) systems with coordinated base stations (BSs) where imperfect channel state information (CSI) is available at the BSs and mobile…
Decentralized optimization methods enable on-device training of machine learning models without a central coordinator. In many scenarios communication between devices is energy demanding and time consuming and forms the bottleneck of the…
In the Telephone Broadcast problem we are given a graph $G=(V,E)$ with a designated source vertex $s\in V$. Our goal is to transmit a message, which is initially known only to $s$, to all vertices of the graph by using a process where in…
In cell-free multiple input multiple output (MIMO) networks, multiple base stations (BSs) collaborate to achieve high spectral efficiency. Nevertheless, high penetration loss due to large blockages in harsh propagation environments is often…
The best known solutions for $k$-message broadcast in dynamic networks of size $n$ require $\Omega(nk)$ rounds. In this paper, we see if these bounds can be improved by smoothed analysis. We study perhaps the most natural randomized…
As the use of wireless sensor networks increases, the need for efficient and reliable broadcasting algorithms grows. Ideally, a broadcasting algorithm should have the ability to quickly disseminate data, while keeping the number of…
A novel Rateless-coding-assisted Multi-Packet Relaying (RMPR) protocol is proposed for large-size data spreading in mobile wireless networks. With this lightweight and robust protocol, the packet redundancy is reduced by a factor of $\sqrt…
We present Broadcast by Balanced Saturation (BBS), a general broadcast algorithm designed to optimize communication efficiency across diverse network topologies. BBS maximizes node utilization, addressing challenges in broadcast operations…
We present an algorithm that, with high probability, generates a random spanning tree from an edge-weighted undirected graph in $\tilde{O}(n^{4/3}m^{1/2}+n^{2})$ time (The $\tilde{O}(\cdot)$ notation hides $\operatorname{polylog}(n)$…
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 study gossip algorithms for the rumor spreading problem which asks each node to deliver a rumor to all nodes in an unknown network. Gossip algorithms allow nodes only to call one neighbor per round and have recently attracted attention…
Inspired by recent developments in various areas of science relevant to quantum computing, we introduce quantum manifold optimization (QMO) as a promising framework for solving constrained optimization problems in next-generation wireless…
User scheduling and beamforming design are two crucial yet coupled topics for wireless communication systems. They are usually optimized separately with conventional optimization methods. In this paper, a novel cross-layer optimization…
As an enhanced version of massive machine-type communication in 5G, massive communication has emerged as one of the six usage scenarios anticipated for 6G, owing to its potential in industrial internet-of-things and smart metering. Driven…
The future mobile network has the complex mission of distributing available radio resources among various applications with different requirements. The radio access network slicing enables the creation of different logical networks by…
Spanning trees are widely used in networks for broadcasting, fault-tolerance, and securely delivering messages. Hexagonal interconnection networks have a number of real life applications. Examples are cellular networks, computer graphics,…
The CONGEST and CONGEST-CLIQUE models have been carefully studied to represent situations where the communication bandwidth between processors in a network is severely limited. Messages of only $O(log(n))$ bits of information each may be…