Fast Desynchronization For Decentralized Multichannel Medium Access Control

Distributed desynchronization algorithms are key to wireless sensor networks as they allow for medium access control in a decentralized manner. In this paper, we view desynchronization primitives as iterative methods that solve optimization problems. In particular, by formalizing a well established desynchronization algorithm as a gradient descent method, we establish novel upper bounds on the number of iterations required to reach convergence. Moreover, by using Nesterov's accelerated gradient method, we propose a novel desynchronization primitive that provides for faster convergence to the steady state. Importantly, we propose a novel algorithm that leads to decentralized time-synchronous multichannel TDMA coordination by formulating this task as an optimization problem. Our simulations and experiments on a densely-connected IEEE 802.15.4-based wireless sensor network demonstrate that our scheme provides for faster convergence to the steady state, robustness to hidden nodes, higher network throughput and comparable power dissipation with respect to the recently standardized IEEE 802.15.4e-2012 time-synchronized channel hopping (TSCH) scheme.Comment: to appear in IEEE Transactions on Communication

Coordination and Privacy Preservation in Multi-Agent Systems

This dissertation considers two key problems in multi-agent systems: coordination (including both synchronization and desynchronization) and privacy preservation. For coordination in multi-agent systems, we focus on synchronization/desynchronization of distributed pulse-coupled oscillator (PCO) networks and their applications in collective motion coordination. Pulse-coupled oscillators were originally proposed to model synchronization in biological systems such as flashing fireflies and firing neurons. In recent years, with proven scalability, simplicity, accuracy, and robustness, the PCO based synchronization strategy has become a powerful clock synchronization primitive for wireless sensor networks. Driven by these increased applications in biological networks and wireless sensor networks, synchronization of pulse-coupled oscillators has gained increased popularity. However, most existing results address the local synchronization of PCOs with initial phases constrained in a half cycle, and results on global synchronization from any initial condition are very sparse. In our work, we address global PCO synchronization from an arbitrary phase distribution under chain or directed tree graphs. More importantly, different from existing global synchronization studies on decentralized PCO networks, our work allows heterogeneous coupling functions and perturbations on PCOs\u27 natural frequencies, and our results hold under any coupling strength between zero and one, which is crucial because a large coupling strength has been shown to be detrimental to the robustness of PCO synchronization to disturbances. Compared with synchronization, desynchronization of PCOs is less explored. Desynchronization spreads the phase variables of all PCOs uniformly apart (with equal difference between neighboring phases). It has also been found in many biological phenomena, such as neuron spiking and fish signaling. Recently, phase desynchronization has been employed to achieve round-robin scheduling, which is crucial in applications as diverse as media access control of communication networks, realization of analog-to-digital converters, and scheduling of traffic flows in intersections. In our work, we systematically characterize pulse-coupled oscillators based decentralized phase desynchronization and propose an interaction function that is more general than existing results. Numerical simulations show that the proposed pulse based interaction function also has better robustness to pulse losses, time delays, and frequency errors than existing results. Collective motion coordination is fundamental in systems as diverse as mobile sensor networks, swarm robotics, autonomous vehicles, and animal groups. Inspired by the close relationship between phase synchronization/desynchronization of PCOs and the heading dynamics of connected vehicles/robots, we propose a pulse-based integrated communication and control approach for collective motion coordination. Our approach only employs simple and identical pulses, which significantly reduces processing latency and communication delay compared with conventional packet based communications. Not only can heading control be achieved in the proposed approach to coordinate the headings (orientations) of motions in a network, but also spacing control for circular motion is achievable to design the spacing between neighboring nodes (e.g., vehicles or robots). The second part of this dissertation is privacy preservation in multi-agent systems. More specifically, we focus on privacy-preserving average consensus as it is key for multi-agent systems, with applications ranging from time synchronization, information fusion, load balancing, to decentralized control. Existing average consensus algorithms require individual nodes (agents) to exchange explicit state values with their neighbors, which leads to the undesirable disclosure of sensitive information in the state. In our work, we propose a novel average consensus algorithm for time-varying directed graphs which can protect the privacy of participating nodes\u27 initial states. Leveraging algorithm-level obfuscation, the algorithm does not need the assistance of any trusted third party or data aggregator. By leveraging the inherent robustness of consensus dynamics against random variations in interaction, our proposed algorithm can guarantee privacy of participating nodes without compromising the accuracy of consensus. The algorithm is distinctly different from differential-privacy based average consensus approaches which enable privacy through compromising accuracy in obtained consensus value. The approach is able to protect the privacy of participating nodes even in the presence of multiple honest-but-curious nodes which can collude with each other

Complex partial synchronization patterns in networks of delay-coupled neurons

We study the spatio-temporal dynamics of a multiplex network of delay-coupled FitzHugh–Nagumo oscillators with non-local and fractal connectivities. Apart from chimera states, a new regime of coexistence of slow and fast oscillations is found. An analytical explanation for the emergence of such coexisting partial synchronization patterns is given. Furthermore, we propose a control scheme for the number of fast and slow neurons in each layer.DFG, 163436311, SFB 910: Kontrolle selbstorganisierender nichtlinearer Systeme: Theoretische Methoden und Anwendungskonzept

Synchronization of Coupled and Periodically Forced Chemical Oscillators

Physiological rhythms are essential in all living organisms. Such rhythms are regulated through the interactions of many cells. Deviation of a biological system from its normal rhythms can lead to physiological maladies. The tremor and symptoms associated with Parkinson\u27s disease are thought to emerge from abnormal synchrony of neuronal activity within the neural network of the brain. Deep brain stimulation is a therapeutic technique that can remove this pathological synchronization by the application of a periodic desynchronizing signal. Herein, we used the photosensitive Belousov--Zhabotinsky (BZ) chemical reaction to test the mechanism of deep brain stimulation. A collection of oscillators are initially synchronized using a regular light signal. Desynchronization is then attempted using an appropriately chosen desynchronizing signal based on information found in the phase response curve.;Coupled oscillators in various network topologies form the most common prototypical systems for studying networks of dynamical elements. In the present study, we couple discrete BZ photochemical oscillators in a network configuration. Different behaviors are observed on varying the coupling strength and the frequency heterogeneity, including incoherent oscillations to partial and full frequency entrainment. Phase clusters are organized symmetrically or non-symmetrically in phase-lag synchronization structures, a novel phase wave entrainment behavior in non-continuous media. The behavior is observed over a range of moderate coupling strengths and a broad frequency distribution of the oscillators

Phase Desynchronization in Pulse-Coupled Oscillator Networks: A New Algorithm and Approach

In this thesis, we present a novel approach for achieving phase desynchronization in a pulse-coupled oscillator network. Ensuring phase desynchronization is a difficult problem, and existing results are constrained to a completely interconnected network and a fixed number of oscillators. Our approach is more robust than previous approaches, removing the constraint of a fixed number of oscillators. The removal of this constraint is significant because it allows the network to receive and drop nodes freely without any change to the phase update strategy. Also, to our knowledge, our approach is the first to prove the convergence to the desynchronized state for a topology that is more general than the all-to-all topology. More specifically, our approach is applicable to any circulant and symmetric network topology, including the circulant symmetric ring topology. Rigorous mathematical proofs are provided to support the result that any circulant symmetric network with ordered phases under our proposed algorithm will converge to uniform phase desynchronization. Simulation results are presented to demonstrate the algorithm\u27s performance, as well as experimental results on a physical system to further illustrate applications of pulse-coupled oscillator networks