Analysis of Secure Route Re-computation Mechanisms on OLSR Based MANET

Abstract

The Optimized Link State Routing (OLSR) protocol is a proactive routing protocol that uses an efficient link state packet forwarding mechanism called multipoint relaying. OLSR is unsuitable for highly mobile network and the MPR node, which has the responsibility for broadcasting packet, is vulnerable to active attacks, link failure, link spoofing etc. In this paper, the methods for securing route re-computation mechanisms on OLSR under MANET are compared. The Denial Contradictions with Fictitious Node Mechanism (DCFM) is suspect a gray-hole node by using contradiction rules before an attack has happened where control packets are again broadcasted on a route failure. The route re-computation is done based on Dijkstra’s algorithm. The BR-OLSR (Back up-Routing based OLSR) and OLSR-OPP (OLSR Opportunistic) are mitigation techniques that function only after the attack has commenced and re-routing process can done with minimum overhead using Dijkstra’s algorithm. This paper aims to identify the re-routing process and countermeasures for route failure from analyzing the methods on the basis of mobility, node density, network overhead and Reliability of MPR node.

Keywords: Back up routing, DCFM, Dijkstra’s algorithm, Multipoint relaying, OLSR opportunistic, Re-routing process.

View PDF