scholarly journals MINIMIZATION OF MOBILE AD HOC NETWORKS ROUTING ATTACKS USING DS MATHEMATICAL THEORY

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

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.


2018 ◽  
Vol 11 (2) ◽  
pp. 309-340 ◽  
Author(s):  
Abdesselem Beghriche ◽  
Azeddine Bilami

PurposeSecurity is one of the major challenges in the design and implementation of protocols for mobile ad hoc networks (MANETs). In such systems, the cooperation between nodes is one of the important principles being followed in the current research works to formulate various security protocols. Many existing works assume that mobile nodes will follow prescribed protocols without deviation. However, this is not always the case, because these networks are subjected to a variety of malicious attacks. Since there are various models of attack, trust routing scheme can guarantee security and trust of the network. The purpose of this paper is to propose a novel trusted routing model for mitigating attacks in MANETs.Design/methodology/approachThe proposed model incorporates the concept of trust into the MANETs and applies grey relational analysis theory combined with fuzzy sets to calculate a node’s trust level based on observations from neighbour nodes’ trust level, these trust levels are then used in the routing decision-making process.FindingsIn order to prove the applicability of the proposed solution, extensive experiments were conducted to evaluate the efficiency of the proposed model, aiming at improving the network interaction quality, malicious node mitigation and enhancements of the system’s security.Originality/valueThe proposed solution in this paper is a new approach combining the fundamental basics of fuzzy sets with the grey theory, where establishment of trust relationships among participating nodes is critical in order to enable collaborative optimisation of system metrics. Experimental results indicate that the proposed method is useful for reducing the effects of malicious nodes and for the enhancements of system’s security.


2021 ◽  
Author(s):  
Vincent Koo

Due to recent advances in wireless communication technologies, mobile ad hoc networks (MANETs) have become the networks of choice for use in various applications. Unfortunately, this advantage comes with serious security concerns, particularly from a wireless channel prospective, where MANETs may be vulnerable to collaborative wormhole attacks, in particular, packet dropping and message tampering attacks. Recently, two secured routing protocols against these types of attacks (the so-called Highly Secured Approach Method or HSAM and the so-called Securing AODV against Wormhole Attacks in emergency MANET Multimedia Communications or AODV-WADR-AES) were proposed. These schemes are investigated in-depth to identify their weaknesses and a novel secured routing scheme (so-called Timed and Secure Monitoring Implementation against Wormhole Attacks in MANETs or TSMI) is proposed, with the goal to mitigate collaborative wormhole attacks in MANETs while maintaining the performance levels of both the HSAM and AODVWADR- AES schemes. Simulation results are presented to validate the stated goal using various performance metrics.


Sign in / Sign up

Export Citation Format

Share Document