Narrow Results

In all of the routing protocols of Ad hoc networks, GPSR based on geographical information is a robust protocol with broad prospects. GPSR is composed of greedy algorithm and perimeter forwarding algorithm. While there are many packets need to be perimeter forwarded, it may produce lots of hops. This paper analyses perimeter forwarding firstly; and then puts forward an improving approach plus a stack in the memory of each forwarding node. The detailed steps are described in this paper to present the improved algorithm as well. Based on the theory demonstrations, we concluded that the improved algorithm can reduce routing hops and time complexity obviously. Furthermore, it can be implemented easily to improve routing performance. The innovation of this paper is that the time complexity is reduced by adding the space complexity.