Geographical routing protocols have several desirable features for use in ad hoc and sensor networks but are susceptible to voids and localization errors. Virtual coordinate systems are an alternative solution to geographically based routing protocols that works by overlaying a coordinate system on the sensors relative to well-chosen reference points. VC is resilient to localization errors; however, we show that it is vulnerable to different forms of the void problem and have no viable complementary approach to overcome them. Since the sensor node’s distribution in a wireless sensor network (WSN) is irregular, geographic routing protocols using the greedy algorithm can cause local minima problem. This problem may fail due to routing voids and lead to failure of data transmission. Based on the virtual coordinate mapping, this paper proposes an efficient bypassing void routing protocol to solve the control packet overhead and transmission delay in routing void of WSN. In the existing system, solve void problem by using virtual location information. Furthermore, routing voids still exist in the network. In this project the system proposed an efficient bypassing void routing protocol based on virtual coordinate mapping (BVR-VCM). Since the virtual mapping circle of void constitutes the structure without routing void, packets can bypass the void, and that the location of source node or destination node has no influence on the greedy algorithm. BVR-VCM and GPSR decrease as routing void size increases, but ratio in AODV keeps around 95%. Because AODV is based on flooding, it has high probability to establish a path between source and destination.