We propose a routing algorithm based on AODV approach. We have modified AODV algorithm to obtain better performance. At the same time, we have tried to maintain the features of AODV algorithm by maintaining a backward compatibility in our proposed algorithm. Our algorithm tries to reduce RREQ packets which are broadcasted in original AODV to find routing paths. For this purpose our algorithm uses a location aware approach to find distance to sink node. It also makes use of busyness of nodes while selecting nodes to participate in route discovery mechanism. Also this scaling factor and busyness threshold can be made fixed for each node in the network depending on size and characteristics of the network.