DEFENDING WORMHOLE ATTACK IN
WIRELESS AD-HOC NETWORK USING AD-HOC
ON DEMAND DISTANCE VECTOR
Dr.V.Khanaa, Raju M, Sangeetha N
Professor, BIST, Bharath Institute of Higher Education and Research.Bharath University ,drvkannan62@yahoo.com
P.G. Student, M.E CSE, RRASE College of Engg, Chennai, T.N, India. Assistant Professor, Dept of CSE, RRASE College of Engg, Chennai, T.N, India.
Abstract – The ad-hoc networks are the momentarily confirmed wireless networks it does not need stable infrastructure it is also called as infrastructure less network. Because of some flaws of ad-hoc network equally mutual wireless middle and shortage of any important coordination makes them more prone to attacks in comparison with the wired network. Among all the attacks wormhole onslaught is the most highest harsh attack. So this onslaught an attacker arrest the packets at one location in the network and send it two another attacker at a distant location through tunnels which is stable over divergent ways like packet enclose, using great power transmission or by using direct antennas. This tunnel between two colluding attackers is virtual and virtual is called stair a wormhole. The wormhole onslaught is workable alike if the attacker has not comprised any hosts, and all communication provides authenticity and confidentiality. By using the various approaches for discover the solution up wormhole attack, the changing information of the packets could still be modified. So in order to give more robust protection in some special scenario like arena, which needs highly secured clue, there is required of establish some secured mechanism for wormhole detection and prevention. Taking into consideration this problem the proposed theory is developed. This paper argue proposed works on wormhole attack along with its available counter measures in ad-hoc wireless network.
Keywords – Machine learning, Wireless, coding and information theory, Markov process, Algorithm/protocol design and analysis
I. INTRODUCTION
introduced in the context of ad hoc networks. In wormhole attack malicious node captures packets from one location in the network, and “tunnels” them to another malicious node at a far. The tunnel is established through different ways like packet encapsulation, using high power transmission or by using direct antennas it makes the tunnelled packet arrive either earlier or with number of hops lesser compared to the packets transmitted over normal multihop routes. This creates the illusion that these two nodes provide the shortest path through them[8-11].
1. ALGORITHM
A wormhole tunnel can actually be useful if used for forwarding all the packets, it puts the attacker in powerful position compared to other nodes in the network, which the attacker could use in a manner that could compromise the security of the network. In wormhole attack the two remote regions are directly
connected through nodes (malicious) that appear to be neighbors but are actually distant from one another as shown in the figure1. Such wormhole attack results in the false route. So the wormhole attack is one of the most severe threats to ad-hoc networks, as it can do harm to both sender and receiver by performing packet dropping or alteration. This paper is organized as follows. lists the wormhole attack modes in , we discuss the solutions that have been proposed in the literature as a countermeasure for this attack[12-17]. Finally proposed approach for mitigating wormhole and conclusion
II. RELATED WORKS
It describes the Stream Control Transmission Protocol (SCTP). SCTP is designed to transport Public Switched Telephone Network (PSTN) signaling messages over IP networks, but is capable of broader applications. SCTP is a reliable transport protocol operating on top of a connectionless packet network such as IP. It offers the following services to its users: acknowledged error-free non-duplicated transfer of user data, data fragmentation to conform to discovered path MTU size, sequenced delivery of user messages within multiple streams, with an option for order-of-arrival delivery of individual user messages, optional bundling of multiple user messages into a single SCTP packet, and network-level fault tolerance through supporting of multi-homing at either or both ends of an association[18]. The design of SCTP includes appropriate congestion avoidance behavior and resistance to flooding and masquerade attacks.
Investigates end-to-end Concurrent Multipath Transfer (CMT) using SCTP multihoming for increased application throughput and reliability. CMT is the simultaneous transfer of new data from a source host to a destination host via two or more end-to-end paths. Simultaneous transfer of new data to multiple destination addresses is a natural extension to SCTP multihoming, but there are several design considerations.
Show that, provided packet headers can be used to carry an amount of side-information that grows arbitrarily large (but independently of payload size), random linear network coding achieves packet-level capacity for both single uncast and single multicast links. In the special case of Poisson traffic with i.i.d. losses, we give error exponents that quantify the rate of decay of the probability of error with coding delay. Our analysis of random linear network coding shows not only that it achieves packet-level capacity, but also that the propagation of packets carrying “innovative” information follows the propagation of jobs through a queueing network, thus implying that fluid flow models yield good approximations.
On Coding for Reliable Communication over Packet Networks (Lun, Medard, and Effros, 2004), a capacity-achieving coding scheme for unicast or multicast over lossy wireline or wireless packet networks is presented. We extend that paper’s results in two ways: First, we extend the network model to allow packets received on a link to arrive according to any process with an average rate, as opposed to the assumption of Poisson traffic with losses that was
III. DESIGN AND IMPLEMENTATION
In order to give more robust protection in some special scenario like battlefields, where highly secured information is required there is a need of developing some secured mechanism for wormhole detection and prevention[21-24]. So our aim is to
.Detection/removal of cooperative Black hole attack in MANET.
Analysis of black hole and gray hole attack on RPAODV in MANET. black hole attack in MANET
Active detection routing and date routing
Wireless networks are merged, in order to obtain the shortest path usually Distance Vector or Link state routing protocols are used[20]. These protocols do not per form well in ad-hoc wireless networks because wireless ad-hoc networks have limited bandwidth and there is no central control. Ad-hoc wireless networks are differ rent from other networks because of the characteristics like absence of centralized control, each node has wireless interface, nodes can move around freely which results in f requent changes in network topology, nodes have limited amount of resources and lack of symmetrical links i.e. transmission does not usually perform equally well in both directions. Therefore, modifications to these routing protocols or totally new routing protocols are required for the ad hoc wireless domain. Presently, there are f our ad-hoc routing protocols in demand for wireless ad-hoc networks i.e. AODV , DSR , TORA and OLSR . From the various ad-hoc routing protocols proposed, the authors founded TORA, DSR and for ad-hoc on-demand distance vector (AODV) routing protocols as most promising and compared them TORA is a distributed routing protocol for ad-hoc networks,
However, when the network size was increased to 80 and 100 nodes, for DSR, the number of packets in routing traffic received and sent, as well as the number of packets in total traffic received and sent, increase with increasing load[25-28]. However, for route discovery time and the number of hops per route, the performance depends primarily on the algorithm rather than on the load. For TORA, the number of packets in control traffic received and sent, as well as in ULP traffic received and sent, increases with the increment of loads. In the case of AODV, varying the number of nodes has no effect on the number of hops per route or route discovery time. Therefore, it was concluded that for specific differentials, TORA shows better performance over the two on-demand protocols, that is DSR and AODV.
System Initialization
In order to give more robust protection in some special scenario like battlefields, where highly secured information is required there is a need of developing some secured mechanism for wormhole detection and prevention[29-33]. So our aim is to build a robust and secure mechanism for preventing the devastating effects caused by the wormhole attack
IV. CONCLUSION & FUTURE WORK
We have mentioned the AODV protocol and Black hole attack in MANET. We have proposed a feasible solution for Black hole attack that can be implemented on the AODV protocol. The proposed method can be used to find the malicious node. Based on the trust value of node we define which path is most suitable for routing the packet and Untrusted node can easily remove or ignored[34-36]. As future work, we intend to develop simulation to analyze the performance of proposed solution based on the security parameters like packet overhead, memory usage, and mobility.
V. REFERENCES
