Related papers: Separation of Circulating Tokens
A central server needs to perform statistical inference based on samples that are distributed over multiple users who can each send a message of limited length to the center. We study problems of distribution learning and identity testing…
Network systems have become a ubiquitous modeling tool in many areas of science where nodes in a graph represent distributed processes and edges between nodes represent a form of dynamic coupling. When a network topology is already known…
In this work, we study protocols so that populations of distributed processes can construct networks. In order to highlight the basic principles of distributed network construction we keep the model minimal in all respects. In particular,…
In this Letter we propose a method to control a set of arbitrary nodes in a directed network such that they follow a synchronous trajectory which is, in general, not shared by the other units of the network. The problem is inspired to those…
A circular quantum secret sharing protocol is proposed, which is useful and efficient when one of the parties of secret sharing is remote to the others who are in adjacent, especially the parties are more than three. We describe the process…
We study the problem of distributed control of large-scale robotic swarms which can be modeled as continuum densities evolving under the continuity equation. We propose a formalization of distributed controllers as (generally nonlinear)…
The last decade has seen a variety of Asset-Transfer systems designed for decentralized environments. To address the problem of double-spending, these systems inherently make strong model assumptions and spend a lot of resources. In this…
This paper aims to create a secure environment for networked control systems composed of multiple dynamic entities and computational control units via networking, in the presence of disclosure attacks. In particular, we consider the…
We consider a decentralized optimization problem, in which $n$ nodes collaborate to optimize a global objective function using local communications only. While many decentralized algorithms focus on \emph{gossip} communications (pairwise…
Topological self-stabilization describes the ability of a distributed system to let the nodes themselves establish a meaningful overlay network. Independent from the initial network topology, the system converges to the desired topology via…
This paper studies the distributed L2-gain control problem for continuous-time large-scale systems under Round-Robin communication protocol. In this protocol, each sub-controller obtains its own subsystem's state information continuously,…
We develop elements of a theory of cooperation and coordination in networks. Rather than considering a communication network as a means of distributing information, or of reconstructing random processes at remote nodes, we ask what…
This paper addresses the problem of navigation control of a general class of uncertain nonlinear multi-agent systems in a bounded workspace of $\mathbb{R}^n$ with static obstacles. In particular, we propose a decentralized control protocol…
Quantum metrology and cryptography can be combined in a distributed and/or remote sensing setting, where distant end-users with limited quantum capabilities can employ quantum states, transmitted by a quantum-powerful provider via a quantum…
The aim of the dispersion problem is to place a set of $k(\leq n)$ mobile robots in the nodes of an unknown graph consisting of $n$ nodes such that in the final configuration each node contains at most one robot, starting from any arbitrary…
Any Quantum Key Distribution (QKD) protocol consists first of sequences of measurements that produce some correlation between classical data. We show that these correlation data must violate some Bell inequality in order to contain…
We study the stabilization of networked control systems with asynchronous sensors and controllers. Offsets between the sensor and controller clocks are unknown and modeled as parametric uncertainty. First we consider multi-input linear…
A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the system recovers from this catastrophic situation without external intervention in finite time. In this…
Distributed control algorithms are known to reduce overall computation time compared to centralized control algorithms. However, they can result in inconsistent solutions leading to the violation of safety-critical constraints. Inconsistent…
Ring topology is a simple configuration used to connect processes that communicate among themselves. A number of network standards such as token ring, token bus, and FDDI are based on the ring connectivity. This article will develop an…