loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fourth IEEE Workshop on Mobile Computing Systems and Applications
SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks
Callicoon, New York
June 20-June 21
ISBN: 0-7695-1647-5
Yih-Chun Hu, Rice University
David B. Johnson, Rice University
Adrian Perrig, University of California at Berkeley
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.
Citation:
Yih-Chun Hu, David B. Johnson, Adrian Perrig, "SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks," wmcsa, pp.3, Fourth IEEE Workshop on Mobile Computing Systems and Applications, 2002
Usage of this product signifies your acceptance of the Terms of Use.