*3.3.4 Geographical routing*

It is a unique routing scheme in which it forwards the packets with the knowledge on the position of the node which is being communicated instead of the topology-based method. Geographical routing algorithm (single-path greedy routings) finds difficulty in delivering the data, if the path is available between source and the destination as data forwarding with the help of current location information.

Data delivery is guaranteed by using planar-graph-based geographic routing algorithms but results in more overhead information.
