Date Added: Jun 2009
Mobile ad hoc networks consist of mobile wireless devices which autonomously organize their infrastructure. In such a network, a central issue, ensured by routing protocols, is to find a route from one device to another. Those protocols use cryptographic mechanisms in order to prevent a malicious node from compromising the discovered route. The authors present a calculus for modeling and reasoning about security protocols, including in particular secured routing protocols. Their calculus extends standard symbolic models to take into account the characteristics of routing protocols and to model wireless communication in a more accurate way.