Worst-Case optimal and average-case efficient geometric ad-hoc routing

By Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger. ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2003

611 citations recorded by the source corpus.

Subfields: Aerospace Engineering, Computer Networks and Communications, Electrical and Electronic Engineering

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

How researchers see this paper

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

In Aerospace Engineering

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

A Survey on Routing Protocols for Large-Scale Wireless Sensor Networks (2011, background): “The protocols falling into this part include Geographic Adaptive Fidelity (GAF [16]), Geographic and Energy Aware Routing (GEAR [17]), Greedy Other Adaptive Face Routing (GOAFR [18]), and Span [19], etc.”
Ad hoc networks beyond unit disk graphs (2003, methodology): “The number of nodes as well as the number of edges of GG(S(GBG)) in a given area A is proportional to A and therefore, the O c(2) cost also directly follows from the respective analyses in [20, 21, 22].”
XTC: a practical topology control algorithm for ad-hoc networks (2004, neutral): “For instance, it is popular (and often for free) to ask the remaining graph to be planar in order to run a geometric (a.k.a. geographic, location-based, position-based) routing algorithm, such as GOAFR/GOAFR+ [11], [13], or GFG/GPSR [2], [9].”
J-Sim: a simulation and emulation environment for wireless sensor networks (2006, background): “, 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]).”
Security and Cooperation in Wireless Networks (2007, methodology): “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].”
Topology control in wireless ad hoc and sensor networks (2005, methodology): “If the routing graph is used in conjunction with a geographic routing protocol (such as the protocols presented in (Bose et al. 2001; Karp and Kung 2000; Khun et al. 2003)), then planarity is a fundamental property to guarantee message delivery.”
Wireless sensor networks: A survey on the state of the art and the 802.15.4 and ZigBee standards (2007, background): “GOAFR [68] and GOAFR+ [69] are a refinement to GPSR that provides a worst case optimal and average case efficient algorithm by restricting face traversal to an adaptively resized area.”
Energy-efficient forwarding strategies for geographic routing in lossy wireless sensor networks (2004, background): “A number of papers in the past few years have presented face/perimeter routing techniques to complement and enhance greedy forwarding [1, 3, 5].”
A survey on sensor localization (2010, background): “The advantages of LR protocols include better scalability and less overhead caused by dynamic changes in topology [ 2 ].”
Geographic and Opportunistic Routing for Underwater Sensor Networks (2016, background): “The communication void region problem occurs whenever the current for-warder node does not have a neighbor node closest to the destination than itself, i.e., the current forwarder node is the closest one to the destination [11].”
Locating and bypassing routing holes in sensor networks (2004, background): “Greedy forwarding combined with localized search and backtrack [15], [16] routes”
Geometric ad-hoc routing: of theory and practice (2003, methodology): “Our geometric routing algorithm GOAFR (pronounced as “gopher-plus”) combines—similarly to earlier proposals [4, 6, 15, 20]—two concepts called greedy routing and face routing.”
Routing techniques in wireless sensor networks: a survey (2004, methodology): “• The Greedy Other Adaptive Face Routing (GOAFR): In [47], a geometric ad-hoc routing algorithm combining greedy and face routing was proposed.”