Self-organizing Desynchronization and TDMA on Wireless Sensor Networks

Degesys, J.; Rose, Ian; Patel, Ankit; Nagpal, Radhika

doi:10.1007/978-3-540-92191-2_18

Cited by 9 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here we have restricted ourselves to the case of "attractive" phase correction which attempts to mutually synchronize the oscillators. There are many practical situations in which the formation of a coherent state in ensemble of oscillatory units is unacceptable and should be avoided [27,28]. One may expect that "repulsive" phase correction ( i.e.…”

Section: Discussionmentioning

confidence: 99%

Synchronization transition in ensemble of coupled phase oscillators with coherence-induced phase correction

Belan

2015

Preprint

View full text Add to dashboard Cite

We study synchronization phenomenon in a self-correcting population of noisy phase oscillators with randomly distributed natural frequencies. In our model each oscillator stochastically switches its phase to the ensemble-averaged value ψ at a typical rate which is proportional to the degree of phase coherence r. The system exhibits a continuous phase transition to collective synchronization similar to classical Kuramoto model. Based on the self-consistent arguments and on the linear stability analysis of an incoherent state we derive analytically the threshold value kc of coupling constant corresponding to the onset of a partially synchronized state. Just above the transition point the linear scaling law r ∝ k − kc is found. We also show that nonlinear relation between rate of phase correction and order parameter leads to non-trivial transition between incoherence and synchrony. To illustrate our analytical results, numerical simulations have been performed for a large population of phase oscillators with proposed type of coupling. The results of this work could become useful in designing distributed networked systems capable of self-synchronization.

show abstract

Section: Discussionmentioning

confidence: 99%

Synchronization transition in ensemble of coupled phase oscillators with coherence-induced phase correction

Belan

2015

Preprint

View full text Add to dashboard Cite

show abstract

“…DESYNC. We review the DESYNC method, which is based on the inverse concept of firefly synchronization [15][16][17]. Firefly synchronization imitates a phenomenon where fireflies with different glittering phases glitter simultaneously through interaction among them.…”

Section: Previous Desync and Mh-desync Methodsmentioning

confidence: 99%

Weighted-DESYNC and Its Application to End-to-End Throughput Fairness in Wireless Multihop Network

Yu¹,

Jung²,

Kong³

et al. 2017

Mobile Information Systems

View full text Add to dashboard Cite

The end-to-end throughput of a routing path in wireless multihop network is restricted by a bottleneck node that has the smallest bandwidth among the nodes on the routing path. In this study, we propose a method for resolving the bottleneck-node problem in multihop networks, which is based on multihop DESYNC (MH-DESYNC) algorithm that is a bioinspired resource allocation method developed for use in multihop environments and enables fair resource allocation among nearby (up to two hops) neighbors. Based on MH-DESYNC, we newly propose weighted-DESYNC (W-DESYNC) as a tool artificially to control the amount of resource allocated to the specific user and thus to achieve throughput fairness over a routing path. Proposed W-DESYNC employs the weight factor of a link to determine the amount of bandwidth allocated to a node. By letting the weight factor be the link quality of a routing path and making it the same across a routing path via Cucker-Smale flocking model, we can obtain throughput fairness over a routing path. The simulation results show that the proposed algorithm achieves throughput fairness over a routing path and can increase total end-to-end throughput in wireless multihop networks.

show abstract

“…Firstly, every node 𝑞 ∈ 𝑄 would generate its first pulse with 𝑥 𝑞 ∼ 𝑈 (−1/2, 1/2) during the startup of 𝑞 just as before. Then, at every pulsing instant 𝑡, 𝑞 would decide the next 𝜅 𝑞 in (12) with another independently sampled 𝑥 𝑞 ∼ 𝑈 (−1/2, 1/2). Meanwhile, by recording the instants of the received pulses in 𝑅…”

Section: Anonymous Random-walk Synchronizationmentioning

confidence: 99%

A New Fault-Tolerant Synchronization Scheme with Anonymous Pulses

Yu¹,

Zhu²,

Yang³

et al. 2022

Preprint

View full text Add to dashboard Cite

Robust pulse synchronization is fundamental in constructing reliable synchronous applications in wired and wireless distributed systems. In wired systems, self-stabilizing Byzantine pulse synchronization aims for synchronizing fault-prone distributed components with arbitrary initial states in bounded-delay message-passing systems. In wireless systems, fault-tolerant synchronization of pulsecoupled oscillators is also built for a similar goal but often works under specific system restrictions, such as low computation power, low message complexity, and anonymous physical pulses whose senders cannot be identified by the receivers. These restrictions often prevent us from constructing high-reliable wireless synchronous applications.This paper tries to break barriers between bounded-delay message-passing systems and classical pulse-coupled oscillators by introducing a new fault-tolerant synchronization scheme for the so-called anonymous bounded-delay pulsing systems in the presence of indeterministic communication delays and inconsistent faults. For low computation power and low message complexity, instead of involving in consensus-based primitives, the proposed synchronization scheme integrates the so-called discrete mean-fields, planar random walks, and some additional easy operations in utilizing only sparsely generated anonymous pulses. For fault-tolerance, we show that a square-root number of faulty oscillators can be tolerated by utilizing planar random walks in anonymous pulse synchronization. For self-stabilization, we show that the stabilization can be reached in an expected constant number of observing windows in anonymous bounded-delay pulsing systems with the pulsing-frequency restriction.Besides, the proposed synchronization scheme can also work in wired systems to eliminate the pulsing-frequency restriction. For realization, the prototype experiment shows that this synchronization scheme can be easily implemented in real-world systems.

show abstract

Self-organizing Desynchronization and TDMA on Wireless Sensor Networks

Cited by 9 publications

References 13 publications

Synchronization transition in ensemble of coupled phase oscillators with coherence-induced phase correction

Synchronization transition in ensemble of coupled phase oscillators with coherence-induced phase correction

Weighted-DESYNC and Its Application to End-to-End Throughput Fairness in Wireless Multihop Network

A New Fault-Tolerant Synchronization Scheme with Anonymous Pulses

Contact Info

Product

Resources

About