ArticlePDF Available

A New Scheme for Minimizing Malicious Behavior of Mobile Nodes in Mobile Ad Hoc Networks

  • August 2009
Authors:
Syed S Rizvi at Pennsylvania State University
Syed S Rizvi
Khaled Elleithy at University of Bridgeport
Khaled Elleithy
Download full-text PDFDownload full-text PDF
Read full-text
Download citation

Abstract

The performance of Mobile Ad hoc networks (MANET) depends on the cooperation of all active nodes. However, supporting a MANET is a cost-intensive activity for a mobile node. From a single mobile node perspective, the detection of routes as well as forwarding packets consume local CPU time, memory, network-bandwidth, and last but not least energy. We believe that this is one of the main factors that strongly motivate a mobile node to deny packet forwarding for others, while at the same time use their services to deliver its own data. This behavior of an independent mobile node is commonly known as misbehaving or selfishness. A vast amount of research has already been done for minimizing malicious behavior of mobile nodes. However, most of them focused on the methods/techniques/algorithms to remove such nodes from the MANET. We believe that the frequent elimination of such miss-behaving nodes never allowed a free and faster growth of MANET. This paper provides a critical analysis of the recent research wok and its impact on the overall performance of a MANET. In this paper, we clarify some of the misconceptions in the understating of selfishness and miss-behavior of nodes. Moreover, we propose a mathematical model that based on the time division technique to minimize the malicious behavior of mobile nodes by avoiding unnecessary elimination of bad nodes. Our proposed approach not only improves the resource sharing but also creates a consistent trust and cooperation (CTC) environment among the mobile nodes. The simulation results demonstrate the success of the proposed approach that significantly minimizes the malicious nodes and consequently maximizes the overall throughput of MANET than other well known schemes. Comment: 10 pages IEEE format, International Journal of Computer Science and Information Security, IJCSIS July 2009, ISSN 1947 5500, Impact Factor 0.423
56.pdf
Content uploaded by Khaled Elleithy
Author content
All content in this area was uploaded by Khaled Elleithy
Content may be subject to copyright.
0908.09
81.pdf
Content uploaded by Khaled Elleithy
Author content
All content in this area was uploaded by Khaled Elleithy
Content may be subject to copyright.
A preview of the PDF is not available
... Mobile ad hoc network is a composition of active mobile nodes which communicate each other without relying on a centralized infrastructure. In this network, nodes are free to move in an arbitrary fashion and hence the topology of the network is highly dynamic in nature 1 . In the dynamic topology, the mobile nodes present in a particular range can communicate directly, whereas the nodes present outside the communication range make use of intermediate nodes to transfer a data packet to its destiny and this type of transmission may be called as multi-hop routing 2 . ...
... In this mechanism, the detection of Root node attack is based upon a factor called Kuder-Richardson Reputation Co-eicient (KRRC), which aids in estimating the reputation level of each and every mobile node and enables efective and eicient mitigation of root node attack from the routing path established between the multicast groups. he number of packets dropped by a mobile node in any particular session says in session , can be given in (1), (1) hen, the average packet drop in 's' sessions is computed by (2), ...
View
... The consistency and cooperation between the nodes, the trust mechanism for resource sharing has been traced. Likewise, an analysis has been performed for the network which is ad-hoc with some parameters like transmission overhead and utilization of network has been borne out [10]. A Selfish node minimization mechanism which efficiently handles the nodes which consumes more energy and connectivity has been developed. ...
View
... In MANET, the trustworthy communication between the source and destination nodes depend on the energy and packet forwarding capability of intermediate router nodes [1]. Resource draining attacks like vampire attack greatly influences the lifetime of the network as they direct impact the connectivity between the nodes by draining maximum amount energy. ...
Semi-Markov chain-based grey prediction-based mitigation scheme for vampire attacks in MANETs
Article
Full-text available
Vampire attacks are considered to be the most vulnerable resource draining attack that is potential in disabling the connectivity of the network by draining mobile node’s energy at a faster rate. This vampire attack is generic as they exploit the characteristic features of the base protocol used for enabling communication in mobile ad hoc networks (MANETs). The core objective of this paper is an attempt to formulate an energy forecasting mechanism using grey theory that ensures reliable network connectivity that gets influenced through the vampire behaviour of mobile nodes under active communication. This Semi-Markov chain-based grey prediction-based mitigation (SMCGPM) is an enhanced Markov chain model that integrates the characteristic features of stochastic theory and grey theory for improving the efficacy in detecting a specific kind of vampire attack called as stretch attack. In this technique, the elucidated data from each mobile node are initially modeled based on Grey model. Then, the residual error is calculated between the forecasted and observed values of energy possessed by the mobile nodes based on their packet forwarding rates. SMCGPM has the capability of predicting the possible transition behaviour of mobile nodes through the estimated residual error derived from the Markov chain matrices. Simulation results confirm that SMCGPM is predominant than the baseline prediction schemes by facilitating an effective detection rate of 29% as they achieve correctness and accuracy in prediction through Semi-Markov chain stochastic properties inspired energy factor prediction.
View
... makes the most use of network resources for their own gain. This kind of exploitation on the network resources by these nodes may result in performance degradation of the entire network [4]. It is also clear that increasing number of selfish nodes may perhaps affect the resilience of the network [5]. ...
An Erlang Factor-Based Conditional Reliability Mechanism for Enforcing Co-operation in MANETs
Article
Full-text available
  • Jul 2016
Reputation is considered to be one of the vital entities for maintaining collaboration among wireless mobile nodes present in an ad hoc environment. The nodes in MANET are dynamic and could change its behaviour drastically, but establishing maximum level of cooperation between these nodes is highly crucial. Moreover, the presence of selfish nodes has a greater impact on the resilience of the network. Hence, a need arises for formulating a mechanism that deals with these selfish nodes. In this paper, we contribute an Erlang distribution based Conditional Reliability Mechanism (ECRCM) that aids in detecting and isolating the selfish nodes present in an ad hoc environment. This mathematical model makes the routing decision with the help of a parameter called Erlang factor based Conditional Reliability Coefficient (ECRC) determined for each and every mobile node present in the ad hoc network. Extensive simulations were carried out through ns-2 simulator and the analysis was based on performance metrics such as packet delivery ratio, throughput, control overhead and total overhead. ECRCM also helps in framing an optimal threshold range for selfish node detection. From the results, it is obvious that the threshold range derived in our study remarkably identifies maximum number of selfish nodes when compared to the selfishness detecting parameters available in the literature.
View
... They developed a mechanism that isolates selfish nodes based on the threshold level of packet dropped by them. Rizvi and Elleithy (2009) proposed a time division based scheme for isolating malicious behavior of nodes. They clarified the misconceptions that created ambiguity about selfishness and misbehavior of nodes. ...
Erlang Coefficient based Conditional Probabilistic Model for Reliable Data Dissemination in MANETs
Article
Full-text available
  • Nov 2015
In MANETs, reputation plays a significant role in reliable dissemination of data for establishing maximum degree of cooperation among the mobile nodes in the network. But, the presence of selfish nodes drastically reduces the level of cooperation between the nodes and further reduces the life time of the network. Moreover, when the number of selfish nodes increases in the network, the packet delivery ratio and throughput decreases which in turn increases the number of retransmissions. Hence, an effective mechanism for isolating selfish nodesin order to increase the packet delivery rate and the throughput for reliable dissemination of data becomes vital. This paper proposes an Erlang coefficient based conditional probabilistic model (ECCPM) which makes the decision of isolating selfish nodes through the manipulation of Conditional Probabilistic Coefficient (CPC) factor. This conditional probabilistic coefficient acts as the reputation factor for estimating the level of negative impact produced by selfish nodes towards the resilience of the network. The proposed work is simulated in ns-2 and from the results, it is obvious that ECCPM showed better performance in terms of packet delivery ratio, throughput, control overhead and total overhead than existing mitigation mechanisms like RCSBMM, RFBMM, SHRCM and PCMA proposed for selfish nodes.
View
... Rizvi and Elleithy [13] proposed a mathematical model based on time division technique to diminish the malicious behavior of mobile nodes. This is achieved by evading the needless eradication of terrible nodes. ...
Selfish Conscious Mathematical Model based on Reliable Conditional Survivability Co-efficient in MANET Routing
Conference Paper
Full-text available
  • Apr 2013
The reliable dissemination of data between the nodes in a Mobile Ad hoc Network (MANET) highly depends on the degree of collaboration established among them. Reputation of the nodes present in an ad hoc network is considered as a crucial aspect, expected for maintaining cooperation among mobile nodes. Moreover, determining the reputation level for each and every mobile node in MANETs is a challenging task due to the dynamic movement of nodes and computation overhead. Hence, a need arises for devising a new mathematical model that posses the capability of detecting the selfish nodes present in an ad hoc environment. The proposed mathematical model mainly depends on a factor called Reliable conditional Survivability Coefficient (RCSC). The performance of the proposed model is analyzed through ns-2 simulations by varying threshold levels for selfish detection. The proposed Mathematical model detects and mitigates the existence of selfish nodes to a maximum extent.
View
... Rizvi and Elleithy [13] contributed a time division based approach for mitigating malicious behaviour of nodes. This approach clarified the ambiguity that exists between selfish behaviour and malicious behaviour of mobile nodes. ...
Exponential Reliability Coefficient based Reputation Mechanism for isolating selfish nodes in MANETs
Article
Full-text available
  • Aug 2015
In mobile ad hoc networks, cooperation among active mobile nodes is considered to play a vital role in reliable transmission of data. But, the selfish mobile nodes present in an ad hoc environment refuse to forward neighbouring nodes' packet for conserving its own energy. This intentional selfish behaviour drastically reduces the degree of cooperation maintained between the mobile nodes. Hence, a need arises for devising an effective mechanism which incorporates both energy efficiency and reputation into account for mitigating selfish behaviour in MANETs. In this paper, we propose an Exponential Reliability Coefficient based reputation Mechanism (ERCRM) which isolates the selfish nodes from the routing path based on Exponential Reliability Coefficient (ExRC). This reliability coefficient manipulated through exponential failure rate based on moving average method highlights the most recent past behaviour of the mobile nodes for quantifying its genuineness. From the simulation results, it is evident that, the proposed ERCRM approach out-performs the existing Packet Conservation Monitoring Algorithm (PCMA) and Spilt Half Reliability Coefficient based Mathematical Model (SHRCM) in terms of performance evaluation metrics such as packet delivery ratio, throughput, total overhead and control overhead. Further, this ERCRM mechanism has a successful rate of 28% in isolating the selfish nodes from the routing path. Furthermore, it also aids in framing the exponential threshold point of detection as 0.4, where a maximum number of selfish nodes are identified when compared to the existing models available in the literature.
View
... They have also used confidence and trust limits for making statistical prediction about the reliable delivery of data packets. Rizvi and Elleithy [9] proposed a mathematical model based on time division technique to reduce the malicious behavior of nodes. ...
Laplace Stleltjes Transform based Conditional Survivability Coefficient Model for mitigating Selfish Nodes in MANETs
Article
Full-text available
  • Nov 2014
In MANETs, the cooperation is considered as an important entity for enabling reliable data dissemination among the mobile nodes. But, the existence of selfish nodes weakens the degree of cooperation and in turn reduces the network performance. Hence, the computation of reputation level for each and every node in the network becomes essential in order to make optimal routing decisions. In this paper, we propose a Laplace Stleltjes Transform based Conditional Survivability Coefficient Model (LCSCM), which manipulates the survivability of the network through a parameter called Conditional Survivability Coefficient (CSC). This Conditional Survivability Coefficient aids in determining the reputation level of mobile nodes as well as quantifies the survivability of the entire network. The performance of this conditional probabilistic approach is analyzed using ns-2 based on the network related parameters such as packet delivery ratio, throughput, total overhead, and control overhead by varying the number of mobile nodes in the network. The results obtained through these extensive simulations make it obvious that, this approach outperforms PCMA model with a successful detection rate of 24%. This LCSCM also facilitates in framing 0.25 as the saddle point for selfish node detection.
View
... They also used trust and confidence limit for capturing the statistical decision about the reliable delivery of packets and this is the first trust-based mathematical model. Next, Rizvi and Elleithy (2009) proposed mathematical model based on time division technique in order to diminish the malicious behaviour of mobile nodes. ...
Reliability factor-based mathematical model for isolating selfish nodes in MANETs
Article
Full-text available
  • Jan 2014
In MANETs, the performance mainly depends on the cooperation among all the active mobile nodes in the network. Compromising a node to cooperate with all other nodes in the network is a difficult task due to the scarce availability of resources. Hence, mobile nodes could deny the transmission of packets of its neighbour nodes but still forward its own packets. This intentional behaviour of a node is known as selfishness. Our proposed work targets on detecting and isolating the selfishness based on the second hand reputation computed exponentially with the aid of packet deficiency factor (PDEF). The performance of this mathematical model is analysed using ns-2 simulator based on the evaluation parameters determined by varying the number of selfish nodes present in the environment. The results obtained predicts that the proposed model suits better when compared to the existing models available for isolating selfish nodes in an ad hoc environment.
View
A Trust Model for Detecting Device Attacks in Mobile Ad Hoc Ambient Home Network
Article
Full-text available
  • Apr 2016
This study designed, simulated and evaluated the performance of a conceptual framework for ambient ad hoc home network. This was with a view to detecting malicious nodes and securing the home devices against attacks. The proposed framework, called mobile ambient social trust consists of mobile devices and mobile ad hoc network as communication channel. The trust model for the device attacks is Adaptive Neuro Fuzzy (ANF) that considered global reputation of the direct and indirect communication of home devices and remote devices. The model was simulated using Matlab 7.0. In the simulation, NSL-KDD dataset was used as input packets, the artificial neural network for packet classification and ANF system for the global trust computation. The proposed model was benchmarked with an existing Eigen Trust (ET) model using detection accuracy and convergence time as performance metrics. The simulation results using the above parameters revealed a better performance of the ANF over ET model. The framework will secure the home network against unforeseen network disruption and node misbehavior.
View
Cross-Feature Analysis for Detecting Ad-Hoc Routing Anomalies.
Conference Paper
Full-text available
  • Jan 2003
With the proliferation of wireless devices, mobile ad-hoc networking (MANET) has become a very exciting and important technology. However, MANET is more vulnerable than wired networking. Existing security mechanisms designed for wired networks have to be redesigned in this new environment. In this paper, we discuss the problem of intrusion detection in MANET. The focus of our research is on techniques for automatically constructing anomaly detection models that are capable of detecting new (or unseen) attacks. We introduce a new data mining method that performs "cross-feature analysis" to capture the inter-feature correlation patterns in normal traffic. These patterns can be used as normal profiles to detect deviation (or anomalies) caused by attacks. We have implemented our method on a few well known ad-hoc routing protocols, namely, Dynamic Source Routing (DSR) and Ad-hoc On-Demand Distance Vector (AODV), and have conducted extensive experiments on the ns-2 simulator. The results show that the anomaly detection models automatically computed using our data mining method can effectively, detect anomalies caused by typical routing intrusions.
View
Observation-based Cooperation Enforcement in Ad Hoc Network
Article
Full-text available
  • Aug 2003
Ad hoc networks rely on the cooperation of the nodes participating in the network to forward packets for each other. A node may decide not to cooperate to save its resources while still using the network to relay its trac. If too many nodes exhibit this behavior, network performance degrades and cooperating nodes may nd themselves unfairly loaded. Most previous eorts to counter this behavior ([4],[5],[6],[19]) have relied on further cooperation between nodes to exchange reputation information about other nodes. If a node observes another node not participating correctly, it reports this observation to other nodes who then take action to avoid being aected and potentially punish the bad node by refusing to forward its trac. Unfortunately, such second-hand reputation information is subject to false accusations and requires maintaining trust relationships with other nodes. The objective of OCEAN is to avoid this trust-management machinery and see how far we can get simply by using direct rst-hand observations of other nodes' behavior. We nd that, in many scenarios, OCEAN can do as well as, or even better than, schemes requiring second-hand reputation exchanges. This encouraging result could possibly help obviate solutions requiring trust-management for some contexts.
View
Mitigating Routing Misbehavior in Mobile Ad Hoc Networks
Article
Full-text available
  • Jul 2000
This paper describes two techniques that improve throughput in an ad hoc network in the presence of nodes that agree to forward packets but fail to do so. To mitigate this problem, we propose categorizing nodes based upon their dynamically measured behavior. We use a watchdog that identies misbehaving nodes and a pathrater that helps routing protocols avoid these nodes. Through simulation we evaluate watchdog and pathrater using packet throughput, percentage of overhead (routing) transmissions, and the accuracy of misbehaving node detection. When used together in a network with moderate mobility, the two techniques increase throughput by 17% in the presence of 40% misbehaving nodes, while increasing the percentage of overhead transmissions from the standard routing protocol's 9% to 17%. During extreme mobility, watchdog and pathrater can increase network throughput by 27%, while increasing the overhead transmissions from the standard routing protocol's 12% to 24%. 1. INTRODUCTION T...
View
The EigenTrust Algorithm for Reputation Management in P2P Networks
Article
Full-text available
  • May 2003
Peer-to-peer file-sharing networks are currently receiving much attention as a means of sharing and distributing information. However, as recent experience shows, the anonymous, open nature of these networks offers an almost ideal environment for the spread of self-replicating inauthentic files.
View
Core: A Collaborative Reputation Mechanism to Enforce Node Cooperation in Mobile Ad Hoc Networks
Conference Paper
  • Jan 2002
Countermeasures for node misbehavior and selfishness are mandatory requirements in MANET. Selfishness that causes lack of node activity cannot be solved by classical security means that aim at verifying the correctness and integrity of an operation. We suggest a generic mechanism based on reputation to enforce cooperation among the nodes of a MANET to prevent selfish behavior. Each network entity keeps track of other entities' collaboration using a technique called reputation. The reputation is calculated based on various types of information on each entity's rate of collaboration. Since there is no incentive for a node to maliciously spread negative information about other nodes, simple denial of service attacks using the collaboration technique itself are prevented. The generic mechanism can be smoothly extended to basic network functions with little impact on existing protocols.
View
Enforcing Collaboration in Peer-to-Peer Routing Services
Conference Paper
Many peer-to-peer services rely on a cooperative model of interaction among nodes, yet actually provide little incentive for nodes to collaborate. In this paper, we develop a trust and security architec- ture for a routing and node location service based on Kademlia (1), a distributed hash table. Crucially, rather than 'routing round' defective or malicious nodes, we discourage free-riding by requiring a node to con- tribute honestly in order to obtain routing service in return. We claim that our trust protocol enforces collaboration and show how our modied version of Kademlia resists a wide variety of attacks.
View
A Formal Model for Trust in Dynamic Networks
Conference Paper
  • Oct 2003
We propose a formal model of trust informed by the Global Computing scenario and focusing on the aspects of trust formation, evolution, and propagation. The model is based on a novel notion of trust structures which, building on concepts from trust management and domain theory, feature at the same time a trust and an information partial order.
View
Context Aware Detection of Selfish Node in DSR Based Ad-hoc Networks
Conference Paper
There can be several sophisticated attacks motivated by selfish, resource saving nature of nodes in a civilian co-operation based ad-hoc network. Distributed rating model based castigation can be useful to discourage selfish nodes from performing these attacks. Even if an attacker is detected, it is hard to charge an accused node in a dynamic environment of adhoc network In this paper we detect a large range of attacks on Dynamic Source Routing (DSR) protocol and the originator of the attack We provide mechanism to inform other nodes of the system about the accused, provide a context aware inference scheme to blame the accused and malicious accuser without doubt. We achieve this with minimal extension of DSR and in a cost effective manner.
View
Intrusion Detection in Wireless Ad-Hoc Networks
Article
  • Aug 2000
As the recent denial-of-service attacks on several major Internet sites have shown us, no open computer network is immune from intrusions. The wireless ad-hoc network is particularly vulnerable due to its features of open medium, dynamic changing topology, cooperative algorithms, lack of centralized monitoring and management point, and lack of a clear line of defense. Many of the intrusion detection techniques developed on a xed wired network are not applicable in this new environment. How to do it dierently and effectively is a challenging research problem. In this paper, we rst examine the vulnerabilities of a wireless ad-hoc network, the reason why we need intrusion detection, and the reason why the current methods cannot be applied directly. We then describe the new intrusion detection and response mechanisms that we are developing for wireless ad-hoc networks. 1. INTRODUCTION A wireless ad-hoc network consists of a collection of peer" mobile nodes that are capable of communic...
View
Managing Trust in a Peer-2-Peer Information System
Article
  • Apr 2002
Managing trust is a problem of particular importance in peer-to-peer environments where one frequently encounters unknown agents. Existing methods for trust management, that are based on reputation, focus on the semantic properties of the trust model. They do not scale as they either rely on a central database or require to maintain global knowledge at eachagent to provide data on earlier interactions. In this paper we presentanapproach that addresses the problem of reputation-based trust management at both the data management and the semantic level. We employ at both levels scalable data structures and algorithms that require no central control and allow to assess trust by computing an agents reputation from its former interactions with other agents. Thus the method can be implemented in a peerto -peer environment and scales well for very large numbers of participants. We expect that scalable methods for trust management are an important factor, if fully decentralized peer-to-peer systems should become the platform for more serious applications than simple exchange.
View