Virtual naming and geographic routing on wireless sensor networks

We consider the problem of routing with guaranteed de- livery in wireless sensor networks where physical locations of the sensors are not known. We propose a naming proto- col which defines a 2-dimensional coordinate system and a routing protocol (Ibrid) which ensures guaranteed delivery of packets. We show by means of simulation that in realis- tic settings where the network includes voids and obstacles, Ibrid finds routess hortest than those obtained with existing geographic routing algorithms over physical coordinates.