Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker Networks

Daliot, Ariel; Dolev, Danny; Parnas, H.

doi:10.1007/3-540-45032-7_3

“…Suppose that timeslot 0 ( ) is the first configuration in a complete broadcasting round ( ) for which properties (1) to (3) Let be the probability for to transmit in the th listening/signaling period of timeslot (cf. line 19). This paper considers the concrete transmission probability = 1/…”

Section: B Properties (4) To (5)mentioning

confidence: 99%

Self-stabilizing TDMA Algorithms for Dynamic Wireless Ad-Hoc Networks

Leone

¹

,

Schiller

²

2013

Algorithms for Sensor Systems

View full text Add to dashboard Cite

In dynamic wireless ad hoc networks (DynWANs), autonomous computing devices set up a network for the communication needs of the moment. These networks require the implementation of a medium access control (MAC) layer. We consider MAC protocols for DynWANs that need to be autonomous and robust as well as have high bandwidth utilization, high predictability degree of bandwidth allocation, and low communication delay in the presence of frequent topological changes to the communication network. Recent studies have shown that existing implementations cannot guarantee the necessary satisfaction of these timing requirements. We propose a self-stabilizing MAC algorithm for DynWANs that guarantees a short convergence period, and by that, it can facilitate the satisfaction of severe timing requirements, such as the above. Besides the contribution in the algorithmic front of research, we expect that our proposal can enable quicker adoption by practitioners and faster deployment of DynWANs that are subject changes in the network topology.

show abstract

“…Suppose that Let be the probability for to transmit in the th listening/signaling period of timeslot (cf. line 19). This paper considers the concrete transmission probability = 1/…”

Section: B Properties (4) To (5)mentioning

confidence: 99%

Self-stabilizing TDMA Algorithms for Dynamic Wireless Ad-hoc Networks

2013

Proceedings of the 2nd International Conference on Sensor Networks

0

View full text Add to dashboard Cite

In dynamic wireless ad hoc networks (DynWANs), autonomous computing devices set up a network for the communication needs of the moment. These networks require the implementation of a medium access control (MAC) layer. We consider MAC protocols for DynWANs that need to be autonomous and robust as well as have high bandwidth utilization, high predictability degree of bandwidth allocation, and low communication delay in the presence of frequent topological changes to the communication network. Recent studies have shown that existing implementations cannot guarantee the necessary satisfaction of these timing requirements. We propose a self-stabilizing MAC algorithm for DynWANs that guarantees a short convergence period, and by that, it can facilitate the satisfaction of severe timing requirements, such as the above. Besides the contribution in the algorithmic front of research, we expect that our proposal can enable quicker adoption by practitioners and faster deployment of DynWANs that are subject changes in the network topology.

show abstract

“…It is important to note that we have previously presented a distributed self-stabilizing Byzantine pulse synchronization procedure in [3]. It aims at delivering a common anchor in time to all correct nodes within a short time following transient failures and with the permanent presence of Byzantine nodes.…”

Section: Introductionmentioning

confidence: 99%

“…Moreover, we show in [6] that synchronized pulses can actually be produced more efficiently atop the protocol in the current paper. This pulse synchronization procedure can in turn be used as the pulse synchronization mechanism for making any Byzantine algorithm selfstabilize, in a more efficient way and in a more general model than by using the pulse synchronization procedure in [3].…”

Section: Introductionmentioning

confidence: 99%

Self-stabilizing byzantine agreement

Daliot

¹

,

Dolev

²

2006

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing

Self Cite

View full text Add to dashboard Cite

Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of information exchange to reach agreement based on the input values. The implicit initial assumptions enable correct nodes to infer about the progression of the algorithm at other nodes from their local state. This paper considers a more severe fault model than permanent Byzantine failures, one in which the system can in addition be subject to severe transient failures that can temporarily throw the system out of its assumption boundaries. When the system eventually returns to behave according to the presumed assumptions it may be in an arbitrary state in which any synchronization among the nodes might be lost, and each node may be at an arbitrary state. We present a self-stabilizing Byzantine agreement algorithm that reaches agreement among the correct nodes in optimal time, by using only the assumption of bounded message transmission delay. In the process of solving the problem, two additional important and challenging building blocks were developed: a unique self-stabilizing protocol for assigning consistent relative times to protocol initialization and a Reliable Broadcast primitive that progresses at the speed of actual message delivery time.

show abstract

Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker Networks

Cited by 39 publications

References 30 publications

Self-stabilizing TDMA Algorithms for Dynamic Wireless Ad-Hoc Networks

Self-stabilizing TDMA Algorithms for Dynamic Wireless Ad-Hoc Networks

Self-stabilizing TDMA Algorithms for Dynamic Wireless Ad-hoc Networks

Self-stabilizing byzantine agreement

Contact Info

Product

Resources

About