Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Gossip versus Deterministically Constrained Flooding on Small Networks
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Evaluation of gossip to build scalable and reliable multicast protocols
Performance Evaluation - Special issue: Distributed systems performance
Spatial gossip and resource location protocols
Journal of the ACM (JACM)
Directed flood-routing framework for wireless sensor networks
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Implementing aggregation and broadcast over Distributed Hash Tables
ACM SIGCOMM Computer Communication Review
Geographic routing with limited information in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
New routing framework base on rumor routing in wireless sensor networks
Computer Communications
Agent-based distributed decision-making in dynamic operational environments
Intelligent Decision Technologies
Geographic routing with limited information in sensor networks
IEEE Transactions on Information Theory
Mobile agent based event discovery in wireless sensor networks
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
A cross-layer architecture for autonomic communications
AN'06 Proceedings of the First IFIP TC6 international conference on Autonomic Networking
Association-rules mining based broadcasting approach for XML data
ADVIS'06 Proceedings of the 4th international conference on Advances in Information Systems
Cost-effective broadcast for fully decentralized peer-to-peer networks
Computer Communications
Journal of Network and Computer Applications
| Hi-index | 0.06 |
Rumor mongering (also known as gossip) is an epidemiological protocol that implements broadcasting with a reliability that can be very high. Rumor mongering is attractive because it is generic, scalable, adapts well to failures and recoveries, and has a reliability that gracefully degrades with the number of failures in a run. In this paper we present a protocol that superficially resembles rumor mongering but is deterministic. We show that this new protocol has most of the same attractions as rumor mongering. The one attraction that rumor mongering has - namely graceful degradation - comes at a high cost in terms of the number of messages sent. We compare the two approaches both at an abstract level and in terms of how they perform in an Ethernet.