Cached sensornet transformation of non-silent self-stabilizing algorithms with unreliable links

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A wireless sensor network is a set of nodes, each is equipped with sensors and a wireless communication device. Cached Sensornet Transform (CST for short) is a methodology for design and implementation of self-stabilizing algorithms for sensor networks. It transforms a self-stabilizing algorithm in the abstract computational model to a program for sensor networks. In the literature, only CST transformation of silent self-stabilizing algorithms have been investigated, while non-silent ones have not been investigated. Our contribution in this paper is threefold. We present a counterexample of a non-silent algorithm transformed by CST that does not behave correctly despite the original algorithm is correct. We show a sufficient condition for original algorithms and networks such that a transformed algorithm by CST behaves correctly. We present a token circulation algorithm that behaves correctly by CST, and derive upper bound of its expected convergence time. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kakugawa, H., Yamauchi, Y., Kamei, S., & Masuzawa, T. (2009). Cached sensornet transformation of non-silent self-stabilizing algorithms with unreliable links. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5873 LNCS, pp. 428–442). https://doi.org/10.1007/978-3-642-05118-0_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free