Secure link state routing for mobile ad hoc networks

By Panos Papadimitratos, Zygmunt J. Haas. 2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings., 2003

533 citations recorded by the source corpus.

Secure operation of the routing protocol is one of the major challenges to be met for the proliferation of the mobile ad hoc networking (MANET) paradigm. Nevertheless, security enhancements have been proposed mostly for reactive MANET protocols. The proposed secure link state routing protocol (SLSP) provides secure proactive topology discovery, which can be beneficial to network operation in a number of ways. SLSP can be employed as a stand-alone protocol, or fit naturally into a hybrid routing framework, when combined with a reactive protocol. SLSP is robust against individual attackers, is capable of adjusting its scope between local and network-wide topology discovery, and is capable of operating in networks of frequently changing topology and membership.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/9f170bb96f07030373c09e4e75537ec200042b32

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Security in mobile ad hoc networks: challenges and solutions (2004, background): “Link State Routing — Secure Link State Routing (SLSP) [16] is a link state routing protocol for ad hoc networks.”
Securing ad hoc routing protocols (2004, background): “The Secure Routing Protocol (SRP [18, 19, 20, 22, 21]) requires a common session key; using a message authentication code, routing messages can be verified in any node on their way between source and destination.”
Security and Cooperation in Wireless Networks (2007, background): “Several groups of researchers have studied the problem of securing ad hoc network routing protocols, including Papadimitratos and Haas [300, 302, 303, 304, 305]; Hu, Perrig, and Johnson [178, 182, 183]; Zapata and Asokan [391]; and Sanzgiri, Dahill, Levine, Shields, and Belding-Royer [338].”
Secure routing for mobile ad hoc networks (2005, methodology): “The BISS protocol (Building Secure Routing out of an Incomplete Set of Security Associations) [39] is a set of optimizations to existing ad hoc routing protocols that have been designed with the assumption that participating nodes have established an incomplete set of security associations between t”