Hierarchical time-vector-routing for mobile ad hoc networks

Author

Habetha, Joerg ; De No, Diego Calvo

Author_Institution

Philips Res. Lab., Aachen, Germany

Volume

1

fYear

2001

fDate

11-14 Jun 2001

Firstpage

256

Abstract

A new routing algorithm called hierarchical time-vector-routing is presented. The algorithm presumes that the network is divided into logical clusters. In each cluster a so-called central controller stores the routing information and exchanges it with its neighbouring central controllers. Each routing entry contains a time vector which is used to react to dynamic topology changes and to minimise the amount of exchanged routing information. The presented algorithm is well suited for mobile ad hoc networks. The algorithm has been especially designed for a centralised ad hoc network based on the HIPERLAN/2 standard but may be used in any ad hoc network configuration. The performance of the algorithm is analytically compared to the performance of the dynamic source routing protocol

Keywords

centralised control; mobile radio; packet radio networks; protocols; telecommunication network routing; HIPERLAN/2 standard; central controller; dynamic source routing protocol; dynamic topology changes; exchanged routing information minimisation; hierarchical time-vector-routing; logical clusters; mobile ad hoc networks; Ad hoc networks; Algorithm design and analysis; Centralized control; Clustering algorithms; Communication system control; Communications technology; Delay; Routing protocols; Spread spectrum communication; Telecommunication traffic;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 2001. ICC 2001. IEEE International Conference on

Conference_Location

Helsinki

Print_ISBN

0-7803-7097-1

Type

conf

DOI

10.1109/ICC.2001.936313

Filename

936313