Y. C. Hu, A. Perrig, and D. B. Johnson. Ariadne: A Secure OnDemand Routing Protocol for Ad Hoc Networks. MobiCom'02, September 23-26, 2002, Atlanta, Georgia, USA.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....in Section 2. A brief overview of the proposed scheme is outlined in Section 3, and details are presented in Section 4. The evaluation of the proposed scheme is presented in Section 5, and we conclude in Section 6. 2 Related Work Recent research has investigated misbehavior at the network layer [20, 8, 18] in wireless networks. One approach is to identify misbehaving nodes and avoid such nodes in routing [13] Another approach is to design protocols that encourage cooperation by penalizing misbehavior [4, 2] Network layer mechanisms address network layer misbehavior such as tampering with route ....

Y. Hu, A. Perrig, and D. Johnson. Ariadne: A secure ondemand routing protocol for ad hoc networks. In The 8th ACM International Conference on Mobile Computing and Networking, MobiCom 2002.

.... friend nodes, which take note of the misbehaving node. Misbehaving nodes are denied forwarding privileges and avoided by others through the use of a global black list. Neither of the two schemes discuss how routing information is propagated or protected. Hu et al. describe the Ariadne system [4] which uses cryptographic techniques to prevent subversion of the routing system in use due to false route updates or route request floods. 2.2 Satiating the greedy Alternatively, several authors have studied ad hoc networks in which nodes are modeled as self interested (but not malicious) ....

....part of our layered architecture, we assume some degree of best effort packet forwarding for the purposes of higher level incentivization for priority forwarding. Instead of designing such forwarding from scratch, we advocate the reuse of features provided by Kyasanur [7] for the MAC layer and Hu [4] for the routing layer. Policed best effort service is useful for several reasons. First, since best effort forwarding exists, not all nodes must be aware of the pricing system for the network to be useful or effective. Second, even with schemes that assume the existence of a centralized ....

Y.-C. Hu, A. Perrig, and D. B. Johnson. Ariadne: a secure ondemand routing protocol for ad hoc networks. In Proceedings of ACM MOBICOM, pages 12--23, September 2002.

....fabricate route maintenance messages for selected routes or links. These protocols integrate security features within traditional routing protocols, such as DSR [7] AODV[16] DSDV[15] and aim to protect against message modification, fabrication or address spoofing through cryptographic means [3,5,13]. However, all these protocols assume that secure associations between the nodes of the network exist or can be established on line. Typically, these associations consist of either symmetric keys shared between any two nodes distributed with the help of a trusted key distribution center (KDC) or ....

....problem [10,12] and to counter the bidding down attack [11] in return routability. We present the bootstrapping solution in the context of the Dynamic Source Routing (DSR) protocol and argue that the solution is applicable to other secure routing protocols, such as SEAD [3] and Ariadne [5]. We evaluate the performance of our solution using a ns2 simulation, and present the preliminary results. II. BOOTSTRAPPING SECURE ASSOCIATIONS A. A Cyclic Dependency Problem Routing and security are separate services in any network. The routing service depends on security services to ....

[Article contains additional citation context not shown here]

Y.-C. Hu, A. Perrig, and D. B. Johnson, "Ariadne: A Secure OnDemand Routing Protocol for Ad Hoc Networks", Technical Report TR01-383, Department of Computer Science, Rice University, December 2001.

No context found.

Y. C. Hu, A. Perrig, and D. B. Johnson. Ariadne: A Secure OnDemand Routing Protocol for Ad Hoc Networks. MobiCom'02, September 23-26, 2002, Atlanta, Georgia, USA.

No context found.

Y. Hu, A. Perrig, and D.B. Johnson, "Ariadne: A Secure OnDemand Routing Protocol for Ad Hoc Networks," Proc. ACM Mobicom Conf., pp. 12-23, Sept. 2002.

No context found.

Yih-Chun Hu, Adrian Perrig, and David B. Johnson. Ariadne: A secure OnDemand Routing Protocol for Ad hoc Networks. In Proceedings of MobiCom 2002, Atlanta, Georgia, USA, September 2002.

No context found.

Y.-C. Hu, A. Perrig, and D. B. Johnson. Ariadne: A secure ondemand routing protocol for ad hoc networks. In Proceedings of the Eighth Annual International Conference on Mobile Computing and Networking (MobiCom 2002.

No context found.

Y. Hu, A. Perrig, D. Johnson. Ariadne: A Secure OnDemand Routing Protocol for Ad Hoc Networks. In Proc. of Mobicom 2002.

No context found.

Y.-C. Hu, A. Perrig, and D. B. Johnson. Ariadne: A Secure Ondemand Routing Protocol for Ad Hoc Networks. In MOBICOM, 2002.

No context found.

HU, Y.-C., PERRIG, A., AND JOHNSON, D. B. Ariadne: A Secure OnDemand Routing Protocol for Ad Hoc Networks. In Eigth ACM International Conference on Mobile Computing and Networking (Mobicom 2002.

No context found.

David B. Johnson Yih-Chun Hu, Adrian Perrig. Ariadne: A secure ondemand routing protocol for ad hoc networks. MobiCom, 2002.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC