A comparison of epidemic algorithms in wireless sensor networks

Date
2006-08-21
Authors
Akdere, M.
Bilgin, C. C.
Gerdaneri, O.
Korpeoglu, I.
Ulusoy, O.
Çetintemel, U.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Computer Communications
Print ISSN
0140-3664
Electronic ISSN
Publisher
Elsevier BV
Volume
29
Issue
13-14
Pages
2450 - 2457
Language
English
Journal Title
Journal ISSN
Volume Title
Series
Abstract

We consider the problem of reliable data dissemination in the context of wireless sensor networks. For some application scenarios, reliable data dissemination to all nodes is necessary for propagating code updates, queries, and other sensitive information in wireless sensor networks. Epidemic algorithms are a natural approach for reliable distribution of information in such ad hoc, decentralized, and dynamic environments. In this paper we show the applicability of epidemic algorithms in the context of wireless sensor environments, and provide a comparative performance analysis of the three variants of epidemic algorithms in terms of message delivery rate, average message latency, and messaging overhead on the network. © 2006 Elsevier B.V. All rights reserved.

Course
Other identifiers
Book Title
Citation
Published Version (Please cite this version)