Computing of trust in ad-hoc networks

Abstract

Although, the notion of trust has been considered as a primitive for establishing relationships among nodes in ad-hoc networks, syntax and metrics of trust are not well defined. This paper studies computing of trust in ad-hoc networks and makes the following three contributions. Firstly, the notion of trust is formalized in terms of predict functions and strategy functions. Namely, the notion of trust in this paper is defined as a predict function that can be further evaluated by a strategy function for a pre-described action; Secondly, structures of trust are formalized as a map between a path in the underlying network graph, and the corresponding edge of its transitive closure graph; Thirdly, a generic model for computing of trust in the small world is proposed. © IFIP International Federation for Information Processing 2006.