A Novel Method for Evaluating Trustworthiness between Strangers in Large, Dynamic Ad Hoc Networks

The performance of ad hoc networks depends on cooperation and trust among distributed nodes. To enhance security in ad hoc networks, it is important to evaluate trustworthiness of other nodes without centralized authorities. In this work, we are focusing on the evaluation of trustworthiness between two strangers in large, dynamic ad hoc networks. This novel evaluation process is modeled as a common problem on two trust graphs, where nodes represent entities, and edges represent trust relations. According to the character of quasi-clique, we show how two strangers can efficiently establish an indirect trust relationship in large, dynamic ad hoc networks without a centralized trust authority.