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

In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive simulation. GOAFR is the first ad-hoc algorithm to be both asymptotically optimal and average-case efficient. For our simulations we identify a network density range critical for any routing algorithm. We study a dozen of routing algorithms and show that GOAFR outperforms other prominent algorithms, such as GPSR or AFR. Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems--geometrical problems and computations, routing and layout; C.2.2 [Computer-Communication Networks]: Network Protocols--routing protocols General Terms Algorithms, Performance, Theory Keywords Ad-Hoc Networks, Face Routing, Geometric Routing, Network Connectivity, Performance, Routing, Simulation, Wireless Communication

• Type: Conference
• Year: 2003
• Where: MOBIHOC
• Authors: Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
• Keywords: Ad-hoc Algorithm, Ad-hoc Routing Algorithm, Face Routing, MOBIHOC 2003, Wireless Networks