Font Size: a A A

Research Of Clustering Routing Protocol In Ad Hoc Network

Posted on:2013-01-25Degree:MasterType:Thesis
Country:ChinaCandidate:Z Z FuFull Text:PDF
GTID:2218330371457425Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Wireless Ad Hoc Network is a multi-hop and temporary mobile autonomous system, which consists of a group of mobile nodes with wireless transmitters and receivers. With Limited energy of nodes and frequently changed topology, it can't use communication way of the traditional networks.From the perspective of network logical view, proposed routing protocol for AdHoc networks can be divided into flat routing and clustering routing protocol. But with the expansion of the network, especially in the case of the nodes frequently moving, the features of big control overhead and poor scalability which flat routing protocol has make it difficult to adapt to the needs of the network. Clustering routing protocol can reduce the impact of the changed topology on routing protocols, and improve the network scalability and reduce routing overhead. Therefore, clustering routing as the main research direction of this article will be discussed.This paper outlines the background of the Ad Hoc network architecture, applications and key technologies. First in this paper, the clustering algorithm is described. Several typical clustering algorithm are introduced, focus on analyzing and summarizing of the existing clustering algorithm. Then, it analyzes the clustering routing technology research. It describes several typical clustering routing protocols, highlighting the basic idea and working mechanismof the CBRP protocol, the problems in the cluster routing protocol. At last, to solve the above problems, a new clustering routing protocol based on Ant Colony Algorithm CRBAC is proposed. Protocol optimizes the clustering algorithm using node energy consumption and the relative connectivity as the factor of weights. On the other hand, it optimizes Ant Colony Algorithm using node residual energy and the link distance as the factor of pheromone updating. Finally, the improved ant colony algorithm is applied to the cluster routing stage. NS2 simulation results show that, in the circumstance that the algorithm doesn't significantly increase the routing overhead, improved clustering routing protocol CRBAC get better performance than CBRP. They reflect on the cluster structure more reasonable and stable, the average end-to-end delay and network lifetime significantly improved better robustness under network environments of limited node energyand frequent topology changes.
Keywords/Search Tags:Ad Hoc Network, CBRP, Clustering Algorithm, Ant Colony Algorithm, Cluster Routing Algorithm
PDF Full Text Request
Related items