Ariadne: A secure on-demand routing protocol for ad hoc networks (2002)
Cached
Download Links
- [www.eecs.wsu.edu]
- [www.cs.rice.edu]
- [www-cgi.cs.cmu.edu]
- [www.perrig.net]
- [paris.cs.berkeley.edu]
- [www.cs.colorado.edu]
- [www.cse.fau.edu]
- [classes.cec.wustl.edu]
- [www.cse.fau.edu]
- [www.ece.cmu.edu]
- [www.cs.ucf.edu]
- [www.cs.ucf.edu]
- [www.cs.ucf.edu]
- [www.cs.jhu.edu]
- [sparrow.ece.cmu.edu]
- [monarch.cs.rice.edu]
- [www.cs.rice.edu]
- [www.monarch.cs.rice.edu]
- [sparrow.ece.cmu.edu]
- [www.monarch.cs.cmu.edu]
- [monarch.cs.cmu.edu]
- [www-cgi.cs.cmu.edu]
- [sparrow.ece.cmu.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 477 - 10 self |
BibTeX
@INPROCEEDINGS{Hu02ariadne:a,
author = {Yih-chun Hu},
title = {Ariadne: A secure on-demand routing protocol for ad hoc networks},
booktitle = {},
year = {2002},
pages = {12--23}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a non-adversarial setting, assuming a trusted environment. In this paper, we present attacks against routing in ad hoc networks, and we present the design and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne. Ariadne prevents attackers or compromised nodes from tampering with uncompromised routes consisting of uncompromised nodes, and also prevents a large number of types of Denial-of-Service attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives.
