Knowledge of the physical location of the nodes is known to improve performance in wireless networks. This is especially true in MANETs, where routing protocols face a continuously changing topology. In the past, routing protocols such as Beacon-Less Routing (BLR) used the location information of the nodes to build the forwarding path in a distributed manner. In this work, we borrow the forwarding approach in BLR and apply it in the route discovery process of DYMO. Under the assumption of nodes knowing their own location, the receiving nodes will compute a delay. The node with lower delay will resend the RREQ first. The rest of forwarding nodes will drop the RREQ once they receive this first RREQ. Thus the best forwarding node is selected in a distributed manner. This modification is expected to reduce the amount of RREQs circulating in the network, lessening the routing overhead.