Date Added: May 2011
Geographic Forwarding (GF) algorithms typically employ a neighbor discovery method to maintain a neighborhood table that works well only if all wireless links are symmetric. Recent experimental research has revealed that the link conditions in realistic wireless networks vary significantly from the ideal disk model and a substantial percentage of links are asymmetric. Existing GF algorithms fail to consider asymmetric links in neighbor discovery and thus discount a significant number of potentially stable routes with good one-way reliability. In this paper, the authors introduce Asymmetric Geographic Forwarding (A-GF), which discovers asymmetric links in the network, evaluates them for stability (e.g., based on mobility), and uses them to obtain more efficient and shorter routes.