Routing attacks detection and reaction scheme for mobile ad hoc networks using statistical methods

Author(s):  
Hisham Mustafa ◽  
Yan Xiong
Author(s):  
SK. JASMINE ◽  
CH. SUBBARAO ◽  
P. BABU

Mobile Ad hoc Networks (MANET) 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. Even though there exist several intrusion response techniques to mitigate such critical attacks, existing solutions typically attempt to isolate malicious nodes based on binary or naı¨ve fuzzy response decisions. However, binary responses may result in the unexpected network partition, causing additional damages to the network infrastructure, and naı¨ve fuzzy responses could lead to uncertainty in countering routing attacks in MANET. In this paper, we propose a risk-aware response mechanism to systematically cope with the identified routing attacks. Our risk-aware approach is based on an extended Dempster-Shafer mathematical theory of evidence introducing a notion of importance factors. In addition, our experiments demonstrate the effectiveness of our approach with the consideration of several performance metrics


2007 ◽  
Vol 14 (5) ◽  
pp. 85-91 ◽  
Author(s):  
Bounpadith Kannhavong ◽  
Hidehisa Nakayama ◽  
Yoshiaki Nemoto ◽  
Nei Kato ◽  
Abbas Jamalipour

Author(s):  
Ahmed Elkabour ◽  
Dr. Rahma Teirab Abaker Haroun

Abstract - 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.


Sign in / Sign up

Export Citation Format

Share Document