Work

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

Year: 2003
Type: article
Abstract: 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; a fraction of security associations is su#cient. We analyze the performance of existing proposals for secure routing in such conditions. We also propose a new protocol, designed specifically for ad hoc networks with an incomplete set of security associations between the nodes. We call this protocol BISS: a protocol for Building Secure Routing out of an Incomplete Set of Security Associations. We present a detailed analysis of this protocol, based on simulations, and show that it can be as secure as the existing proposals that rely on a complete set of security associations.
Language: English
Open Access status: green
OpenAlex ID: W7017591646
FWCI: 0.679
Cites:
Cited by: 4
Related to: 10