Overcome of Vampire attack using Clustering on Routing Protocol in WSN

(1)

International Journal of Recent Advances in Engineering & Technology (IJRAET)

________________________________________________________________________________________________

ISSN (Online): 2347 - 2812, Volume-3, Issue -6, 2015 48

Overcome of Vampire attack using Clustering on Routing Protocol in WSN

1Trupti Borgamwar, ²Kanchan Dhote

1,2Dept. of Electronics Communication Engineering TGPCET NAGPUR Email: ¹[email protected], ²[email protected]

Abstract— In a wireless networks the future research direction in prevention of vampire attack by existing routing protocol. The objective of this project is to examine resource depletion attacks at the routing protocol layer, which attempts to permanently disable network nodes by quickly draining their battery power. In this project presents analysis of routing protocols namely AODV (Ad hoc on demand). These protocols are analyzed on five QOS (Quality of service) parameters: Throughput, Jitter, Delay, PDR (Packet delivery ratio) and Energy consumption.

AODV is thus suitable for networks where nodes are having sufficient energy The results are shown in this project after the analysis for five parameters using NS-2 software. To reduce vampire attacks cluster head selection is used Encryption and Compression method is used. By using clustering, encryption and compression the performance protocol is improved and the improved results are shown with the help of graphs.

Index Terms— Routing Protocols; AODV; Encryption Compression.

I. INTRODUCTION

In a wireless sensor networks (WSNs) promise new applications in the future. Wireless communication is the technology’s which is biggest contributions to researchers . Further on the move internet facility and cheaply available wireless devices has added to this increase. These needs researchers have proposed various techniques to improve the efficiency and reliability of these wireless networks. A great deal of research has been done to enhance the survivability of wireless ad hoc networks. While the routing protocol schemes prevent short-term availability of network as well as they do not address attacks that effect long-term availability. The most permanent vampire attack is the resource exhaustion attack.

Testing mobile wireless protocols in a real-world environment presents numerous difficulties. These difficulties include creating repeatable scenarios with tens, hundreds, or even thousands of mobile nodes.

Creating multiple scenarios with only small variances is also quite challenging. Because of these difficulties, simulations of AODV have been created to test the protocol in a variety of repeatable scenarios. This paper describes recent work in the development of an

implementation of the AODV protocol. While the implementation is still in the process of completion, certain changes have already been necessary to the protocol. This paper presents a comparative performance analysis some of the breakthrough routing protocols for wireless networks. Routing protocols are analyzed on the basis of four network parameters: delay, throughput, jitter , PDR (packet delivery ratio) and energy consumption. The following section discusses these brief the routing algorithms namely AODV, AOMDV, DSDV, DMPDSR, improved AODV and DSR. Again the brief discussion the Encryption and Compression Algorithm.

II. LITERATURE SURVEY

1) Eugene Y. Vasserman and Nicholas Hopper

“Vampire attacks: draning life from wireless ad-hoc sensor networks”, In this paper explained that Ad-hoc low-power wireless networks are an exciting research direction in sensing and pervasive computing. Prior security work in this area has focused primarily on denial of communication at the routing or medium access control levels. The “Vampire” attacks are not specific to any specific protocol, but rather rely on the properties of many popular classes of routing protocols.

2) Soram Rakesh Singh and Narendra Babu C R “ Improving the Performance of Energy Attack Detection In WSN By Secure Forward Mechanism’’ In the paper mentioned that the Wireless ad-hoc sensor networks and routing data in them is a significant research area. The objective of this paper is to examine resource depletion attacks at the routing protocol layer, which attempts to permanently disable network nodes by quickly draining their battery power. PLGP with attestations (PLGP-a) is used for identifying malicious attack.

3) Elizabeth M. Royer “An Implementation Study of the AODV Routing Protocol” In the paper mentioned that the Ad hoc On-Demand Distance Vector (AODV) routing protocol is designed for use in ad hoc mobile networks. This paper details many of the changes that were necessary during the development of the implementation. As AODV continues to be refined, it is possible that further changes will be required, particularly when QoS operation is implemented.

(2)

________________________________________________________________________________________________

III. RELETED WORK

Introduction

Clustering is a technique which selects the number of cluster head depends upon cluster nodes energy and the same is used to transfer the data. The proposed model is on Ad hoc on demand Distance Vector routing protocol and also compared with Encryption and Cryptography in terms of the parameters such as Throughput, Packet Delivery Ratio and Packet Delay Time.

AODV PROTOCOL

Ad hoc On-demand Distance Vector (AODV) routing protocol uses an on-demand approach for finding routes.

In AODV, when a source node needs to send data, it initiates the route discovery process. The key feature of this protocol is distributed nature and the protocol has capable of both unicast and multicast routing. The route request packets use sequence numbers to ensure the freshness of routes. It is loop free, self-sharing and scales to large numbers of mobile nodes. AODV uses only symmetric links because the route reply packet follows the reverse path of route request packet. AODV define three types of control messages for route maintenance: RREQ, RREP and RERR.

Fig 1: process of AODV protocol

The above figure illustrated an AODV routing process.

Node A initiate the route for transmit a message. A transmit a RREQ message to all of its neighbours in the network. While this request is forward to J from it, J generates a RREP. This RREP is back unicast to A using the nodes H, G and D. Routing table are maintained for update their information. A node once getting RREQ may send a route reply (RREP), if it is either the destination or if it has a route to the destination with corresponding sequence number greater than or equal to that contained in the RREQ. In this case, it unicast a RREP back to the source, else if broadcast the RREQ.

Once a source node stops the sending data packets, the link will time out and ultimately be deleted from the intermediate node routing table. If a link break occur while the route is active, the node propagates the route error message to the source. After receiving the RERR, the source node can reinitiate the route discovery process.

Elliptic Curve Cryptography (ECC)

Elliptic curve cryptography [ECC] is a public-key cryptosystem just like RSA, Rabin, and El Gamal.

Every user has a public and a private key.

 Public key is used for encryption/signature verification.

 Private key is used for decryption/signature generation.

Elliptic curves are used as an extension to other current cryptosystems.

o Elliptic Curve Diffie-Hellman Key Exchange o Elliptic Curve Digital Signature Algorithm Image Compression:

Compression is used everywhere in the network applications. All the images you get on the web are compressed, typically in the JPEG or GIF formats, most modems use compression, HDTV will be compressed using MPEG-2, and several file systems automatically compress files when stored, and the rest of us do it by hand., These algorithms used in the real world make heavy use of a wide set of algorithmic tools, including sorting, hash tables, tries, and FFTs.

There are so many algorithms available for image compression like:

 RLE

 JPEG file format

 Wavelet

 JPEG 2000

 SPIHT

Run Length Algorithm:

RLE is a very simple form of data compression in sequences in which the same data value occurs in many consecutive data elements are stored as a single data value and count, rather than as the original run. This is useful on data that contains many such runs, for example, relatively simple graphic images such as icons, line drawings, and animations. It is not useful with files that don't have many runs as it could potentially file size is increase. In our example, let take a screen containing plain black text on a solid white background.

IV. RESULTS

To analyze these AODV protocol using cluster formation with the Encryption and compression we have implemented a wireless sensor network on NS-2 consisting of 30 wireless nodes. Figure below shows all the graphs for AODV protocol using cluster formation with the Encryption and compression show the all five parameters with there Before Cluster formation and after cluster formation with the Encryption and compression .The red colour in the below shown graphs, shows the performance of routing protocol before applying Clustering, Compression & Encryption and the green colour shows the results after the application of Clustering, Compression & Encryption.

(3)

________________________________________________________________________________________________

Table 1 Comparision of parameters Parameter

Protocol

Delay Throu ghput

PDR Energy Consump tion

Jitter

Before clustering

High Low Low High High

after appliying Clustering, Compression &

Encryption.

Low High High Low Low

Comparative Graph of Quality of Service Parameters after applying Clustering, Compression

& Encryption.

Figure 2.Comparative graph for delay

Figure 3.Comparative graph for Throughput

Figure 4.Comparative graph for Packet Delivery Ratio (PDR)

Figure 5.Comparative graph for Energy Consumption

Figure 6.Comparative graph for Jitter

V. CONCLUSION

In this paper, we have presented a performance analysis of four different routing protocols for wireless network communication. These protocols have been implemented in NS-2 and are analyzed on the basis of five crucial parameters: Throughput, delay, jitter PDR and energy consumption. After analysing the graphs , we conclude that AODV is better in comparison to AODV, DSR and DSDV as it has best throughput but suffers from high jitter and energy. AODV is thus suitable for networks where nodes are having sufficient energy. After applying the clustering, Compression &

Encryption ,the Quality of service parameters are improved.

REFRENCES

[1] Eugene Y. Vasserman and Nicholas Hopper “ Vampire attacks: draning life from wireless ad- hoc sensor networks,” IEEE Trans on mobile computing vol.12 no.2 year 2013

[2] LinaR.Deshmukh and Amol D. Potgantwar“

Prevention of vampire attacks in WSN using Routing Loop,” proceedings of IRF International conference,5th& 6th Feb 2014,Pune India.

[3] Susan Sharon George and Suma R “ Attack- Resistant Routing for Wireless Ad Hoc Networks,” International Journal of CS & IT, vol.5.(3),2014

(4)

________________________________________________________________________________________________

[4] A.Vincy, and V.Uma Devi “Maximizing Lifetime of Nodes in Wireless Ad Hoc Sensor Network by Preventing Vampire Attack,” IEEE International Conference on Innovations in Engineering and Technology, 21^st & 22nd Mar 2014.

[5] Gowthami.M, and Jessy Nirmal.A.G “Mitigating Vampire Attack in Wireless Ad-Hoc Sensor Networks”, IJARCST Vol. 2. Jan-Mar 2014.

[6] Vidya.M and Reshmi.S “Contending Against Energy Debilitating Attacks in Wireless Ad Hoc Sensor Networks” , IJIRAE vol. 1. Mar 2014 [1] YU-DOO KIM, IL-YOUNG MOON, SUNG-

JOON CHO “A COMPARISON OF

IMPROVED AODV ROUTING PROTOCOL

BASED ON IEEE 802.11 AND IEEE 802.15.4”,2009

[7] K.Ramesh1 and Dr. K.Somasundaram , “A COMPARATIVE STUDY OF CLUSTER HEAD SELECTION ALGORITHMS IN WIRELESS SENSOR NETWORKS”,2011.

[8] Kanchan Dhote, Dr.G.M.Asutkar, “Enhancement in the performance of quality of service parameters in routing protocols for wireless communication”,2015

[9] A. Nagarajan, , Dr.K.Alagarsamy, “An Enhanced Approach in Run Length, Encoding Scheme (EARLE)”,2011

[10] Elaine Brow, “Elliptic Curve Cryptography”, 2010

