Routing based on location information have alternatived the routing based on topology in wireless sensor networks. Greedy forwarding technique has been used very effectively to forward packets from source to destination. However, the drawback of this type of forwading is easy to fail to meet holes. As such, it will use recovery routing on planar graphs to put. packets through the holes. In this paper, the authors use two planar graph, RNG (Relative Neighbor Graph) and GG (Gabriel Graph) in the recovery routing. Through simulation, evaluating about recovery routing on planar graphs RNG and GG, the authors saw the recovery routing on graph RNG for better results in terms of the percentage distribution of packets from source to destination successfully, cost of routing protocol used.