Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

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


Affiliations
1 Computer Science & Engineering, Thejus Engineering College, Thrissur, Kerala, India
     

   Subscribe/Renew Journal


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.
Subscription Login to verify subscription
User
Notifications
Font Size


  • D. Raffo, C. Adjih, T. Clausen, and P. Mühlethaler, “An advanced signature system for OLSR,” Proceedings of the 2nd ACM Workshop on Security of Ad Hoc and Sensor Networks, vol. 4, pp. 10-16, 2004.
  • R. A. Saaidal, A. Harith, P. Marius, A. Ismail, and P. Ranjana, “An efficient hybrid MANET-DTN routing scheme for OLSR,” International Journal of Wireless Personal Communications, vol. 89, no. 4, pp. 1335-1354, 2016.
  • N. Schweitzer, A. Stulman, A. Shabtai, and R. D. Margalit, “Contradiction based gray-hole attack minimization for ad-hoc networks,” IEEE Transactions on Mobile Computing, vol. 15, no. 1, pp. 163-172, 2017.
  • Z. Ye, S. V. Krishnamurthy, S. K. Tripathi, A. Pant, R. Tunpan, A. Mekbungwan, P. Virochpoka, and K. Kanchanasut, “DTN overlay on OLSR network,” Proceedings of the 6th Asian Internet Engineering Conference, vol. 10, pp. 56-63, 2010.
  • S. Djahel, F. Nait-Abdesselam, and A. Khokhar, “An acknowledgment based scheme to defend against cooperative black hole attacks in optimized link state routing protocol,” IEEE International Conference on Communications, pp. 2780-2785, 2008.
  • B. Kannhavong, H. Nakayama, N. Kato, Y. Nemoto, and A. Jamalipour, Nis01-2: A collusion attack against OLSR-based mobile ad hoc networks,” IEEE Globecom, pp. 1-5, 2004.
  • R. S. Abujassar, “Mitigation fault of node mobility for the MANET networks by constructing a backup path with loop free: Enhance the recovery mechanism for pro- active MANET protocol,” International Journal of Wireless Networks, vol. 22, no. 1 pp. 119-133, 2015.

Abstract Views: 312

PDF Views: 0




  • Analysis of Secure Route Re-Computation Mechanisms on OLSR Based MANET

Abstract Views: 312  |  PDF Views: 0

Authors

V. Chithra
Computer Science & Engineering, Thejus Engineering College, Thrissur, Kerala, India

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.

References