Virtual destination based geographic routing in ad hoc mobile networks

A new algorithm is proposed to forward packet when greedy forwarding fails. The concept of virtual destination is introduced and virtual destination based geographic routing protocol is brought forth. The protocol only uses greedy scheme which is different from existing geographic routing protocols which use greedy scheme and face algorithm. We evaluate our proposed scheme by random connected unit graph. The results show that our routing protocol is superior to the greedy perimeter stateless routing (GPSR) in term of average number of hops in connected ad hoc networks.