Geometric Ad-Hoc Routing: Of Theory and Practice
Fabian Kühn, Roger P. Wattenhofer, Yan Zhang, Aaron Zollinger · Repository for Publications and Research Data (ETH Zurich) · 2003
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 assump tion that the distance between network nodes may not fall below a constant value, an assumption that cannot be main tained for practical networks. Abandoning this assumption we identify from a theoretical point of view two fundamen tamentally different classes of cost metrics for routing in ad-hoc networks.