摘要

The method geographic forwarding is that node uses its neighbor's location information to forward data packets. Node doesn't need to know the whole network topology but its one hop neighbor's information. Although this method can reduce the size of the routing table and network flooding, it might encounter the situation called "Dead end" that the relay node can not help the data keep forwarding. We propose to find a prior path before using geographic forwarding. This method first divide the network into several square, and each square have its own ID. Each square will have an agent voted by nodes with the same square ID. The agent will perform A* algorithm to find a reference path to source node, and source node then using geographic forwarding to avoid the dead end situation.