Research And Improvement Of The Cluster Based On Routing Protocol In Ad-Hoc Network

Ad Hoc Network is a wireless mobile communication network which is composed with mobile nodes which have wireless device to send and receive information. It isn't dependent on fixed infrastructures. The neighbor nodes can achieve multi-hop relay communications making use of other intermediate nodes. For the equality, distributed control and self-organization characteristics, Ad Hoc network has extensive application perspectives in the emergency and military special circumstances. However, as the features such as topological dynamic changes, limited power and bandwidth links, one-way channel, security, the traditional routing protocol can't be used in Ad Hoc network, which bring a enormous challenge.The topology in Ad Hoc network consists of plane structure and hierarchical structure. The nodes in plane structure are fully equal. With the expansion of network and the enhancement of mobility, the information of maintenance exchanges frequently, leading to increased network latency and network congestion. Clustering is a normal method overcoming those shortcomings. The network is divided into some subsets - cluster; each cluster elect a cluster head, which constitude a high-level virtual backbone hierarchical network. The advantages of clustering routing protocols are scalability, unlimited size, less routing and control costs and easy management. So far, there are lots of research and results in clustering routing protocols.This article descirbes the characteristics and topology of Ad Hoc network, studies clustering algorithm and routing mechanism, and analyzes the CBRP protocol. CBRP make use of LOWED clustering algorithm, that makes uneven distribution; it isn't consider load balance, which results in lower ID nodes consume more energy power. When lower ID nodes move rapidly, the topologys change frequently, and routing costs increase rapidly. This paper summarizes the improved methods of clustering algorithm, and introduces MCBRP. MCBRP adopts AOW(adaptive on-demand weighted clustering algorithm) taking into account energy, number of adjacent cluster, connectivity and mobility. When the mobility of nodes is slow, MCBRP can enhance the stability of network, and reduce energy consumption and packet loss rate. However, as the clustering algorithm of MCBRP lack robustness, in the high-speed wireless network, random of node's mobility will aggravate the topology changes frequently, and increase routing and packet loss rate control expenses, so that the nodes consume more energy.On the basis of CBRP, this article raises ACRP(Ant-colony optimization clustering arithmetic based Cluster Routing Protocol), aimed at enhancing the Ad Hoc network performance in which fast mobility and frequent changes of topology. ACRP adopts heuristic clustering algorithm based on ACO which is robust and consider balanced the remaining energy, the number of adjacent cluster and the mobility. It realizes load balance of cluster head, and alleviates effectively the problem of excessive consumption, actualizing the stable number of cluster head, increasing stability, decreasing packet loss rate. Furthermore, on flooding RREQ, routing algorithm used innovativly diffuse step by step with Fibonacci Sequence, decreasing flooding control. Moreover, this paper establishes emulation model, compares with ACRP, MCBRP, CBRP with experiment, whose results prove ACRP's feasibility and validity.Finally, summing up this study, the article points out the shortage of ACRP and the issues to put forward for further study.