Securing the Destination-Sequenced Distance Vector Routing Protocol (S-DSDV)

  • Tao Wan
  • Evangelos Kranakis
  • Paul C. van Oorschot
Conference paper

DOI: 10.1007/978-3-540-30191-2_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3269)
Cite this paper as:
Wan T., Kranakis E., van Oorschot P.C. (2004) Securing the Destination-Sequenced Distance Vector Routing Protocol (S-DSDV). In: Lopez J., Qing S., Okamoto E. (eds) Information and Communications Security. ICICS 2004. Lecture Notes in Computer Science, vol 3269. Springer, Berlin, Heidelberg

Abstract

A mobile ad hoc network (MANET) is formed by a group of mobile wireless nodes, each of which functions as a router and agrees to forward packets for others. Many routing protocols (e.g., AODV, DSDV, etc) have been proposed for MANETs. However, most assume that nodes are trustworthy and cooperative. Thus, they are vulnerable to a variety of attacks. We propose a secure routing protocol based on DSDV, namely S-DSDV, in which a well-behaved node can successfully detect a malicious routing update with any sequence number fraud (larger or smaller) and any distance fraud (shorter, same, or longer) provided no two nodes are in collusion. We compare security properties and efficiency of S-DSDV with superSEAD. Our analysis shows that S-DSDV-R, a variation of S-DSDV with a risk window similar to that of superSEAD, offers better security than superSEAD with less network overhead.

Keywords

DSDV Routing Security Wireless Security Security Analysis 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Tao Wan
    • 1
  • Evangelos Kranakis
    • 1
  • Paul C. van Oorschot
    • 1
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations