PGA:Optimal-path-based Geographic Routing Arithmetic in Ad Hoc Networks
Wu B. Guo · 2008
A new optimal-path based geographic routing arithmetic in Ad hoc networks (PGA) and its modified version H-PGA are purposed in the article. The concept of optimal path is applied in all parts of my arithmetic, including route path construction, routing, route recovering, gets the concave node problem in geographic routing well resolved. Even in large network, my arithmetic obtains high delivery ratio yet ( 96% when n=400, network degree=4), and real path length is comparable with shortest path. On another hand, table size of H-PGA is linear with n, the protocol loads of single node is about O(n) too. It give the arithmetic more application value.