Greedy forwarding is efficient in geographic routing, however, it fails inevitably when routing voids are encountered due to the distribution of nodes in wireless sensor network. To solve the void problem, long path and high control packet overhead are usually involved. In this paper, a bypassing void routing protocol combining of geographic and virtual coordinate information is proposed. When routing void is encountered, edges nodes of routing void are assigned virtual coordinates located on a virtual circle and two different forwarding regions around void are established. By utilizing the virtual circle structure and two forwarding regions, greedy forwarding can work without failing. Simulation shows the proposed protocol has shorter path length, less control packet overhead and energy consumption.