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

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols (2003)

Cached

  • Download as a PDF

Download Links

  • [monarch.cs.rice.edu]
  • [www.cs.rice.edu]
  • [www.monarch.cs.cmu.edu]
  • [www.monarch.cs.rice.edu]
  • [www-cgi.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.rice.edu]
  • [monarch.cs.rice.edu]
  • [www.monarch.cs.cmu.edu]
  • [www.monarch.cs.rice.edu]
  • [www.crhc.uiuc.edu]
  • [users.crhc.illinois.edu]
  • [www.ece.cmu.edu]
  • [www.ece.cmu.edu]
  • [sparrow.ece.cmu.edu]
  • [sparrow.ece.cmu.edu]
  • [web.eecs.umich.edu]
  • [web.eecs.umich.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Yih-chun Hu , Adrian Perrig , David B. Johnson
Venue:in ACM Workshop on Wireless Security (WiSe
Citations:216 - 4 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Hu03rushingattacks,
    author = {Yih-chun Hu and Adrian Perrig and David B. Johnson},
    title = {Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols},
    booktitle = {in ACM Workshop on Wireless Security (WiSe},
    year = {2003},
    pages = {30--40}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

In an ad hoc network, mobile computers (or nodes) cooperate to forward packets for each other, allowing nodes to communicate beyond their direct wireless transmission range. Many proposed routing protocols for ad hoc networks operate in an on-demand fashion, as on-demand routing protocols have been shown to often have lower overhead and faster reaction time than other types of routing based on periodic (proactive) mechanisms. Significant attention recently has been devoted to developing secure routing protocols for ad hoc networks, including a number of secure ondemand routing protocols, that defend against a variety of possible attacks on network routing. In this paper, we present the rushing attack, a new attack that results in denial-of-service when used against all previous on-demand ad hoc network routing protocols. For example, DSR, AODV, and secure protocols based on them, such as Ariadne, ARAN, and SAODV, are unable to discover routes longer than two hops when subject to this attack. This attack is also particularly damaging because it can be performed by a relatively weak attacker. We analyze why previous protocols fail under this attack. We then develop Rushing Attack Prevention (RAP),a generic defense against the rushing attack for on-demand protocols. RAP incurs no cost unless the underlying protocol fails to find a working route, and it provides provable security properties even against the strongest rushing attackers.

Keyphrases

ad hoc network    rushing attack    provable security property    working route    previous on-demand ad hoc network    reaction time    direct wireless transmission range    mobile computer    rushing attacker    protocol fails    secure ondemand routing protocol    new attack    attack prevention    secure protocol    on-demand routing protocol    on-demand protocol    significant attention    generic defense    secure routing protocol    on-demand fashion    possible attack    weak attacker    previous protocol   

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