抄録
GPSR protocol is one of Geographic routing algorithm which uses greedy forwarding to forward packets to nodes that are always progressively closer to the destination. However, GPSR sometimes produces redundant routing when a planar graph is used to pass through a void area. In this paper a virtual area algorithm is proposed. Instead of the planar graph, it generates two virtual areas to handle the void problem which can reduce the redundant routing. The simulation results prove that it performs better than the GPSR in terms of the number of routing path and network lifetime.
