Self-stabilizing Minimum Spanning Tree Construction on Message-Passing Networks

Highám, Lisa; Liang, Zhiying

doi:10.1007/3-540-45414-4_14

Cited by 18 publications

(32 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Foremost these are algorithms for coloring, spanning trees, independent and dominating sets [5][6][7][8][9]. Furthermore, this work simplifies the design of self-stabilizing for WSNs, developers can work with the central daemon scheduler and do not have to take into considerations the imponderabilities of wireless communication.…”

Section: Resultsmentioning

confidence: 99%

“…Self-stabilization fits into the unattended operation style of WSNs, where no outside intervention is necessary. Over the last 20 years many self-stabilizing algorithms have been proposed, quite a few of them are of interest for WSNs: graph coloring [5], articulation points [6], dominating sets [7], depth-first trees [8], and spanning trees [9]. However, the majority of these algorithms is based on models not suitable for the constraints of WSNs: shared memory model, central daemon scheduler, unique processor identifiers, and atomicity.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Randomized Self-stabilizing Algorithms for Wireless Sensor Networks

Turau

Weyer

2006

Self-Organizing Systems

View full text Add to dashboard Cite

Abstract. Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of wireless communication can lead to situations, where nodes lose synchrony and programs reach arbitrary states. Traditional approaches to fault tolerance like replication or global resets are not feasible. In this work, the concept of self-stabilization is applied to 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. This paper proposes problem-independent transformations for algorithms that stabilize under the central daemon scheduler such that they meet the demands of a WSN. The transformed algorithms use randomization and are probabilistically self-stabilizing. This work allows to utilize many known self-stabilizing algorithms in WSNs. The proposed transformations are evaluated using simulations and a real WSN.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Randomized Self-stabilizing Algorithms for Wireless Sensor Networks

Turau

Weyer

2006

Self-Organizing Systems

View full text Add to dashboard Cite

show abstract

“…Such a sequence of transformations, though, produces a complicated algorithm and incurs time and space overhead (cf. [6,13]). One issue to be overcome in transforming an algorithm for the static message-passing model to the model in our paper is handling the synchrony that is relied upon in some component transformations to message passing (e.g., [14]).…”

Section: Introductionmentioning

confidence: 99%

A leader election algorithm for dynamic networks with causal clocks

et al. 2013

View full text Add to dashboard Cite

11-18 1981). Moreover, a generic representation of time is used, which can be implemented using totally-ordered values that preserve the causality of events, such as logical clocks and perfect clocks. A correctness proof for the algorithm is provided, and it is ensured that in certain well-behaved situations, a new leader is not elected unnecessarily, that is, the algorithm satisfies a stability condition.

show abstract

“…In asynchronous setting the complexity is Ω(n 2 ) rounds. A different approach for the message-passing model, was proposed by Higham and Liang [11]. The algorithm performs roughly as follows: every edge checks whether it eventually belongs to the MST or not.…”

Section: Introductionmentioning

confidence: 99%

Fast Self-stabilizing Minimum Spanning Tree Construction

Blin

Dolev

Potop-Butucaru

et al. 2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log 2 n) bits and it converges in O(n 2 ) rounds. Thus, this algorithm improves the convergence time of all previously known selfstabilizing asynchronous MST algorithms by a multiplicative factor Θ(n), to the price of increasing the best known space complexity by a factor O(log n). The main ingredient used in our algorithm is the design, for the first time in self-stabilizing settings, of a labeling scheme for computing the nearest common ancestor with only O(log 2 n) bits.

show abstract

Self-stabilizing Minimum Spanning Tree Construction on Message-Passing Networks

Cited by 18 publications

References 13 publications

Randomized Self-stabilizing Algorithms for Wireless Sensor Networks

Randomized Self-stabilizing Algorithms for Wireless Sensor Networks

A leader election algorithm for dynamic networks with causal clocks

Fast Self-stabilizing Minimum Spanning Tree Construction

Contact Info

Product

Resources

About