Abstract
In wireless sensor networks usually taken in routing void problem in geographical routing in high control overhead and transmission delay .The routing void protocol is proposed in this paper is efficient bypassing void routing protocol. This protocol based on virtual co-ordinates is to transform a structure of random process in virtual circle .The circle are composed by void edge in to by mapping of edge nodes. In this paper to used the greedy forwarding algorithm. This algorithm can be process on virtual circle. The virtual circle greedy forwarding failing on routing void process. There are forwarding process are source to destination. The proposed protocol as find the shortest path, long transmission and High quality link maintenance.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
