A calculus of trustworthy ad hoc networks

作者：Merro Massimo^*; Sibilio Eleonora

来源：Formal Aspects of Computing, 2013, 25(5): 801-832.

DOI：10.1007/s00165-011-0210-7

• Mobile ad hoc network
• Trust management system
• Trust-based routing
• Process calculus
• Non-interference

We propose a process calculus for mobile ad hoc networks which relies on an abstract behaviour-based multilevel trust model. The operational semantics of the calculus is given in terms of a labelled transition system, where actions are executed at a certain security level. We define a labelled bisimilarity over networks parameterised on security levels. Our bisimilarity is a congruence and an efficient proof method for an appropriate variant of barbed congruence, a standard contextually-defined program equivalence. Communications in the calculus are safe with respect to the security levels of the involved parties. In particular, we ensure safety despite compromise: compromised nodes cannot affect the rest of the network. A non-interference result is also proved in terms of information flow. Finally, we use our calculus to provide formal descriptions of trust-based versions of both a routing protocol and a leader election protocol for ad hoc networks.

• 出版日期2013-9