International Research Journal of Engineering and Technology (IRJET)
e-ISSN: 2395-0056
Volume: 04 Issue: 07 | July -2017
p-ISSN: 2395-0072
www.irjet.net
Exclusion of Denial of Service Attack using Graph Theory in MANETS Preeti1, Anuradha T2 1PG
Student, Department of CSE, PDA College of Engineering, Kalaburagi, Karnataka, India. preetipsg100@gmail.com 2Assistant Professor, Department of CSE, PDA College of Engineering, Kalaburagi, Karnataka, India. ---------------------------------------------------------------------***--------------------------------------------------------------------1.1 Graph theory Abstract -Mobile ad hoc networks (MANET) are wireless, multi-hop, infrastructure less collection of self organizing mobile devices that form a temporary cooperative network without any base station. Sending packets from one device to another is done via chain of intermediate nodes. Because of dynamic topology node can enter or leave network at any time, during this, malicious node can enter and harm the network. The main focus of research in routing protocols for Mobile Ad-Hoc Networks (MANET) geared towards routing efficiency, the resulting protocols tend to be insecure to various attacks such as Denial of service (DoS )attack .One of the major DoS attack against the Optimized Link State Routing protocol (OLSR) known as the node isolation attack occurs when topological knowledge of the network is exploited by an attacker who is able to isolate the victim from the rest of the network and subsequently deny communication services to the victim. Different solutions have been proposed to eliminate the dos attack, however, these solutions often compromise routing efficiency or network overhead. Here a novel method has been focused on detection and prevention of DoS attack using trust based mechanism which is based on the graph theory, where the trust value is obtained based on the behaviors and activity information of each node to secure the routing protocol because it has a better performance rather than cryptography method. Results show that secured transmission is done in the nodes by overcoming the DoS attack, where the data travels in the honest route by mitigating the DoS attack. Key Words: DoS, Graph theory, MANEts, OLSR, Trust mechanism.
1. INTRODUCTION Mobile ad hoc Network (MANET) is a group of mobile devices capable of communicating wirelessly with each other without using a predefined infrastructure or centralized authority. These nodes are not dependent and they act as both host and as well as router to send the data. Every node in MAENT has to maintain the communication range. Due to mobility of nodes topology changes rapidly with varying time. Due to the dynamic topology the malicious nodes can enter with the honest nodes and degrade the network performance in the form of attack. In this paper, the avoidance of Denial of Service (DoS) attack in the MANETs is proposed. © 2017, IRJET
|
Impact Factor value: 5.181
|
Graph theory used to model pair wise relations between neighboring nodes. A graph theory in this context is made up of nodes which are connected by edges that are link between nodes. Graph is an ordered pair G = (V, E) consisting a set of nodes ‘V’ together with a set of edges ‘E’. V is a set formed with a relation of incidence that associates with each edge of two vertices. Many real world situations can handily be represented by convey of a diagram consisting of a set of points together with lines joining certain pairs of these points. For example, the points could represent people, with lines joining pairs of friends; or the points might be communication centers, with lines representing communication links.
1.2 Denial of service (DoS) In this type of attack, an attacker attempts to prevent the legitimate and authorized users from the services offered by the network. The node isolation is type of dos attack. Node isolation attack In this attack, an attacker exploits the fact that the victim prefers a minimal MPR (Multi Point Relay) set in order to hide the existence of the victim in the network. The attacker, which must be located within broadcast distance of the victim, advertises a fake HELLO message claiming to be in close proximity to all of the victim’s two-hop neighbors. In addition, a fictitious node is advertised, giving the attacker an advantage over other possible legitimate candidates for MPR selection. Knowledge of the victim’s two-hop neighbors is readily available by analyzing TC (Topology Control) messages of the victim’s one-hop neighbors, a list of which can be constructed directly from the HELLO message broadcast by the victim himself. MPR selection rule would cause the victim to exclusively select the attacker as its MPR, as it is the minimal set that allows for coverage of all of the victim’s two-hop neighbors (including the fictitious node).DOS is now straightforward. The attacker can isolate the victim simply by not including the victim in its TC message. In essence, the attacker refrains from notifying the network that the victim can be reached through it, and because no other node advertises a path to the victim, it is isolated. Other nodes, not seeing link information to the victim, would conclude that it has left the network, and remove its address from their routing tables. Although nodes one-hop and two-hops from ISO 9001:2008 Certified Journal
|
Page 3394