Achieving loop-free incremental routing in ad hoc networks

We present the dynamic incremental routing (DIR) protocol, which features instantaneous loop-free routing of data packets based on their destination addresses (hop-by-hop routing). Loop-free routes are maintained by using "feasible distances" to order the nodes with respect to a destination. Simulation results show that the performance of DIR is much better than the performance of AODV, DSR and OLSR, which are indicative of the state of the art in routing protocols.