MobiHoc, 1st Annual Workshop on Mobile Ad Hoc Networking and Computing, August 11th 2000, Boston, USA
This paper presents an alternative simple loop-free bandwidth-efficient distributed routing algorithm for mobile ad hoc net-works, 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.
Type:
Conférence
City:
Boston
Date:
2000-08-11
Department:
Systèmes de Communication
Eurecom Ref:
473
Copyright:
© 2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
See also:
