By using of simulator Omnet++,the performances of pure geographic routing and geographical routing are compared.

As dynamic changes of topology, position-based routing algorithm and security routing are focuses and key points in this field.

Then we would illustrate and qualitative compare existed location-aided routing protocols and recovery strategies corres.

The impact of forwarding strategies in location-based routing for average number of hops was analyzed.

The basic idea of position based routing algorithm is to select the next hop based on the position information of nodes, and forward the packets to the direction of destination.

In this paper, we classify the geographic routing algorithms into three classes according existing algorithms: planarizing based algorithm, characteristic nodes based algorithm and topology based algorithms.

We propose a geographic routing protocol in this dissertation, it is composed of localization algorithm and routing algorithm.

To solve the problem that the geographic routing using traditional greedy metric decreases the packet delivery rate on non-ideal communication links,a new routing metric SRAB for geographic routing is proposed and implemented based on link quality.