Rumor routing algorthim for sensor networks
By David Braginsky, Deborah Estrin. ACM International Conference on Wireless Sensor Networks and Applications, 2002
741 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/21533934935021954a598f893eb0ce10b296b157
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Jyoti Prakash Singh
- Prabhat Kumar
- Sunil Kumar Singh
- Li-Minn Ang
- Adamu Murtala Zungeru
- Kah Phooi Seng
- Joseph Y. Halpern
- Erran L. Li
Citations in the corpus
- A Survey on Successors of LEACH Protocol (2017, methodology): “[7] D. Braginsky and D. Estrin, ‘‘Rumor routing algorthim for sensor networks,’’ in Proc.”
- Source-location privacy in energy-constrained sensor network routing (2004, neutral): “Probabilistic flooding [4, 7] was first proposed as an optimization of the baseline flooding technique to cut down energy consumption.”
- Classical and swarm intelligence based routing protocols for wireless sensor networks: A survey and comparison (2012, background): “RR (Akkaya and Younis, 2005; Braginsky and Estrin, 2002; Patra et al., 2010) is another improved version of Directed Diffusion.”
- Gossip-based ad hoc routing (2002, background): “• Braginsky and Estrin [4] propose rumor routing for routing”
- Wireless Sensor Network Security: A Survey (2006, background): “It is based upon rumor routing described in [8].”
- Enhancing Source-Location Privacy in Sensor Network Routing (2005, neutral): “Probabilistic flooding [16, 17] was first proposed as an optimization of the baseline flooding technique to cut down energy consumption.”