Infoscience

Conference paper

BISS: Building Secure Routing out of an Incomplete Set of Security Associations

We investigate secure routing in ad hoc networks in which security associations exist only between a subset of all pairs of nodes. We focus on source routing protocols. We show that to establish secure routes, it is in general not necessary that security associations exist between all pairs of nodes

Related material