Related papers: Loosely-Stabilizing Phase Clocks and the Adaptive …
Self-stabilizing protocols enable distributed systems to recover correct behavior starting from any arbitrary configuration. In particular, when processors communicate by message passing, fake messages may be placed in communication links…
Many tasks executed in dynamic distributed systems, such as sensor networks or enterprise environments with bring-your-own-device policy, require central coordination by a leader node. In the past it has been proven that distributed leader…
We study the stability and synchronization of predator-prey populations subjected to noise. The system is described by patches of local populations coupled by migration and predation over a neighborhood. When a single patch is considered,…
Weakly coupled oscillators adjust their dynamics to work in unison: they synchronize. This ubiquitous phenomenon is observed for oscillating pendulum, electronic devices, as well as clapping crowds or flashing fireflies. In effect,…
The prevailing methodology for analyzing population games and evolutionary dynamics in the large population limit assumes that a Poisson process (or clock) inherent to each agent determines when the agent can revise its strategy. Hence,…
In the distributed localization problem (DLP), $n$ anonymous robots (agents) $a_0, a_1, ..., a_{n-1}$ begin at arbitrary positions $p_0, ..., p_{n-1}$ in $S$, where $S$ is an Euclidean space. The primary goal in DLP is for agents to reach a…
This paper regards the relative localization problem in sensor networks. We study a randomized algorithm, which is based on input-driven consensus dynamics and involves pairwise "gossip" communications and updates. Due to the randomness of…
We address the self-stabilizing bit-dissemination problem, designed to capture the challenges of spreading information and reaching consensus among entities with minimal cognitive and communication capacities. Specifically, a group of $n$…
In this note, the problem of simultaneous leader-following consensus and parameter estimation is studied for a class of multi-agent systems subject to an uncertain leader system. The leader system is described by a sum of sinusoids with…
We study a \emph{Plurality-Consensus} process in which each of $n$ anonymous agents of a communication network initially supports an opinion (a color chosen from a finite set $[k]$). Then, in every (synchronous) round, each agent can revise…
The leader-following consensus of multiple linear time invariant (LTI) systems under switching topology is considered. The leader-following consensus problem consists of designing for each agent a distributed protocol to make all agents…
The paper is devoted to the approximate consensus problem for networks of nonlinear agents with switching topology, noisy and delayed measurements. In contrast to the existing stochastic approximation-based control algorithms (protocols), a…
Improving the clock stability is of fundamental importance for the development of quantum-enhanced metrology. One of the main limitations arises from the randomly-fluctuating local oscillator (LO) frequency, which introduces "phase slips"…
Consider an asynchronous network in a shared-memory environment consisting of n nodes. Assume that up to f of the nodes might be Byzantine (n > 12f), where the adversary is full-information and dynamic (sometimes called adaptive). In…
We study the problem of randomized Leader Election in synchronous distributed networks with indistinguishable nodes. We consider algorithms that work on networks of arbitrary topology in two settings, depending on whether the size of the…
We consider both leaderless and leader-follower, possibly nonlinear, networks affected by time-varying communication delays. For such systems, we give a set of sufficient conditions that guarantee the convergence of the network towards some…
Synchronization in a lattice of a finite population of phase oscillators with algebraically decaying, non-normalized coupling is studied by numerical simulations. A critical level of decay is found, below which full locking takes place if…
The stability analysis of synchronization in time-varying higher-order networked structures (simplicial complexes) is one of the challenging problem due to the presence of time-varying group interactions. In this context, most of the…
Certain nonlinear systems can switch between dynamical attractors occupying different regions of phase space, under variation of parameters or initial states. In this work we exploit this feature to obtain reliable logic operations. With…
Phase clocks are synchronization tools that implement a form of logical time in distributed systems. For systems tolerating transient faults by self-repair of damaged data, phase clocks can enable reasoning about the progress of distributed…