TY - GEN
T1 - SEAD
T2 - 4th IEEE Workshop on Mobile Computing Systems and Applications, WMCSA 2002
AU - Hu, Yih Chun
AU - Johnson, D. B.
AU - Perrig, A.
N1 - Publisher Copyright:
© 2002 IEEE.
PY - 2002
Y1 - 2002
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. 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.
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. 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.
UR - http://www.scopus.com/inward/record.url?scp=84961572484&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84961572484&partnerID=8YFLogxK
U2 - 10.1109/MCSA.2002.1017480
DO - 10.1109/MCSA.2002.1017480
M3 - Conference contribution
AN - SCOPUS:84961572484
T3 - Proceedings - 4th IEEE Workshop on Mobile Computing Systems and Applications, WMCSA 2002
SP - 3
EP - 13
BT - Proceedings - 4th IEEE Workshop on Mobile Computing Systems and Applications, WMCSA 2002
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 20 June 2002 through 21 June 2002
ER -