In this paper, we propose distributed Dynamic Route Change Algorithm (DRCA) which dynamically finds a better (i.e., shorter) route to the destination using hello message of neighbor in ad-hoc on-demand distance vector (AODV) routing protocol. We first change the hello message format of AODV so that it can contain the list of recently forwarded destination, hop count, and sequence number. The nodes that receive this hello message decide whether they change the next hop to the destination or not by comparing the hop count and sequence number in their routing table to those in the received hello message. We compare the performance of DRCA with original AODV routing protocol and a comparable scheme, called Shrink, through extensive simulations using ns-3. We show that DRCA outperforms AODV and Shrink in PDR, average delay, and the number of transmissions at MAC layer.