The study and developments of communications in wireless networks has commanded on increasing interest of researchers in the last few years. Mobile ad hoc networks (MANETS) belong to the class of networks that do not need the support of wired access points for intercommunication. Mobile ad-hoc networks consist of nodes that may frequently move. We have proposed a new purely on-demand protocol which uses the heading direction angle of a mobile node to transmit a message in the network in order to find the best route to the destination .The protocol is designed to calculate the angel direction and to find the best route from the source to the destination. The performance of the new adaptive and dynamic routing algorithm for MANETs is based on the evaluation of the number of broken links between source and destination. Broken links are one of the most important performance evaluation metrics in Ad Hoc networks. We evaluate our proposed algorithm by comparison with the well known On-Demand (reactive) routing protocol called the Ad hoc On-Demand Distance Vector (AODV) protocol. The evaluation shows that, our algorithm provides a better performance by reducing the number of broken links than the AODV algorithm. We investigated various simulation scenarios with different node densities and our new algorithm outperforms AODV in all cases.