Computers and Industrial Engineering
Hi-index | 0.00 |
The paper proposes a geographic routing based on A-star algorithm. The routing applies A-star algorithm after being reformed in ad hoc networks, which can not only resolves the problem of what to do at local minimum node where greedy forwarding fails, but also can avoid the complexity to construct and manage the routing planar graph in the planar graph routing. Simulations show that the proposed routing performs well in routing protocol message cost and packet delivery success rate.