A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Self-Stabilizing TDMA Algorithms for Dynamic Wireless Ad Hoc Networks
2013
International Journal of Distributed Sensor Networks
Preserved Fulltext
Other Versions
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. ...
In dynamic wireless ad-hoc networks (DynWANs), autonomous computing devices set up a network for the communication needs of the moment. ...
Acknowledgments We thank Thomas Petig for helping with improving the presentation. ...
doi:10.1155/2013/639761
fatcat:stij2gzhpfdo3klnrqrerhu3ui
Self-Stabilizing Global Optimization Algorithms for Large Network Graphs
2005
International Journal of Distributed Sensor Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The paradigm of self-stabilization provides a mechanism to design efficient localized distributed algorithms that are proving to be essential for modern day large networks of sensors. ...
We provide self-stabilizing algorithms (in the shared-variable ID-based model) for three graph optimization problems: a minimal total dominating set (where every node must be adjacent to a node in the ...
Conclusions In this paper, we have proposed several self-stabilizing distributed algorithms for total domination, maximal k-packing and strong matching in large networks. ...
doi:10.1080/15501320500330745
fatcat:6fq2e2666rh4hpl6y5grdmu4wu
FLOC-SPANNER: An O(1) Time, Locally Self-Stabilizing Algorithm for Geometric Spanner Construction in a Wireless Sensor Network
2014
International Journal of Distributed Sensor Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present a distributed algorithm for creation of geometric spanners in a wireless sensor network. ...
The algorithm is also shown to stabilize locally in the presence of node additions and deletions. The performance of our algorithm is verified using large scale simulations. ...
In this paper, we present FLOC-SPANNER, a distributed, locally self-stabilizing algorithm for creation of geometric spanners. ...
doi:10.1155/2014/923751
fatcat:iirofg2mcfbgbeobvkhqfiei2y
A Self-stabilizing (k,r)-clustering Algorithm with Multiple Paths for Wireless Ad-hoc Networks
2011
2011 31st International Conference on Distributed Computing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
We present the first self-stabilizing distributed (k,r)-clustering algorithm. ...
Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. ...
Pseudocode for the self-stabilizing clustering algorithm. ...
doi:10.1109/icdcs.2011.75
dblp:conf/icdcs/LarssonT11
fatcat:crpzugcgenf3vetpn22cxi4tk4
Efficient self-stabilizing algorithms for tree networks
23rd International Conference on Distributed Computing Systems, 2003. Proceedings.
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
Many proposed self-stabilizing algorithms require an exponential number of moves before stabilizing on a global solution, including some rooting algorithms for tree networks [1, 2, 3] . ...
In the next section we describe more completely the self-stabilizing algorithmic paradigm. Numerous results in the literature address the issue of self-stabilizing algorithms for rooting a tree. ...
any given tree network, the distributed algorithm R1 -R5 stabilizes in no more than 2n 2 − n moves. ...
doi:10.1109/icdcs.2003.1203448
dblp:conf/icdcs/BlairM03
fatcat:te7keg2bwvgdbj3q3xo42hqjt4
Self-stabilizing Routing Algorithms for Wireless Ad-Hoc Networks
[chapter]
Distributed Computing and Internet Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
First we use a more general model in which nodes can have different transmission and interference ranges and we present a new routing algorithm for wireless ad hoc networks that has several nice features ...
We then combine our algorithm with that of known greedy algorithms to arrive at an average case efficient routing algorithm in the situation that GPS information is available. ...
For definition of r t ⊕ r i , please see Section 2. Our algorithms are also self-stabilizing [20] which is an important property for distributed systems. ...
doi:10.1007/978-3-540-77115-9_5
dblp:conf/icdcit/KhotPKS07
fatcat:avd7icrfwzenvfchg7qxaubtme
Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs
2017
International Symposium on Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We present the first self-stabilizing algorithm for leader election in arbitrary topologies whose space complexity is O(max{log ∆, log log n}) bits per node, where n is the network size and ∆ its degree ...
It is designed for the standard state model (a.k.a. shared memory model) for self-stabilizing algorithms in networks. ...
This algorithm is the first self-stabilizing leader election algorithm for arbitrary networks with space-complexity o(log n) (whenever ∆ = n o (1) ). ...
doi:10.4230/lipics.disc.2017.43
dblp:conf/wdag/BlinT17
fatcat:vg5imk2tnvcqpaq7pl6f2v4xce
Time-Efficient Self-Stabilizing Algorithms through Hierarchical Structures
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present a method of combining a self-stabilizing algorithm with a hierarchical structure to construct a self-stabilizing algorithm with improved stabilization time complexity and fault-containment features ...
As a case study, a self-stabilizing spanning-tree algorithm is presented which in favorable settings has logarithmic stabilization time complexity. ...
Adding Structure for Constructing Efficient Self-Stabilizing Spanning-Tree Algorithms In this section we show how sacrificing full distribution can help to improve the efficiency of self-stabilizing algorithms ...
doi:10.1007/3-540-45032-7_12
fatcat:6yynza6b3jhgtbuq3ijikayo3e
Optimal deterministic self-stabilizing vertex coloring in unidirectional anonymous networks
2009
2009 IEEE International Symposium on Parallel & Distributed Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the systems recovers from this catastrophic situation without external ...
Unidirectional networks preclude many common techniques in self-stabilization from being used, such as preserving local predicates. ...
Since a self-stabilizing algorithm may start from any arbitrary state, lower bounds for non-stabilizing (a.k.a. properly initialized) distributed algorithms still hold for selfstabilizing ones. ...
doi:10.1109/ipdps.2009.5161053
dblp:conf/ipps/BernardDPT09
fatcat:6v5vrjop6ncqnd6rbtmqfktwcm
Brief Announcement: Memory Lower Bounds for Self-Stabilization
2019
International Symposium on Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In the context of self-stabilization, a silent algorithm guarantees that the communication registers (a.k.a register) of every node do not change once the algorithm has stabilized. ...
We improve this result by establishing the lower bound Ω(log log n) bits per register for deterministic self-stabilizing algorithms solving (∆ + 1)-coloring, leader election or constructing a spanning ...
Introduction Self-stabilization is a suitable paradigm for asynchronous distributed systems subject to transient failures. ...
doi:10.4230/lipics.disc.2019.37
dblp:conf/wdag/BlinFB19
fatcat:ucwvrbj4xfflhje6sk65f7ksde
Programming Wireless Sensor Networks in a Self-Stabilizing Style
2009
2009 Third International Conference on Sensor Technologies and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The analysis is accomplished with Self-WISE, a framework providing programming abstractions for self-stabilizing algorithms. ...
This demonstrates the usability of SelfWISE for evaluating self-stabilizing algorithms under a wide range of models. ...
To use self-stabilizing algorithms in sensor networks it is necessary to adapt them to a suitable model. ...
doi:10.1109/sensorcomm.2009.100
fatcat:5eojslgr7rc23eeehhizlmvkgy
Fast and Compact Distributed Verification and Self-Stabilization of a DFS Tree
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We present algorithms for distributed verification and silent-stabilization of a DFS(Depth First Search) spanning tree of a connected network. ...
To demonstrate the simplicity of constructing efficient DFS algorithms using the modular approach, We also present a (non-sielnt) self-stabilizing DFS token circulation algorithm for general networks based ...
Self-stabilizing DFS token circulation The silent-stabilizing DFS tree of Section 5.1 can be combined with a selfstabilizing mutual exclusion algorithm for tree networks to obtain a self-stabilizing token ...
arXiv:1408.0384v2
fatcat:4mr7c6yekjclbc4bivcnxrf54u
Brief announcement
2013
Proceedings of the 2013 ACM symposium on Principles of distributed computing - PODC '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper focuses on compact deterministic self-stabilizing solutions for the leader election problem. Self-stabilization is a versatile approach to withstand any kind of transient failures. ...
minimal assumptions about the framework for our algorithm. ...
stabilization [11, 12, 27] is a general paradigm to provide forward recovery capabilities to distributed systems and networks. ...
doi:10.1145/2484239.2484289
dblp:conf/podc/BlinT13
fatcat:b3ehjxpzs5gbtooym6m5xugkam
Randomized Self-stabilizing Algorithms for Wireless Sensor Networks
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
The transformed algorithms use randomization and are probabilistically self-stabilizing. This work allows to utilize many known self-stabilizing algorithms in WSNs. ...
The majority of self-stabilizing algorithms found in the literature is based on models not suitable for WSNs: shared memory model, central daemon scheduler, unique processor identifiers, and atomicity. ...
Designing self-stabilization for anonymous networks under the distributed scheduler is a difficult task and for some problems the non-existence of such algorithms has been proven. ...
doi:10.1007/11822035_8
fatcat:lo3ytmuiwbeilekztm23mcdcua
Daemon Conversions in Distributed Self-stabilizing Algorithms
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We consider protocols to transform a self-stabilizing algorithm for one daemon to one that can run under a different daemon. ...
We give the first (full) proof that, provided there are IDs, any algorithm that self-stabilizes only under a fair central daemon can be converted to one that self-stabilizes under an unfair read/write ...
Introduction A self-stabilizing algorithm is a distributed algorithm that is designed to converge to a desired state without coordination or initialization [1] . ...
doi:10.1007/978-3-642-36065-7_15
fatcat:7xr7xp4g65gshcz7hzhfmhbmoi
« Previous
Showing results 1 — 15 out of 153,152 results