Related papers: Iterative Merging Algorithm for Cooperative Data E…
This paper considers how to accurately estimate the minimum sum-rate so as to reduce the complexity of solving cooperative data exchange (CDE) problems. The CDE system contains a number of geographically close clients who send packets to…
We consider the fairness in cooperative data exchange (CDE) problem among a set of wireless clients. In this system, each client initially obtains a subset of the packets. They exchange packets in order to reconstruct the entire packet set.…
This paper addresses the challenge of merging hierarchical navigable small world (HNSW) graphs, a critical operation for distributed systems, incremental indexing, and database compaction. We propose three algorithms for this task: Naive…
This paper presents a novel meta algorithm, Partition-Merge (PM), which takes existing centralized algorithms for graph computation and makes them distributed and faster. In a nutshell, PM divides the graph into small subgraphs using our…
We propose a general modeling and algorithmic framework for discrete structure recovery that can be applied to a wide range of problems. Under this framework, we are able to study the recovery of clustering labels, ranks of players, signs…
This paper considers the problem of stabilizing cooperative data exchange with selfish users. In this setting, each user has a subset of packets in the ground set $X$, and wants all other packets in $X$. The users can exchange their packets…
Consider a set of clients in a broadcast network, each of which holds a subset of packets in the ground set X. In the (coded) cooperative data exchange problem, the clients need to recover all packets in X by exchanging coded packets over a…
In this work, a set reconciliation setting is considered in which two parties have similar sets that they would like to reconcile. In particular, we focus on a divide-and-conquer strategy known as partitioned set reconciliation (PSR), in…
We propose a distributed algorithm to solve a dynamic programming problem with multiple agents, where each agent has only partial knowledge of the state transition probabilities and costs. We provide consensus proofs for the presented…
We apply the Min-Sum message-passing protocol to solve the consensus problem in distributed optimization. We show that while the ordinary Min-Sum algorithm does not converge, a modified version of it known as Splitting yields convergence to…
We propose an algorithm to maximize the instantaneous sum data rate transmitted by a base station in the downlink of a multiuser multiple-input, multiple-output system. The transmitter and the receivers may each be equipped with multiple…
Many problems of interest for cyber-physical network systems can be formulated as Mixed-Integer Linear Programs in which the constraints are distributed among the agents. In this paper we propose a distributed algorithmic framework to solve…
The main challenge of massive machine-type communications (mMTC) is the joint activity and signal detection of devices. The mMTC scenario with many devices transmitting data intermittently at low data rates and via very short packets…
Many problems of interest for cyber-physical network systems can be formulated as Mixed Integer Linear Programs in which the constraints are distributed among the agents. In this paper we propose a distributed algorithm to solve this class…
The cooperative data exchange problem is studied for the fully connected network. In this problem, each node initially only possesses a subset of the $K$ packets making up the file. Nodes make broadcast transmissions that are received by…
This paper investigates the application of Index Modulation (IM) to Modulation on Conjugate-Reciprocal Zeros (MOCZ) to enhance spectral efficiency (SE) in short packet communications. The proposed IM-MOCZ scheme splits an $N$-bit message…
Growing demand for sustainable logistics and higher space utilization, driven by e-commerce and urbanization, increases the need for storage systems that are both energy- and space-efficient. Compact storage systems aim to maximize space…
We design new minimal-subpacketization schemes for information-theoretic private information retrieval on graph-based replicated databases. In graph-based replication, the system consists of $K$ files replicated across $N$ servers according…
In this paper, a cooperative task computation framework exploits the computation resource in UEs to accomplish more tasks meanwhile minimizes the power consumption of UEs. The system cost includes the cost of UEs' power consumption and the…
Many mobile applications demand selective execution of multiple correlated deep learning inference tasks on resource-constrained platforms. Given a set of deep neural networks, each pre-trained for a single task, it is desired that…