Sciweavers

Share
MOBIHOC
2000
ACM

DDR: distributed dynamic routing algorithm for mobile ad hoc networks

9 years 1 months ago
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. Keywords—Ad hoc networks, graph-theoretic terminology, routing.
Navid Nikaein, Houda Labiod, Christian Bonnet
Added 01 Aug 2010
Updated 01 Aug 2010
Type Conference
Year 2000
Where MOBIHOC
Authors Navid Nikaein, Houda Labiod, Christian Bonnet
Comments (0)
books