Geometric ad-hoc routing: of theory and practice

By Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Zollinger. ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2003

781 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/df95313d039a42db71f7857aaadb0c272a1a7d4a

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

In Electrical and Electronic Engineering

Citations in the corpus

The holes problem in wireless sensor networks: a survey (2005, methodology): “As an extension to the compass routing II algorithm, [41] introduced deterministic fall back mechanism to get back in the greedy mode from the perimeter routing mode without necessarily exploring the complete face boundary.”
Trajectory based forwarding and its applications (2003, methodology): “The problem is usually addressed by planarizing the network graph and applying detour algorithms, such as FACE [14], GPSR [15], or GOAFR+ [16], that avoid obstacles using the right hand rule strategy that work well for straight line delivery.”
J-Sim: a simulation and emulation environment for wireless sensor networks (2006, background): “…the network topology of a WSN may change dynamically and the multihop routing protocol has to adapt to the topology change (e.g., ad hoc routing such as Ad-hoc On-demand Distance Vector routing (AODV) [51] or geometric routing such as Greedy Perimeter Stateless Routing (GPSR) [39], [43], [44]).”
Geographic Routing Using Hyperbolic Space (2007, methodology): “For more sophisticated cost measures, [2] presents a combination of greedy routing and face routing which is asymptotically optimal for bounded-degree unit disk graphs.”
Geographic routing made practical (2005, methodology): “work perfectly on the CLDP-derived routable subgraphs, such as GPSR’s combination of greedy- and perimetermode traversals [13], and GOAFR’s improvement that uses ellipses to bound face traversals when possible [17].”
Worst-Case optimal and average-case efficient geometric ad-hoc routing (2003, methodology): “(Using clustering techniques a similar result can be achieved without the Ω(1)-model [1, 9, 17].”
Efficient geographic routing in multihop wireless networks (2005, methodology): “Our proposed metric is best understood in the context of greedy mode in geographic routing, but it can also be used with schemes that route around voids [3, 9].”
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.”
Geographic routing without location information (2003, methodology): “Dealing with voids is a fairly well-understood problem5 with algorithms such as GFG/GPSR, are more recently GOAFR+ [26], which is shown to be both average case ef.cient and worst case optimal.”
VANET Routing on City Roads Using Real-Time Vehicular Traffic Information (2009, background): “, GPSR [12], GFG [10], and GOAFR [11], use node positions to route data between endpoints.”
Security and Cooperation in Wireless Networks (2007, neutral): “An example of this approach is the face routing algorithm [62] which has many variants including GFG (Greedy-Face-Greedy) [63], GPSR (Greedy Perimeter Stateless Routing) [219], and the GOAFR+ (Greedy Other Adaptive Face Routing) family of algorithms [241, 242].”
Beacon vector routing: scalable point-to-point routing in wireless sensornets (2005, background): “Geographic Coordinates: A different and potentially attractive solution for sensor networks is based on geographic routing [15, 1, 16].”