Geometric ad-hoc routing: of theory and practice

All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc routing. In particular we consider two aspects: We propose a new geometric routing algorithm which is outstandingly efficient on practical average-case networks, however is also in theory asymptotically worst-case optimal. On the other hand we are able to drop the formerly necessary assumption that the distance between network nodes may not fall below a constant value, an assumption that cannot be maintained for practical networks. Abandoning this assumption we identify from a theoretical point of view two fundamentamentally different classes of cost metrics for routing in ad-hoc networks. Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems—geometrical problems and computations, routing and layout; G.2.2 [Discrete Mathematics]: Graph Th...

• Type: Conference
• Year: 2003
• Where: PODC
• Authors: Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Zollinger
• Keywords: Ad-hoc Routing, Distributed And Parallel Computing, Geometric Routing, Geometric Routing Algorithm, PODC 2003