This paper proposes a new position-based Routing protocol for Mobile Ad hoc networks, referred to as FORTEL. According to FORTEL, each node in the network maintains a location table that stores the location of all the other nodes. To discover a route to the destination, the source node relies on the location table to construct the destination's connectivity tree, which includes all the destination's possible neighbors (1st, 2nd ... nth hop neighbors), according to which the end-to-end path consisting of the minimum number of hops is extracted. The main challenge of any designed routing algorithm is the robustness against the nodes' mobility, while maintaining higher level of packet delivery rate in high mobility scenarios. The simulation results show that the proposed work achieves 20% higher delivery rate as opposed to existing MANET protocols such as DSR and OLSR.