• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks (2003)

Cached

  • Download as a PDF

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.cmu.edu]
  • [www.cs.ucsb.edu]
  • [www.cs.ucsb.edu]
  • [users.crhc.illinois.edu]
  • [cs.ucsb.edu]
  • [www.cse.msstate.edu]
  • [www.cs.rice.edu]
  • [cs.ucsb.edu]
  • [www.crhc.uiuc.edu]
  • [monarch.cs.rice.edu]
  • [users.crhc.illinois.edu]
  • [www.cs.jhu.edu]
  • [www.cs.uky.edu]
  • [www.csee.umbc.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]
  • [www.cs.colorado.edu]
  • [www.cs.colorado.edu]
  • [www.cs.colorado.edu]
  • [www.cs.uiuc.edu]
  • [www.cs.colorado.edu]
  • [www.cs.colorado.edu]
  • [www.cs.colorado.edu]
  • [www.ceid.upatras.gr]
  • [www.ceid.upatras.gr]
  • [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]
  • [www.cs.cmu.edu]
  • [www.cs.rice.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Yih-Chun Hu , David B. Johnson , Adrian Perrig
Citations:533 - 8 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

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}
}

Share

Facebook Twitter Reddit Bibsonomy

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.

Keyphrases

mobile wireless ad hoc network    secure efficient distance vector routing    excess network bandwidth    wireless computer    many previous ad hoc network    attacker attempt    denial-of-service attack    ad hoc network    sead performs    asymmetric cryptographic operation    processing time    access point    base station    efficient one-way hash function    active attacker    distance vector approach    limited cpu processing capability    trusted environment    secure ad hoc network    destination-sequenced distance-vector    multihop path    multiple uncoordinated attacker   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University