K. Yoshida, H. Kakugawa, and T. Masuzawa (Japan)
self-stabilization, self-organization, wireless sensor net work, node clustering, maximal independent set,
Self-stabilization is a promising theoretical background for wireless sensor network protocols because it tolerates message and memory corruption and it is adaptive to ad hoc node removal and deployment. However, many self stabilizing algorithms presented in the literature assume ab stract computational model which is quite different from real wireless sensor networks. In this paper, we consider transformation of such self-stabilizing algorithms to pro gram codes that can be executed in real wireless sensor net works. Transformation adopted in this paper is lightweight in a sense that run-time overhead is small, however, it does not guarantee equivalence of computational models. We show that the lightweight transformation performs well in practice by experiment with real wireless sensor network.
Important Links:
Go Back
