SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks

Yih-Chun Hu, David B. Johnson, Adrian Perrig

Research output: Contribution to journalArticle

Abstract

An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vector approaches, they have generally assumed a trusted environment. In this paper, we design and evaluate the Secure Efficient Ad hoc Distance vector routing protocol (SEAD), a secure ad hoc network routing protocol based on the design of the Destination-Sequenced Distance- Vector routing protocol. In order to support use with nodes of limited CPU processing capability, and to guard against Denial-of-Service attacks in which an attacker attempts to cause other nodes to consume excess network bandwidth or processing time, we use efficient one-way hash functions and do not use asymmetric cryptographic operations in the protocol. SEAD performs well over the range of scenarios we tested, and is robust against multiple uncoordinated attackers creating incorrect routing state in any other node, even in spite of any active attackers or compromised nodes in the network.

Original languageEnglish (US)
Pages (from-to)175-192
Number of pages18
JournalAd Hoc Networks
Volume1
Issue number1
DOIs
StatePublished - Jul 2003
Externally publishedYes

Fingerprint

Wireless ad hoc networks
Mobile ad hoc networks
Routing protocols
Ad hoc networks
Network routing
Hash functions
Processing
Base stations
Program processors
Bandwidth
Network protocols

Keywords

  • Ad hoc network routing
  • Hash tree chains
  • Mobile ad hoc networks
  • SEAD
  • Same-distance fraud
  • Secure routing

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

SEAD : Secure efficient distance vector routing for mobile wireless ad hoc networks. / Hu, Yih-Chun; Johnson, David B.; Perrig, Adrian.

In: Ad Hoc Networks, Vol. 1, No. 1, 07.2003, p. 175-192.

Research output: Contribution to journalArticle

Hu, Yih-Chun ; Johnson, David B. ; Perrig, Adrian. / SEAD : Secure efficient distance vector routing for mobile wireless ad hoc networks. In: Ad Hoc Networks. 2003 ; Vol. 1, No. 1. pp. 175-192.
@article{ae0dc6d9a2224d1c801d9007213c73ff,
title = "SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks",
abstract = "An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vector approaches, they have generally assumed a trusted environment. In this paper, we design and evaluate the Secure Efficient Ad hoc Distance vector routing protocol (SEAD), a secure ad hoc network routing protocol based on the design of the Destination-Sequenced Distance- Vector routing protocol. In order to support use with nodes of limited CPU processing capability, and to guard against Denial-of-Service attacks in which an attacker attempts to cause other nodes to consume excess network bandwidth or processing time, we use efficient one-way hash functions and do not use asymmetric cryptographic operations in the protocol. SEAD performs well over the range of scenarios we tested, and is robust against multiple uncoordinated attackers creating incorrect routing state in any other node, even in spite of any active attackers or compromised nodes in the network.",
keywords = "Ad hoc network routing, Hash tree chains, Mobile ad hoc networks, SEAD, Same-distance fraud, Secure routing",
author = "Yih-Chun Hu and Johnson, {David B.} and Adrian Perrig",
year = "2003",
month = "7",
doi = "10.1016/S1570-8705(03)00019-2",
language = "English (US)",
volume = "1",
pages = "175--192",
journal = "Ad Hoc Networks",
issn = "1570-8705",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - SEAD

T2 - Secure efficient distance vector routing for mobile wireless ad hoc networks

AU - Hu, Yih-Chun

AU - Johnson, David B.

AU - Perrig, Adrian

PY - 2003/7

Y1 - 2003/7

N2 - An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vector approaches, they have generally assumed a trusted environment. In this paper, we design and evaluate the Secure Efficient Ad hoc Distance vector routing protocol (SEAD), a secure ad hoc network routing protocol based on the design of the Destination-Sequenced Distance- Vector routing protocol. In order to support use with nodes of limited CPU processing capability, and to guard against Denial-of-Service attacks in which an attacker attempts to cause other nodes to consume excess network bandwidth or processing time, we use efficient one-way hash functions and do not use asymmetric cryptographic operations in the protocol. SEAD performs well over the range of scenarios we tested, and is robust against multiple uncoordinated attackers creating incorrect routing state in any other node, even in spite of any active attackers or compromised nodes in the network.

AB - An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vector approaches, they have generally assumed a trusted environment. In this paper, we design and evaluate the Secure Efficient Ad hoc Distance vector routing protocol (SEAD), a secure ad hoc network routing protocol based on the design of the Destination-Sequenced Distance- Vector routing protocol. In order to support use with nodes of limited CPU processing capability, and to guard against Denial-of-Service attacks in which an attacker attempts to cause other nodes to consume excess network bandwidth or processing time, we use efficient one-way hash functions and do not use asymmetric cryptographic operations in the protocol. SEAD performs well over the range of scenarios we tested, and is robust against multiple uncoordinated attackers creating incorrect routing state in any other node, even in spite of any active attackers or compromised nodes in the network.

KW - Ad hoc network routing

KW - Hash tree chains

KW - Mobile ad hoc networks

KW - SEAD

KW - Same-distance fraud

KW - Secure routing

UR - http://www.scopus.com/inward/record.url?scp=11244269535&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=11244269535&partnerID=8YFLogxK

U2 - 10.1016/S1570-8705(03)00019-2

DO - 10.1016/S1570-8705(03)00019-2

M3 - Article

AN - SCOPUS:11244269535

VL - 1

SP - 175

EP - 192

JO - Ad Hoc Networks

JF - Ad Hoc Networks

SN - 1570-8705

IS - 1

ER -