SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks (2003)
Cached
Download Links
- [www.ece.cmu.edu]
- [www.cs.rice.edu]
- [sparrow.ece.cmu.edu]
- [www-cgi.cs.cmu.edu]
- [sparrow.ece.cmu.edu]
- [www.crhc.uiuc.edu]
- [www.cs.jhu.edu]
- [www.cs.uky.edu]
- [monarch.cs.rice.edu]
- [www.cs.colorado.edu]
- [www.ece.cmu.edu]
- [sparrow.ece.cmu.edu]
- [www.cs.huji.ac.il]
- [sparrow.ece.cmu.edu]
- [monarch.cs.rice.edu]
- [www.monarch.cs.cmu.edu]
- [monarch.cs.cmu.edu]
- [www.monarch.cs.rice.edu]
- [www.ece.cmu.edu]
- [www.cs.rice.edu]
- [www-cgi.cs.cmu.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 295 - 7 self |
BibTeX
@MISC{Hu03sead:secure,
author = {Yih-Chun Hu and David B. Johnson and Adrian Perrig},
title = {SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks},
year = {2003}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
