Beacon vector routing: scalable point-to-point routing in wireless sensornets
By Rodrigo Fonseca, Sylvia Ratnasamy, Jerry Zhao, Cheng Tien Ee, David E. Culler, Scott Shenker, Ion Stoica. Symposium on Networked Systems Design and Implementation, 2005
393 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/ca79de9d44221cbd241b34f1d75c73291441b5cd
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Omprakash Gnawali
- P. Levis
- Chiara Petrioli
- Stefano Basagni
- Rodrigo Fonseca
- Paolo Baronti
- Kyle Jamieson
- Robert D. Kleinberg
Citations in the corpus
- Localization Algorithms and Strategies for Wireless Sensor Networks: Monitoring and Surveillance Techniques for Target Tracking (2009, unknown): “These results are confirmed experimentally by (Fonseca et al., 2005).”
- ALBA-R: Load-Balancing Geographic Routing Around Connectivity Holes in Wireless Sensor Networks (2014, methodology): “This category includes algorithms using virtual coordinates [22], [23], [24], [25], and those that perform some sort of topology warping [26].”
- Collection tree protocol (2009, background): “Other recent work in routing uses geographic location [15, 17], anchor beacons [11, 22], or DHT-like mechanisms [3] to achieve very highly-scalable routing.”
- Wireless sensor networks: A survey on the state of the art and the 802.15.4 and ZigBee standards (2007, methodology): “BVR [35] uses a set of randomly chosen anchor nodes and defines coordinates as the hop distances to such anchors.”
- Geographic Routing Using Hyperbolic Space (2007, background): “Thus the isometry group of H is identified with the group PSL2(R) of two-by-two real matrices with determinant 1, modulo {±I}.”