Research On Routing Algorithm In Hierarchical Ad Hoc Networks

Mobile Ad Hoc Networks is a multi-hop autonomous system composed by a group ofmobile terminals with wireless transmitters. The traditional network routing algorithm cannotapply to Ad Hoc network, because Ad Hoc network is a non-central, autonomous system thatis different from fixed cable network and traditional wireless network. The improved routingprotocols should be researched in order to meet the requirements of mobile Ad Hoc network.The technology of Ad Hoc network based on large scale network became a hot researcharea. However, with the network scale enlarged, the structure of network became complex,the route hops, optional routing number and complexity of the routing optimization are allincreased dramatically. Also, the probability of the link breaks is increased, because thefactors that influence the reliability of inter-cluster routing grow in number. The performaceof routing become poor. So it needs to design routing protocols with strong robustness tomeet these characteristics.In this dissertation, based on the research of hierarchical routing protocols, aninter-cluster routing algorithm which takes the optimization of link reliability as goals isdesigned, by introducing ant colony algorithm into routing. Firstly, Ad Hoc network and itsrouting protocols is introduced, especially, hierarchical routing protocals which is fit for thelarge-scale networks. The development trend of current routing algorithm and the key designof inter-cluster routing is analyzed. Secondly, several factors which influence the reliability ofinter-cluster routing are discussed and quantified. The corresponding weights are defined andserved as the standard to judge the quality of routing. Thirdly, the theory and procedures ofant colony algorithm is elaborated. The model of ant colony algorithm based on hierarchicalAd Hoc is given, which can satisfy the demands of inter-cluster routing. At last, aninter-cluster routing algorithm based on ant colony optimization is designed and verify theirvalidity through simulation software. The simulation results show that the algorithm iseffective to reduce the flooding overhead, increase the probability of optimization andenhance the reliability of inter-cluster routing.