Research Of Clustered Based Trusted Routing Protocol In Vehicular Ad-Hoc Network

With the rapid development of auto industry and road traffic, the safety of the vehicle is becoming an important issue when people traveling with transport. In order to make the transportation safer and more effective, the inter-vehicle communication and it’s information technology which is a hot issue of academia has been taken seriously. The Vehicular Ad-Hoc Network, as a new type of Mobile Ad-hoc Networks, which focus on the features of the sensors on the vehicles and the trait of the cars’moving.The architectures of the ad-hoc network are:Planar and Clustering. Taking the characteristics of the VANET (Vehicular Ad-Hoc Network) into consideration, the clustering protocol is more suitable for the VANET which has frequent topology changes and fast-moving cars. In the existing clustering protocols, the WCA algorithm (Weighted Clustering Algorithm) is based on the nodes’ relevant traffic information as weighted factors. The results of the experiments infer that the WCA algorithm has excellent performance and good load balancing.In order to solve the safety problem of the WCA, this essay proposed a new type of trust routing algorithm called trust-WCA which not only keep the excellent performance and good load balancing but also solve the case that including selfish nodes(only receiving not forwarding date packets).Finally, we will do several experiments to compare the two algorithms with QUALNET and MATLAB in aspect of packet arrival rate and end-to-end average delay. The results of the simulations show that the algorithm is able to maintain the good communication in the case of the presence of selfish nodes.