Intrusion Detection in Mobile Ad Hoc Networks Using Classification Algorithms

In this paper we present the design and evaluation of intrusion detection models for MANETs using supervised classification algorithms. Specifically, we evaluate the performance of the MultiLayer Perceptron (MLP), the Linear classifier, the Gaussian Mixture Model (GMM), the Naive Bayes classifier and the Support Vector Machine (SVM). The performance of the classification algorithms is evaluated under different traffic conditions and mobility patterns for the Black Hole, Forging, Packet Dropping, and Flooding attacks. The results indicate that Support Vector Machines exhibit high accuracy for almost all simulated attacks and that Packet Dropping is the hardest attack to detect.Comment: 12 pages, 7 figures, presented at MedHocNet 200

Performance evaluation of a new end-to-end traffic-aware routing in MANETs

There has been a lot of research effort on developing reactive routing algorithms for mobile ad hoc networks (MANETs) over the past few years. Most of these algorithms consider finding the shortest path from source to destination in building a route. However, this can lead to some network nodes being more overloaded than the others. In MANETs resources, such as node power and channel bandwidth are often at a premium and, therefore, it is important to optimise their use as much as possible. Consequently, a traffic-aware technique to distribute the load is very desirable in order to make good utilisation of nodes' resources. Therefore a number of end-to-end traffic aware techniques have been proposed for reactive routing protocols to deal with this challenging issue. In this paper we contribute to this research effort by proposing a new traffic aware technique that can overcome the limitations of the existing methods. Results from an extensive comparative evaluation show that the new technique has superior performance over similar existing end-to-end techniques in terms of the achieved throughput, end-to-end delay and routing overhead

A Survey of Security Challenges and Issues in Manet

Nodes intriguing element in Mobile Ad-hoc Networks (MANET) are predictable to hold to the rules stated by the routing protocol utilized in the network. Safe routing protocols endeavor to decrease the ill-effect of nodes under the control of malicious entities who intentionally violate the protocol.. There are so many generic tools which are universal for individual as well as organizations for customers to offer protection which comprises Antivirus, Ant spam, etc., and network securities have turn into important issue in MANET. Security is one of the major issues in the MANET particularly w.r.t. complexity and size of the network. The main focus of this survey is to discuss & represent special characteristics of security in MANET and also apply several of the solutions security threats within MANET network similar to intruder activities, tapping and integrity, MANET link layer and network layer operations w.r.t. information security etc) w.r.t. MANET network. This Survey paper also discusses different number of security scenarios of MANET, Attacks in MANET and IDS in MANET. Keywords: AODV, MANET, Network Security, IDS, Attack

Energy Efficient unauthorized Intrusion Detection in mobile Ad-Hoc Neworks

Mobile Ad hoc Networks (MANET) are self-configuring, infrastructure-less, dynamic wireless networks in which the nodes are resource constrained. Intrusion Detection Systems (IDS) are used in MANETs to monitor activities so as to detect any intrusion in the network. The proposed system present efficient scheme for analyzing and optimizing the time duration for which the intrusion detection systems need to remain active in a Mobile Ad Hoc Network. A probabilistic model is proposed that makes use of cooperation between IDSs among neighborhood nodes to reduce their individual active time. Usually, an IDS has to run all the time on every node to oversee the network behavior. This can turn out to be a costly overhead for a battery-powered mobile device in terms of power and computational resources. Hence, this project aim is to reduce the duration of active time of the IDSs without compromising on their effectiveness. To validate this proposed approach, it models the interactions between IDSs as a multi-player cooperative game in which the players have partially cooperative and partially conflicting goals

Energy Efficient Unauthorized Intrusion Detection in Mobile AD-HOC Networks

Mobile Ad hoc Networks (MANET) are self-configuring, infrastructure-less, dynamic wireless networks in which the nodes are resource constrained. Intrusion Detection Systems (IDS) are used in MANETs to monitor activities so as to detect any intrusion in the network. The proposed system present efficient scheme for analyzing and optimizing the time duration for which the intrusion detection systems need to remain active in a Mobile Ad Hoc Network. A probabilistic model is proposed that makes use of cooperation between IDSs among neighborhood nodes to reduce their individual active time. Usually, an IDS has to run all the time on every node to oversee the network behavior. This can turn out to be a costly overhead for a battery-powered mobile device in terms of power and computational resources. Hence, this project aim is to reduce the duration of active time of the IDSs without compromising on their effectiveness. To validate this proposed approach, it models the interactions between IDSs as a multi-player cooperative game in which the players have partially cooperative and partially conflicting goals

Performance study of end-to-end traffic-aware routing

There has been a lot research effort on developing reactive routing algorithms for mobile ad hoc networks (MANETs) over the past few years. Most of these algorithms consider finding the shortest path from source to destination in building a route. However, this can lead to some network nodes being more overloaded than the others. In MANETs resources, such as node power and channel bandwidth are often at a premium and, therefore, it is important to optimise their use as much as possible. Consequently, a traffic-aware technique to distribute the load is very desirable in order to make good utilisation of nodes' resources. A number of traffic aware techniques have recently been proposed and can be classified into two categories: end-to-end and on-the-spot. The performance merits of the existing end-to-end traffic aware techniques have been analysed and compared against traditional routing algorithms. There has also been a performance comparison among the existing on-the-spot techniques. However, there has so far been no similar study that evaluates and compares the relative performance merits of end-to-end techniques. In this paper, we describe an extensive performance evaluation of two end-to-end techniques, based on degree of nodal activity and traffic density, using measures based on throughput, end-to-end delay and routing overhead

Evaluating Load Balancing in Peer-to-Peer Resource Sharing Algorithms for Wireless Mesh Networks

Wireless mesh networks are a promising area for the deployment of new wireless communication and networking technologies. In this paper, we address the problem of enabling effective peer-to-peer resource sharing in this type of networks. In particular, we consider the well-known Chord protocol for resource sharing in wired networks and the recently proposed MeshChord specialization for wireless mesh networks, and compare their performance under various network settings for what concerns total generated traffic and load balancing. Both iterative and recursive key lookup implementation in Chord/MeshChord are considered in our extensive performance evaluation. The results confirm superiority of MeshChord with respect to Chord, and show that recursive key lookup is to be preferred when considering communication overhead, while similar degree of load unbalancing is observed. However, recursive lookup implementation reduces the efficacy of MeshChord cross-layer design with respect to the original Chord algorithm. MeshChord has also the advantage of reducing load unbalancing with respect to Chord, although a moderate degree of load unbalancing is still observed, leaving room for further improvement of the MeshChord design