Efficient Geometric Routing in Ad-hoc Wireless Networks

Abstract

Most geometric routing algorithms for ad-hoc wire- less networks rely on greedy forwarding strategies to deliver messages from their sources to destinations. However, there is no guarantee that paths produced by these protocols are optimal. In this paper, we present a Path Regression approach which improves the qualities of paths produced by all geometric routing protocols. Furthermore, we show the use of Path Regression in RFR which progressively looks for an optimal path that can only be produced by DSR. Extensive experiments show that the proposed algorithm out-performs other approaches such as GOAFR+ by a significant margin.