Authors: Ningning Cheng; Kannan Govindan; Prasant Mohapatra
Addresses: Department of Computer Science, University of California, Davis, CA 95616, USA. ' Department of Computer Science, University of California, Davis, CA 95616, USA. ' Department of Computer Science, University of California, Davis, CA 95616, USA
Abstract: Development of network of nodes connected with their trust values and the propagation of these trust values to far away nodes are basic operations of the modern day trustworthy networks. Trust can be exploited to mitigate the security threats in wireless network. Most of the existing trust propagation methods are based on flooding trust information, which puts a heavy burden on wireless communication, especially in ad hoc network and sensor network. In this paper, we propose a rendezvous based trust propagation scheme. Trust requester and trust provider send out trust-request and computed-trust tickets respectively, which will meet in some common rendezvous node with certain probability. Computed-trust will then be propagated to the requester. We carry out detailed performance evaluations of our scheme. The results show that our method achieves up to 66% overhead reduction in trust propagation compared to flood based methods.
Keywords: trust propagation; ad hoc networks; rendezvous; network security; trustworthiness; wireless networks.
International Journal of Security and Networks, 2011 Vol.6 No.2/3, pp.112 - 122
Received: 08 May 2021
Accepted: 12 May 2021
Published online: 11 Nov 2011 *