GPS based localized routing algorithms for wireless networks.

Abstract

We discuss routing algorithms for wireless networks with the goal of achieving high (or guaranteed) delivery rate and increasing the node life in the network. Some know methods were studied: Most Forward within Radius (MFR) and directional algorithm (DIR). We propose some new location based routing algorithms: the constant metric GEographic DIstance Routing (GEDIR) algorithm and several power-aware algorithms: power efficient, cost efficient and power-cost efficient routing algorithms. 2-hop, flooding and multiple-path variants are also suggested for the algorithms with constant metric to reach a higher delivery rate while minimizing the network resource (bandwidth etc.) usage. We will also study the quantitative metrics used to evaluate the performance of routing algorithms: delivery rate, hop count, flooding ratio, power consumption, network lifetime, etc. Simulation experiments with static random unit graphs were designed to compare the performance of all the routing algorithms discussed. Data were collected and analyzed after each set of simulation. The study reveals that there is no clear winder, and different algorithms have their own strength in different network context.