An Efficient Jamming Attack Revocation in Wireless Network

2014 IEEE International Conference on Advanced Communication Control and Computing Technologies (ICACCCT)

An Efficient Jamming Attack Revocation in Wireless Network 3 2 Akila R\ Chellaswamy C ,Jeyaprabha T J

l 23 pG.Student, , Assistant Professor, l3 , Dept. of ECE, Sri Venkateswara College of Engineering, Chennai, India 2 Dept. of ECE, SRM University, Chennai, India l 2 3 [email protected], [email protected], [email protected]

Abstract-The important segment of networking is wireless

some interference attacks, known as jamming. Here jamming is

network and mobile network, which is used in high ratio now a

referred to as external threat. Some protocols and specific

day because the advantages of wireless networks are high even

schemes have been used to perform against the jamming

though when the wired networks are more stable than the

attacks. Also this protocols and specific schemes are active

wireless networks. The major advantages of wireless networks are mobility, easy setup, convenient, and expandable. But the major threat in the wireless network is jamming attack. To avoid jamming

attack

intrusion

detection

with

cryptographic

primitives are used for protect the integrity of packet. In this paper, we introduced a technique called Efficient Jamming Revocation (EJR), which is combination of EDH and OLSR are used against such attacks. During wireless transmission the cryptographic technique provides data packet integrity and the proactive routing protocol (OLSR) provides shortest route. The simulation result shows that the proposed system provides higher packet delivery ratio in optimized link state routing protocol

than distance vector routing protocol.

only for the short period of time. This jamming attack will get happen in 2 stages: TCP and Routing [1]. In this paper they have detailed about the jamming under internal threat. The cryptographic information will be available with the single receiver. Selective jamming means the information or data's with more importance. Once the packets have been classified, they have introduced some bit errors and therefore the packet cannot be recovered at the receiver side. The hacker, who tries to attack the messages in wireless networks, Jamming can take place at different layers; here this paper deals with the transport or network layer. Here some sort of encryption is been done and therefore the header and the information's in the packet are masked. By this attackers will know only the packet size,

Keywords-AODV (Ad hoc On-demand Distance Vector); ponent;

timing and sequence. Jamming can be simply explained as

OLSR (Optical Link State routing Protocol), ormatting; wireless

adding a unwanted noise signal to avoid the packets to be

network; jamming attack; routing protocol

received in the wireless network. But this paper not dealt with this type of jamming, they have tried for 3 advantages:

I.

jamming gain, targeted jamming and reduced probability of

IN TRODUC TION

Wireless and mobile networks represent an increasingly important segment of networking research as a whole, driven by the rapid growth of portable computing, communication and embedded devices connected to the Internet. Overall, it is clear that

mobile,

wireless

and

sensor

devices

will

certainly

outnumber wired end-user terminals on the Internet in the near

detection

[2].

The

degradation

of

the

wireless

network

performance is done by jamming. In general jamming is done by the attacker by introducing the electromagnetic interference in the network and therefore the message which is transmitted gets corrupted. Selective jamming attacks, here it means the main focus is on the highly important packets [3].

future, strongly motivating consideration of fundamentally new

Ubiquitous sensor network are used in houses, which will

network architectures and services to meet changing needs.

be connected to the patient, used as care systems. Sometimes

Over the next 10-15 years, it is anticipated that significant

this system gets affected by the both internal and external

qualitative changes to the Internet will be driven by the rapid

threats. In this paper they proposed a detection and trace back

proliferation of mobile and wireless devices, which may be

mechanism for jamming attacks on USN [4]. WMN been

expected to outnumber wired PC's as early as 2010. The

introduced

potential

transmission of data in wireless network.WMN applications are

impact

of

the

future

wireless

Internet

is

very

for

the

long

range

communications

and

of

community Networks, Military Networks where the data's

computation, search engines and databases in the background

should be highly secured. WMNs are attacked by both external

with the immediacy of information from mobile users and

and internal treats. External threats are in the form of random

significant

because

the

network

combines

the

power

channel jamming, packet replay etc and that are mainly due to

sensors in the foreground. Wireless

networks

are

of

a

fundamentally

different

character: To begin with, wireless connections are by nature significantly less stable than wired connections. The wireless medium is an open environment and therefore it may leads to

ISBN No. 978-1-4799-3914-5/14/$31.00 ©2014 IEEE

the foreign devices and that can be overcome by using cryptography based techniques [5]. Internal attacks occurs for the

selectively

'high

'important

packets.

These

internal

attackers cannot be easily overcome by some techniques, because they have the access to information's in secret.

784

2014 IEEE International Conference on Advanced Communication Control and Computing Technologies (lCACCCT) Therefore the addition of protocols can be used. By which the

of multipoint relays (MPR). Multipoint relays for a specific

attacker can be detected. To stop the role of eavesdroppers,

node are the only ones to send routing specific messages

wireless is enabled with CHAUM-MIXES and proxy servers

which

which uses layered encrypts data to prevent eavesdropping [6].

exchanged

are

and

broadcasted,

Wireless adhoc networks usage is in high range, since their

proactive

protocol,

application areas are increased. Security measure is considered

maintain

at different layers, the attacks like jamming of packets takes

neighborhood; it uses "HELLO" messages in order to inform

and

it

to reduce the amount of

makes

update

the

data

traffic

duplicates.

OLSR

defines

tables.

First,

two

OLSR

As

ways acts

for

a to its

place. An intelligent classifier and it classifies the packets up to

its neighbors about its current links states. These "HELLO"

99.4% accuracy is introduced. The packet content and header

messages contain timeout, a hold time, and information about

information's are encrypted, in this paper DSR is used as a

link status, such as symmetric, asymmetric or MPR. OLSR

routing protocol and TCP as the communication protocol [7].

will

In order to avoid the internal attacks they have introduced an

packets

algorithm

These "HELLO" packets are broadcasted on a regular basis

known

as

GUIDE;

this

will

identify

the

use

this to

data

modify

base and

on all

neighbors

maintain

received

the routing

compromised users by evaluating the error in terms of false

and OLSR also uses topology

alarm and miss rate [8]. A normal anti-jamming techniques like

packet is a type of event scheduled and a node which

FHSS and DSS cannot be used to solve the problem, instead

determines a change in its direct neighborhood will send this

they

packet containing its address of the network and a list of its

have

introduced

Hopping), a new

UFH

(uncoordinated

frequency

anti-jamming technique and they have

analyzed the efficiency of UFH [9].

control

packets.

table. This

MPR nodes. This packet informs other nodes of topology changes. This will start a new route with the calculation

In order to avoid some attacks like packet injection and

process.

spoofing network level control information, cryptographic security techniques are translate to the sensor domain. In this paper to overcome this problem, they have used 2 approaches. One approach retreat from interferer and it is been done by spectral evasion and spatial evasion. The second approach is to adjust the resources such as power levels and communication coding [10]. The wireless network will lead to some attacks. In this paper this attacks are classified in to two types and they are passive attacks and active attacks. In passive attacks, the hacker intention is to get the information which is in privacy. In active attacks,

the

hacker

himself

will

be

participated

in

the

Figure I. Block diagram of proposed system

communication [11]. Linear cryptanalysis with the traditional DES & AES algorithms, and the result shows SHC-based algorithm can provide high security and reduction in energy

First, OLSR acts for its neighborhood; it uses "HELLO"

consumption [12]. The remainder of this paper is organized as

messages in order to inform its neighbors about its current

follows: introduction about the background of jamming attack

links states. These "HELLO" messages contain timeout, a

is presented in section 1; the overview of proposed system is

hold

given in section 2; different parameter is given in section 3; and

symmetric, asymmetric or MPR. OLSR will use this data

time,

and

information

about

link

status,

such

as

simulation result is given in section 4; finally conclusion is

base on all neighbors received packets to modify and

present in section 5.

maintain the routing table. These "HELLO" packets are broadcasted on a regular basis and OLSR also uses topology

II.

control packets.

SYS TEM OVERVIEW

Network formation is in the form of simulation work done

This packet is a type of event scheduled. Each of the

with the Network Simulator ns-2, Version 2.29. In the

nodes which detect a change in its direct neighborhood will

simulation 100 nodes are randomly distributed within the

send this packet containing its address of the network and a

network field of size 1000m

1000m. Then vary the node

list of its MPR nodes. This packet is used to inform other

speed from 5m/s to 30m/s. The Ad hoc On-Demand Distance

nodes of topology changes. This will start a new route with

*

intended for use by

the calculation process. Here Algorithm implementation is

mobile nodes in an ad hoc network. It offers quick variations

with a public key (PKA) or asymmetric key algorithm, a pair

Vector (AODV) routing protocol is

memory

of keys is used. Among one of the keys, the private key is kept

overhead, less network utilization, and determines unicast

secret and it will not be shared with anyone. The other key is

to

dynamic

link

conditions,

low

process

and

to

the public key, is not the secret one and can be shared with

improve the performance the optical link stability routing

anyone. When data format is converted in to a encrypted

protocol (OLSR) is used. The block diagram of the proposed

format by one of the keys, at the other side it can only be

routes to destinations within the ad hoc network and also

system is shown in Fig. 1 OLSR uses a state link routing

decrypted and recovered by using the other key. Mobility

protocol. It takes the decisions which are based on the shortest

models indicate the move of mobile users, and how their

path, using the Dijkstra algorithm for the calculation of this

velocity, location and acceleration changes over time. Here the

shortest path. This algorithm is the widely used for the state

network topology changes frequently and unpredictably due to

link

the arbitrary mobility of nodes. We model a dynamic network

routing.

Also,

a

OLSR

is

to

use

a

mechanism

785

2014 IEEE International Conference on Advanced Communication Control and Computing Technologies (lCACCCT) with 100 nodes, 0.5 sec pause time and maximum speed of

Engineering Task Force (lETF) for the secure exchange of

node movements in lOm/s. Let us focus on the performance of

data packets at the IP layer and is widely used to implement

this routing protocol. We evaluated the performance of AODV

Virtual

as a routing protocol and RSA as algorithm for authentication

encryption modes: Transport and Tunnel. Transport mode

using NS2. By implementing another routing protocol OLSR and

algorithm

EDH

for

authentication,

the

performance

comparison is been done by comparing the end to end delay, Overall delay, Throughput, Packet delivery ratio.

Private

Networks

A.

supports

two

encrypts only the data part in each packet, and not the header part. The Tunnel mode seems to be more secured because it encrypts both the part, includes data and header. On the other end of the receiving side, decrypting each packet is done by an IPSec-compliant device.

III.

(VPNs).IPsec

SENSING AND JAMMING

The sender and receiver device

shares a public key by the Internet Security Associate and Key Management

Layered Model

(lSAKMP/Oakley).The

Protocol/Oakley

communication between two nodes is shown in Fig. 3. In this

In a communication, the enemy of the communication

paper encryption is done before the packets are sent from the

system is the jammer, who interrupts in the communication

sender to the receiver during communication at the transport

between sender and receiver. The sensing and jamming layered

layer, there are many encryption techniques which can used for

architecture is shown in Fig. 2. Therefore if the jamming

the secured communication, the RSA and EDH are the two

occurs then the identification of jamming should be carried out.

techniques used and compared with each other in this paper for

These two things take place at different layers. The physical

determining the better result in improving the protection of data

layer calculates the start time of the communication and the

communication.

end time. We look at the issues of security in physical layer of the open system interconnection (OSI) reference model. The transport

layer

which

determines

the

packet

type,

the

encryption process and also the amount of traffic in the communication path

Figure 3. Communication between nodes Data in transit should be encrypted in order to preserve confidentiality. Sol: cryptographic Confidentiality

it involves the use of a secret key to the

technique consideration

of

the

confidential

is the key

management

data. and

hopefully we have expertise to manage own keys from trust authority. Table T. Parameters used for Simulation

Figure 2. Sensing and jamming layered architecture B.

Role ofEncription

Encryption is a technique used to transform data into a secret code. Each encryption technique uses a string of bits known as a "key" to perform the calculations. The length of the key is larger

if

there

are

more

bits

in

the

key,

the

multiple

combinations is provided and thus creates a difficult task to

In

RSA

Public-key/two-key/asymmetric

cryptography

break the code and unscramble the contents. IP Security

involves the use of two keys: 1. a public-key, which will be

(IPsec) is a protocol set which is developed by the Internet

known by anybody, and be used to create encrypted messages,

786

2014 IEEE International Conference on Advanced Communication Control and Computing Technologies (lCACCCT) and verify the signatures 2. A private-key, known only to the receiver, used for decryption of messages, and sign (create) signatures. It uses large integers (eg. 1024 bits). The Diffie­ Hellman key exchange method allows two parties that have no prior knowledge of each other to jointly establish a shared secret key over an insecure communications channel. Diffie­ Hellman key agreement is not limited to negotiating a key shared by only two participants. Multiple numbers of users can take part in an agreement by performing iterations of the agreement protocol and exchanging intermediate data. IV.

SIMULA TION RESUL TS

Figure 6. Loss of Packets

For estimating the performance of both the AODV and OLSR we used NS2 simulator. NS-2 has many and

The Fig. 5 shows the packet transfer between the sender

expanding uses included: To evaluate that performance of

and the receiver. AODV is used as a routing protocol to find

existing network protocols, to evaluate new network protocols before use, to run large scale experiments not possible in real experiments ,to simulate a variety of IP networks. NAM (Network Animator) and X-graph are the two software tools used in the simulation. NAM provides a visual interpretation of the network topology created. X- Graph is an X-Window application that includes: Interactive plotting and graphing animation Different parameters used in the simulation are

the route from the sender to the receiver. While the attackers are present in the network, there is high chance that packet may get loss, because the attackers will try to interpret in the communication of two nodes without the knowledge of sender and receiver. If that was done, there will be a loss of packet and

that

shown

in

the

Fig.

6,

therefore

without

any

cryptographic technique; we analyzed the performance with a high loss of packets.

given in Table I. -

..

.

...

I

lModl

10 ::130*):: Key ::t" ModI 10 ::01Z631:: Key ::4100 Node 10 ::00:173:: Key ::51Z4

Figure 7. Generation of keys for AODV with RSA

Figure 4. Fonnations of network with attacker node The Fig. 4 shows the network with the total number of mobile nodes is 48 including the attackers. The blue circle resembles the sender and receiver node and the two red circles resemble the attacker nodes. Node number 8, 10 are the sender

Using AODV as a routing protocol the simulation result is shown in Fig. 6 with more packet loss and therefore to avoid the loss, the cryptographic technique RSA is used.

node and the receiver node. ... ..... .. - .------..!..-- -_. - --"

"-_

"

j !.l

o

It

Figure 8. Loss of packets So by using this cryptographic technique the public key Figure 5. Transfer of Packets

and private keys are given to each node, that we can seen in

787

2014 IEEE International Conference on Advanced Communication Control and Computing Technologies (lCACCCT) the Fig. 7, the keys are generated for each node. By using this cryptography

technique

we

provide

the

authenticated

transmission of data and to avoid the damage in the network

Fig. 10 shows the comparison between average node to node delay for both AODV and OLSR. From this figure, OLSR has lowest average node to node delay than AODV.

by the attackers.

Packet delivery ratio (PDR) is defined as the ratio between

With a public key (PKA) or asymmetric key algorithm, a pair

the packets received by the destination to that generated by the

of keys is used. One of the keys, the private key is kept secret

sender. In the simulation CBR type traffic is used and it will

and not shared with anyone. The other key, the public key, is

limit the maximum throughput of the network. Fig. 11 shows

not kept secret and can be shared with anyone. When data is

the performance of PDR of the two different protocols AODV

encrypted by one of the keys, it can only be decrypted and

and OLSR. Compared with these two performances of PDR

recovered by using the other key.

AODV is better than OLSR.

i"'Wb

... _-[ 9 .g,

.

�" :.J .J

.

Qj O

.

•

o

•

•

•

·0

•

0

. . Pause Time -->

Figure 12. Throughput versus time

Figure 9. Transfer of packets in OLSR with EDH through MPR node

Throughput is the total number of packets transferred through The RSA is used along with AODV and the result is shown in the Fig. 8, even here there is a few losses of packets, but less when compared to the Fig. 6. The performance is increased with the use of RSA cryptography technique, but for the more improvement in avoiding the loss of packets between the two nodes, the OLSR with EDH is used and it shown in the Fig. 9,

the network per unit time. Comparison of throughput for both the AODV and OLSR are shown in Fig. 12.

Throughput of

OLSR is lower than that of AODV at high mobility of packet and the average throughput of AODV is higher than that of OLSR. In general, AODV protocol works well in the small network,

here we could see, there is no loss of packets and the

here in this paper the simulation is done with the small

performance is increased.

network which consists of 48 nodes and therefore AODV

vp®'

_ 0 .

protocol suits well to the current situation like less bandwidth. Whereas the OLSR protocol which supports huge network with large bandwidth. The end to end delay is less for the OLSR with the comparison of AODV and that shown in the Fig. 10. V.

CONCLUSION

In this paper, we introduced the secured communication between the nodes. The routing protocol AODV and OLSR is ��-+--�--T-�.--�"��.--�--��Pause Time

-->

Figure 10. Delay Vs time

used to fmd the routes between the nodes, so by this the performance of both the routing protocols are compared with each other. Thus with the OLSR routing protocol based on the identification

of

routes

we

improving

the

route

finding

method. The shared nature of the wireless med ium will allow attackers

to

interrupting

cause

damage

between

the

in

two

communication nodes

or

by

either

by

introducing

interference. Therefore, understanding the nature of jamming attacks in wireless networks, it is must to provide security for the protection of highly confidential data's and therefore we use . . Pause Time

---

. >

Figure I I. Packet delivery ratio versus time The average end-to-end delay is the average time taken by the packet to reach from the sending node to the destination node.

RSA

Technique

and

EDH

technique

for

providing

authentication for data and control packets. By using this technique we provide the authenticated data transmission and to avoid the damage in the network by the attackers. Finally the performance like throughput, delay and recovery time is analyzed by comparing the routing protocol AODV along with

788

2014 IEEE International Conference on Advanced Communication Control and Computing Technologies (lCACCCT) the

RSA

encryption

technique

and

OLSR

with

EDH

technique. REFERENCES [I]

Alejandro Proano and Loukas Lazos, "Packet-Hiding Methods for Preventing Selective Jamming Attacks," IEEE Transactions on Dependable and Secure Computing, Vol. 9, No. I, January 2012.

[2]

Timothy X Brown Jesse E. James Amita Sethi, "Jamming and Sensing of Encrypted Wireless Ad Hoc Networks," Interdisciplinary Telecommunication Program Dept. of Electrical and Computer Engineering, University of Colorado, Boulder, 2006.

[3]

Alejandro Proano and Loukas Lazos, "Selective Jamming Attacks in Wireless Networks," Proceedings of IEEE Communications Society subject matter experts for publication in the IEEE ICC, 2010.

[4]

Syed Obaid Amin, Muhammad Shoaib Siddiqui and Choong Seon Hong, "Detecting Jamming Attacks in Ubiquitous Sensor Networks," IEEE Sensors Applications Symposium Atlanta, GA, February 12-14, 2008.

[5]

Loukas Lazos and Marwan Krunz, "Selective Jamming/Dropping Insider Attacks in Wireless Mesh Networks," January 201I.

[6]

Abhishek Mishra, Parv Venkitasubramaniam, "Anonymity in Wireless Networks under Capture or Selective Jamming: An Admissible Length Study," IEEE 16th International Symposium on Wireless Personal Multimedia Communications, June 2013.

[7]

Tae Dempsey, Gokhan Sahin, Y. T. (Jade) Morton, "Intelligent Sensing and Classification in Ad Hoc Networks: A Case Study," IEEE A&E Systems Magazine, August 2009.

[8]

Patrick Tague, Mingyan Li, and Radha Poovendran, "Mitigation of Control Channel Jamming under Node Capture Attacks," IEEE Transactions on Mobile Computing, Vol. 8, No. 9, September 2009.

[9]

Mario Strasser, Christina Popper and Srdjan Capkun," Efficient Uncoordinated FHSS Anti-jamming Communication," Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing, Pages 207-218, 2009.

[10] Wenyuan Xu, Ke Ma, Wade Trappe, and Yanyong Zhang," Jamming Sensor Networks:Attack and Defense Strategies," 2006 [II] Mingyan Li, lordanis Koutsopoulos, and Radha Poovendran, "Optimal Jamming Attack Strategies and Network Defense Policies in Wireless Sensor Networks," IEEE Transactions on Mobile Computing, Vol. 9, No. 8, August 20IO. [12] Ruiping Ma, Liudong Xing, Howard E. Michel, Vinod M. Vokkarane, "Linear Cryptanalysis of a Survivable Data Transmission Mechanism for Sensor Networks," IEEE International Conference on Homeland Security, pp. 562-567, Nov 2012.

789