Securing the ad-hoc on-demand distance vector protocol

M Hitchens*, R Shankaran, Varadharajan

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

Abstract

Ad-hoc routing protocols are challenging to design and the need for security services further complicates the situation. In such networks topology changes quickly due to rapid node mobility and therefore wired routing protocols do not scale well for such networks. So far the proposals for routing in ad-hoc networks offer no security mechanisms at all, or have only partial solutions for protecting the routing. In this paper, we present a scheme for providing security services for routing of control messages in an ad-hoc network. There are two classes of ad hoc routing protocols namely on demand and table driven. Our focus is on on-demand routing protocols for ad-hoc networks, specifically Ad-hoc On-demand Distance Vector Routing protocol.

Original languageEnglish
Title of host publicationParallel and distributed computing systems
EditorsDA Bader, AA Khokhar
Place of PublicationWinona, MN
PublisherINTERNATIONAL SOCIETY COMPUTER S & THEIR APPLICATIONS (ISCA)
Pages353-360
Number of pages8
ISBN (Print)1880843528
Publication statusPublished - 2004
Event17th International Conference on Parallel and Distributed Computing Systems - San Francisco, Canada
Duration: 15 Sep 200417 Sep 2004

Conference

Conference17th International Conference on Parallel and Distributed Computing Systems
CountryCanada
CitySan Francisco
Period15/09/0417/09/04

Cite this