A lightweight mechanism to secure OLSR

Lin Chen, Xiaoyun Xue, Jean Leneutre

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Routing protocols in ad hoc networks are vulnerable to various attacks. Many solutions have been proposed to secure ad hoc routing protocols in recent research but at the price of significant traffic and processing overhead, which may be undesirable for the ad hoc networks with limited bandwidth and processing power. In this paper, we present and evaluate a lightweight mechanism to secure OLSR (Optimized Link State Routing [1]). In our approach, the mechanism of coherence check is applied to secure the link state update. To secure the neighbor establishment, we adopt the idea based on proof introduced in AD- VSIG [2]. We identify a security flaw in ADVSIG and then propose a solution to counter it. Besides, we use the hash chain technique to reduce the processing overhead of HELLO messages in the neighbor establishment. Simulation results show that our approach is both lightweight and robust without degrading significantly the performance of OLSR.

Original languageEnglish
Title of host publicationIMECS 2006 - International MultiConference of Engineers and Computer Scientists 2006
Pages887-895
Number of pages9
Publication statusPublished - 1 Dec 2006
Externally publishedYes
EventInternational MultiConference of Engineers and Computer Scientists 2006, IMECS 2006 - Kowloon, Hong Kong
Duration: 20 Jun 200622 Jun 2006

Publication series

NameLecture Notes in Engineering and Computer Science
ISSN (Print)2078-0958

Conference

ConferenceInternational MultiConference of Engineers and Computer Scientists 2006, IMECS 2006
Country/TerritoryHong Kong
CityKowloon
Period20/06/0622/06/06

Keywords

  • Ecurity
  • Mobile ad hoc networ s
  • OL
  • One way Hash chain
  • Outing protocol

Fingerprint

Dive into the research topics of 'A lightweight mechanism to secure OLSR'. Together they form a unique fingerprint.

Cite this