A Novel Self-Configuring and Routing Algorithm for Mobile Ad Hoc Networks

Author

Yu, Qin ; Mao, Yuming

Author_Institution

Sch. of Commun. & Information Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu

fYear

2006

fDate

25-28 June 2006

Firstpage

1436

Lastpage

1440

Abstract

A novel network self-configuring and routing algorithm, KTRA (kernel tree routing algorithm) is proposed for mobile ad hoc networks. It converts the actual network topology into a logic tree topology, thus only partial routing information is needed to maintain for networking and routing, and the update requirement is restricted in the area of branch. Moreover, KTRA is characterized by low delay and high flexibility comparable to that of proactive and reactive routing algorithm. The empirical and simulation results demonstrate that KTRA is convergent and outperforms the traditional networking and routing algorithms

Keywords

ad hoc networks; mobile communication; telecommunication network topology; kernel tree routing algorithm; logic tree topology; mobile ad hoc networks; network topology; self-configuring algorithm; Automation; Circuit topology; Delay; Kernel; Logic; Mechatronics; Mobile ad hoc networks; Mobile communication; Network topology; Routing; KTRA; routing algorithm; self-configuring mobile Ad Hoc networks; tree topology;

fLanguage

English

Publisher

ieee

Conference_Titel

Mechatronics and Automation, Proceedings of the 2006 IEEE International Conference on

Conference_Location

Luoyang, Henan

Print_ISBN

1-4244-0465-7

Electronic_ISBN

1-4244-0466-5

Type

conf

DOI

10.1109/ICMA.2006.257840

Filename

4026300