An Algorithm for Finding the Most Trsted Path Between Entities Based on Selected Mechanism

An algorithm for finding the most trusted path between entities based on selected mechanism is proposed in this paper. This algorithm can filter out irrelevant paths by using the idea of dynamic planning, leverage of the key feature of multiplication relationship and information feedback. And thus it solves the malicious entity disturbance, trust paths explosion and path loop issues. The simulation results show that this algorithm can effectively isolate malicious entities, and has the advantage of small communication traffic and good convergence.