DDR: Distributed Dynamic Routing Algorithm for Mobile Ad hoc Networks

This paper presents an alternative simple loop-free bandwidth-efficient distributed routing algorithm for mobile ad hoc networks, denoted as distributed dynamic, routing (DDR). Although DDR benefits from classical concepts like zone and forest, unlike previous solutions it achieves several goals at the same time. Firstly, it provides different mechanisms to drastically reduce routing complexity and improve delay performance. Secondly, it is an infrastructureless in a strong sense: it does not even require a physical location information. Finally, zone naming is performed dynamically and broadcasting is reduced noticeably.