|
Published Articles >> Table of Contents >> Abstract
Fourth IEEE Workshop on Mobile Computing Systems and Applications
p. 3
SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks
Yih-Chun Hu, Rice University
David B. Johnson, Rice University
Adrian Perrig, University of California at Berkeley
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MCSA.2002.1017480
Send link to a friend
| 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 (DSDV). In order to support use with nodes of limited CPU processing capability, and to guard against Denial-of-Service (DoS) 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.
|
 Additional Information
|
Citation:
Yih-Chun Hu, David B. Johnson, Adrian Perrig,
"SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks,"
wmcsa,
p. 3,
Fourth IEEE Workshop on Mobile Computing Systems and Applications,
2002
|
|
