Open AccessMitigating Routing Attacks in Mobile Ad Hoc Networks
Author(s) -
Ahmed Elkabour,
Rahma Teirab Abaker Haroun
Publication year - 2019
Language(s) - English
Resource type - Journals
ISSN - 2411-2933
DOI - 10.31686/ijier.vol7.iss7.1603
Subject(s) - computer science , dijkstra's algorithm , destination sequenced distance vector routing , mobile ad hoc network , computer network , distance vector routing protocol , optimized link state routing protocol , wireless ad hoc network , distributed computing , routing (electronic design automation) , shortest path problem , link state routing protocol , routing protocol , theoretical computer science , telecommunications , network packet , graph , wireless
Mobile Ad hoc Networks have been highly vulnerable to attacks due to the dynamic nature of its network infrastructure. Among these attacks, routing attacks have received considerable attention since it could cause the most devastating damage to MANET. In existing solutions typically attempt to isolate malicious nodes based on binary or naive fuzzy response decisions. However, binary responses may result in the unexpected network partition, causing additional damages to the network infrastructure. In this paper proposes a risk-aware response mechanism to systematically cope with the identified routing attacks. To avoid the routing attacks Dijkstra’s and Destination sequenced Distance Vector algorithm are used. Dijkstra's algorithm solves the single-source shortest-path problem when all edges have non-negative weights. The primary improvement for ad hoc networks made in DSDV over conventional distance vector is the addition of a sequence number in each routing table entry.Index Terms - Intrusion response, risk aware, dempster- shafer theory, Dijkstra’s algorithm, Destination sequenced Distance Vector.