An improved routing mechanism based on trust value evaluation

Abstract

The model of indirect trust value is done further research in statistics principle and a new model of trust value is proposed. On this basis, the electoral method of cluster node is studied, and then a routing algorithm is given based on considering the trust value, the density, the distance between nodes and the forward capability. Experiment and simulation results show that the established trust value model is considerably reliable, and with the increase of cycles, the trust value gradually tends to 1. In a certain range about the number of nodes, in comparison with references 10 and 11, this algorithm improves convergence speed largely and is stable during the information transfer process. When the network topology changes, this algorithm can do fast rerouting, which shows this optimization algorithm has widely application.