Vehicular ad hoc networks (VANETs) have become a practical and valuable alternative for wide variety of novel applications in road safety, content sharing, payment at different commercial places, etc. Due to high mobility of vehicles resulting in frequent disconnections, geographic routing protocols are commonly preferred in VANETs as they do not require, route formation prior to forward as well as route maintenance. Most of the position based routing protocols adopt the greedy mode to establish the route and switch to some recovery mechanism like perimeter routing, in case of failure. However, if the probability of occurrence of perimeter mode is higher than the greedy mode, then the throughput as well as the end to end delay will be severely affected. This probability is highly influenced by many factors where in density being the major among these. In this paper, we propose a routing strategy that uses the restricted greedy forwarding by considering neighborhood vehicles having a sufficiently dense neighborhood and the least velocity variance with its own neighboring vehicles, as the next forwarder. The objective is to increase the longevity of the route and thus increasing the throughput without greatly affecting the end to end delay. The performance of the proposed approach is compared with GPSR and the simulation results are presented.