706 research outputs found

    Attack Resilient Pulse Based Synchronization

    Get PDF
    Synchronization of pulse-coupled oscillators (PCOs) has gained significant attention recently due to increased applications in sensor networks and wireless communications. However, most existing results are obtained in the absence of malicious attacks. Given the distributed and unattended nature of wireless sensor networks, it is imperative to enhance the resilience of pulse-based synchronization against malicious attacks. To achieve this goal, we first show that by using a carefully designed phase response function (PRF), pulse-based synchronization of PCOs can be guaranteed despite the presence of a stealthy Byzantine attacker, even when legitimate PCOs have different initial phases. Next, we propose a new pulse-based synchronization mechanism to improve the resilience of pulse-based synchronization to multiple stealthy Byzantine attackers. We rigorously characterize the condition for mounting stealthy Byzantine attacks under the proposed new pulse-based synchronization mechanism and prove analytically that synchronization of legitimate oscillators can be achieved even when their initial phases are unrestricted, i.e., randomly distributed in the entire oscillation period. Since most existing results on resilient pulse-based synchronization are obtained only for all-to-all networks, we also propose a new pulse-based synchronization mechanism to improve the resilience of pulse-based synchronization that is applicable under general connected topologies. Under the proposed synchronization mechanism, we prove that synchronization of general connected legitimate PCOs can be guaranteed in the presence of multiple stealthy Byzantine attackers, irrespective of whether the attackers collude with each other or not. The new mechanism can guarantee resilient synchronization even when the initial phases of legitimate oscillators are distributed in a half circle. Then, to relax the limitation of the stealthy attacker model and the constraint on the legitimate oscillators\u27 initial phase distribution, we improved our synchronization mechanism and proved that finite time synchronization of legitimate oscillators can be guaranteed in the presence of multiple Byzantine attackers who can emit attack pulses arbitrarily without any constraint except that practical bit rate constraint renders the number of pulses from an attacker to be finite. The improved mechanism can guarantee synchronization even when the initial phases of all legitimate oscillators are arbitrarily distributed in the entire oscillation period. The new attack resilient pulse-based synchronization approaches in this dissertation are in distinct difference from most existing attack-resilient synchronization algorithms (including the seminal paper from Lamport and Melliar-Smith [1]) which require a priori (almost) synchronization among all legitimate nodes. Numerical simulations are given to confirm the theoretical results

    Coordination and Privacy Preservation in Multi-Agent Systems

    Get PDF
    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

    Mathematical frameworks for oscillatory network dynamics in neuroscience

    Get PDF
    The tools of weakly coupled phase oscillator theory have had a profound impact on the neuroscience community, providing insight into a variety of network behaviours ranging from central pattern generation to synchronisation, as well as predicting novel network states such as chimeras. However, there are many instances where this theory is expected to break down, say in the presence of strong coupling, or must be carefully interpreted, as in the presence of stochastic forcing. There are also surprises in the dynamical complexity of the attractors that can robustly appear—for example, heteroclinic network attractors. In this review we present a set of mathemat- ical tools that are suitable for addressing the dynamics of oscillatory neural networks, broadening from a standard phase oscillator perspective to provide a practical frame- work for further successful applications of mathematics to understanding network dynamics in neuroscience

    A rocket-borne electrostatic analyzer for measurement of energetic particle flux

    Get PDF
    A rocket-borne electrostatic analyzer experiment is described. It is used to measure energetic particle flux (0.9 to 14 keV) in the nighttime midlatitude E region. Energetic particle precipitation is believed to be a significant nighttime ionization source, particularly during times of high geomagnetic activity. The experiment was designed for use in the payload of a Nike Apache sounding rocket. The electrostatic analyzer employs two cylindrical parallel plates subtending a central angle of 90 deg. The voltage waveform supplied to the plates is a series of steps synchronized to the spin of the payload during flight. Both positive and negative voltages are provided, extending the detection capabilities of the instrument to both electrons and protons (and positive ions). The development, construction and operation of the instrument is described together with a preliminary evaluation of its performance in a rocket flight

    The Virtual Bus: A Network Architecture Designed to Support Modular-Redundant Distributed Periodic Real-Time Control Systems

    Get PDF
    The Virtual Bus network architecture uses physical layer switching and a combination of space- and time-division multiplexing to link segments of a partial mesh network together on schedule to temporarily form contention-free multi-hop, multi-drop simplex signalling paths, or 'virtual buses'. Network resources are scheduled and routed by a dynamic distributed resource allocation mechanism with self-forming and self-healing characteristics. Multiple virtual buses can coexist simultaneously in a single network, as the resources allocated to each bus are orthogonal in either space or time. The Virtual Bus architecture achieves deterministic delivery times for time-sensitive traffic over multi-hop partial mesh networks by employing true line-speed switching; delays of around 15ns at each switching point are demonstrated experimentally, and further reductions in switching delays are shown to be achievable. Virtual buses are inherently multicast, with delivery skew across multiple destinations proportional to the difference in equivalent physical length to each destination. The Virtual Bus architecture is not a purely theoretical concept; a small research platform has been constructed for development, testing and demonstration purposes
    • …
    corecore