CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
A comparison of epidemic algorithms in wireless sensor networks
Authors
M. Akdere
C. Bilgin
+4 more
U. Cetintemel
O. Gerdaneri
I. Korpeoglu
O. Ulusoy
Publication date
21 August 2006
Publisher
'Elsevier BV'
Doi
Cite
Abstract
Cataloged from PDF version of article.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
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Bilkent University Institutional Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:repository.bilkent.edu.tr:...
Last time updated on 12/11/2016