Research Of Vehicle Ad Hoc Network Cluster Router Algorithm

Ad Hoc network is a multi-hop, self-organization and no center network that consists of a set of mobile nodes with a wireless transceiver. Since the late 1990s, the technology of Ad Hoc network has developed rapidly in the field of wireless communication, and it has penetrated into various civilian communications from military communication soon. It is a typical example that Ad Hoc network is used into car communication.This paper researches in how to compose wireless network automatically and communicate between nodes on the battlefield that the troops deploy and promote quickly and in the environments that anti-disaster risk and disaster relief such as earthquake or flood-risk. The mobility and endless power support of car is combined with Ad Hoc network and is used in this technology.In the Ad Hoc network, the network topology is changing constantly as the nodes moving. It is a key and important problem of Ad Hoc network that select the routing that can arrives the propose nodes quickly and accurately. This paper researched the DSDV, WRP, DSR, AODV protocols and so on at first. Then we found that those protocols and theirs clustering algorithms lacked Adaptation in the environment that small communication delay, accurate and fast information, high degree of accuracy and high mobility were needed. This paper gives a new routing protocol that based on clustering structure and applies to special scene. We propose a new clustering algorithm at first and introduce the concept of constrained eigenvalues when the cluster-heAder is selected. The nodes that meet the conditions of constrains is selected and then they get weights. The node with minimum weight is selected at last. This method of cluster-heAder selection enhances the flexibility and scalability of network management and is suited to multi-environment Ad Hoc wireless networks. This paper proposes a routing protocol named NCCR on the basis of the new clustering algorithm. This protocol uses AODV as prototype, reduces the flood expenses of routing discovered and the impacts of routing algorithm coursed by mobile nodes and speeds up the process of routing finding.Finally, we compared the AODV with the NCGR that was proposed in this paper through network simulation experimental. It is proved that the performance of the NCGR protocol is better than the AODV protocol in the packet delivery rate, the packet average delay and routing control expenses.