1 / 11

Secure Routing in Ad Hoc Wireless Networks

Secure Routing in Ad Hoc Wireless Networks. 11.03.2005. Requirements of a Secure Routing Protocol. Detection of malicious nodes Guarantee of correct route discovery Confidentiality of network topology Stability against attacks. AODV. Ad-hoc On-demand Distance Vector Protocol

carr
Download Presentation

Secure Routing in Ad Hoc Wireless Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Secure Routing in Ad Hoc Wireless Networks 11.03.2005

  2. Requirements of a Secure Routing Protocol • Detection of malicious nodes • Guarantee of correct route discovery • Confidentiality of network topology • Stability against attacks

  3. AODV • Ad-hoc On-demand Distance Vector Protocol • Source node broadcasts RouteRequest • Intermediate nodes forward it • If node has a route to destination, it initiates RouteReply

  4. SAR • Security-aware Ad hoc Routing protocol • Enables different levels of security • Level of trust as a metric • Each packet is associated with a security level • Intermediate nodes are associated with security levels • Different keys for different levels of security

  5. SAR

  6. SEAD • Secure Efficient Ad hoc Distance vector routing protocol • Distance Vector Routing • The metric used for routing is hop-count • Periodic and/or triggered updates • DSDV (Highly Dynamic Destination-Sequenced Distance-Vector Routing) uses sequence numbers • DSDV-SQ (DSDV for sequence numbers) • Assumes upper bound for the metric used

  7. SEAD • One-Way Hash Function • Used for authentication • Generates a one-way hash chain • Avoids looping • Easily implement with slight modifications

  8. ARAN • Authenticated Routing for Ad hoc Networks routing protocol • Based on cryptographic certificates • Defeats all identified attacks on the network layer • Issue of certificates: • There exists a trusted server • Doesn’t specify any specific key distribution algorithm

  9. ARAN • End-to-end route authentication: • Ensures that the correct destination is reached by the packets • RouteRequest and RouteReply packets encrypted at each node

  10. Security-Aware AODV Protocol • RouteRequest packets only sent when data packets arrive at node for transmission • Malicious node advertises that it has the shortest path redirecting all packets trough itself (blackhole attack) AODV = Ad-hoc On-demand Distance Vector Protocol

  11. Security-Aware AODV Protocol • Solutions: • Restrict the intermediate nodes from originating RouteReply • FurtherRouteRequest AODV = Ad-hoc On-demand Distance Vector Protocol

More Related