Cooperative network intrusion detection system (CNIDS) in mobile adhoc network based on DSR protocol

ITCA, an IDS and Trust Solution Collaborated with ACK Based Approach to Mitigate Network Layer Attack on MANET Routing

Abstract: The feature of Dynamic topology configuration of MANET reciprocates the security constraints and bring in many security threats that hamper the routing and time bound delivery of packets. Many security schemes had been proposed to secure MANET routing and improve its efficiency. The solutions proposed by existing systems are defined in one dimension so that the targeted attack can be fixed up, but that might create flaws in other dimension or introduce new attack. So it is necessary to create a multidimensional solution that empowers the routing process to become inherently secure rather than defending one particular attack. The selfish or maliciously behaving nodes in the network are the key players in launching the attacks and disrupting the routing process. In this paper, the proposed consolidated approach named, IDS and Trust solution Collaborated with Ack based approach (ITCA), performs identification of attack, isolation of misbehaving nodes and control behavior of nodes in the network. This enables the routing process to be more robust by resisting the malicious nodes from being the part of a route, avoid attack formation and thus supports to improve the efficiency. Even though the malicious nodes are isolated, the proposed method allows them to be sender for transmitting their own data, but under controlled environment defined by IDS so that the attempt to launch DOS attack can be avoided. The reconsideration of isolated node that to under controlled IDS environment in collaboration with Trust and improved ACK based scheme is key behind proposed multidimensional method, ITCA. Further the method is integrated with AODV and extensive experimentation is done based on raising number of malicious nodes in the network to measure its effectiveness and efficiency.

A Novel Cooperative Intrusion Detection System for Mobile Ad Hoc Networks

Abstract: Error! Bookmark not defined. List of Tables vii List of Figures viii

Survey of hash security on DSR routing protocol

Abstract: Mobile Ad-hoc Network is a network in which mobile nodes communicate with each other by the help of wireless links and mobile nodes can move randomly in a network without any centralized management system. As MANET is a wireless network, security is a major concern and different type of attacks can manipulate the data/info that are transmitted from the source node to destination node in the network. This paper presents the literature review of DSR routing protocol and previously proposed approaches that plays a major role for enhancing the performance of DSR routing protocol. The paper introduces a hashing technique that will enhance the security of DSR routing protocol in mobile ad-hoc network.

Mitigating routing misbehavior in mobile ad hoc networks

Abstract: 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 identifies 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%.

Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks

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

Performance analysis of the CONFIDANT protocol

Abstract: Mobile ad-hoc networking works properly only if the participating nodes cooperate in routing and forwarding. However,it may be advantageous for individual nodes not to cooperate. We propose a protocol, called CONFIDANT, for making misbehavior unattractive; it is based on selective altruism and utilitarianism. It aims at detecting and isolating misbehaving nodes, thus making it unattractive to deny cooperation. Trust relationships and routing decisions are based on experienced, observed, or reported routing and forwarding behavior of other nodes. The detailed implementation of CONFIDANT in this paper assumes that the network layer is based on the Dynamic Source Routing (DSR) protocol. We present a performance analysis of DSR fortified by CONFIDANT and compare it to regular defenseless DSR. It shows that a network with CONFIDANT and up to 60% of misbehaving nodes behaves almost as well as a benign network, in sharp contrast to a defenseless network. All simulations have been implemented and performed in GloMoSim.

Performance Analysis of the CONFIDANT Protocol: Cooperation Of Nodes - Fairness In Dynamic Ad-hoc NeTworks

Abstract: Mobile ad-hoc networking works properly only if the participating nodes cooperate in routing and forwarding. However, it may be advantageous for individual nodes not to cooperate. We propose a protocol, called CONFIDANT, for making misbehavior unattractive; it is based on selective altruism and utilitarianism. It aims at detecting and isolating misbehaving nodes, thus making it unattractive to deny cooperation. Trust relationships and routing decisions are based on experienced, observed, or reported routing and forwarding behavior of other nodes. The detailed implementation of CONFIDANT in this paper assumes that the network layer is based on the Dynamic Source Routing (DSR) protocol. We present a performance analysis of DSR fortified by CONFIDANT and compare it to regular defenseless DSR. It shows that a network with CONFIDANT and up to 60% of misbehaving nodes behaves almost as well as a benign network, in sharp contrast to a defenseless network. All simulations have been implemented and performed in GloMoSim.

Observation-based Cooperation Enforcement in Ad Hoc Networks

Abstract: 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 traffic. If too many nodes exhibit this behavior, network performance degrades and cooperating nodes may find themselves unfairly loaded. Most previous efforts to counter this behavior 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 affected and potentially punish the bad node by refusing to forward its traffic. 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 first-hand observations of other nodes' behavior. We find 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.