Geographic routing made practical

By Young-jin Kim, Ramesh Govindan, Brad Karp, Scott Shenker. Symposium on Networked Systems Design and Implementation, 2005

480 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/60e6a9ff516b8daabe5c17c671a113ac7b4bfa88

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

A systematic review on routing protocols for Vehicular Ad Hoc Networks (2014, background): “For 200 node wireless network, most links in concurrent CLDP converges within 15–20 probes; each probe’s frequency is 15 s.”
Geographic Routing Using Hyperbolic Space (2007, background): “first distributed planarization algorithm for general graphs was discovered only very recently [11].”
Ad hoc networks beyond unit disk graphs (2003, background): “Lately, first experiences with geographic and in particular face routing in practical networks have been made [ 31 , 32].”
Hierarchical trust management for wireless sensor networks and its application to trust-based routing (2011, background): “Traditional geographic routing [5, 6] uses geographic location information to select the next forwarding node closest to the destination node, so that a message if delivered successfully may be delivered with the shortest delay.”
Wireless sensor networks: A survey on the state of the art and the 802.15.4 and ZigBee standards (2007, background): “CLDP [63] achieves 100% delivery in the face of wrong location information, obstacles, etc.”
Real-time Power-Aware Routing in Sensor Networks (2006, background): “For networks with large holes, RPAR needs to incorporate face routing mechanisms [22][23][24][25][26] to route packets around them.”
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.”
Boundary recognition in sensor networks by topological methods (2006, unknown): “, the extraction of a planar subgraph by the relative neighborhood graph or Gabriel graph [18]).”
ALBA-R: Load-Balancing Geographic Routing Around Connectivity Holes in Wireless Sensor Networks (2014, methodology): “To make planarization work on real networks a form of periodic signaling must be implemented to check that no links cross, as performed by the Cross-Links Detection Protocol (CLDP) [20].”