A Dissertation Proposal Submitted By

“A NOVEL APPROACH ON SAT KAMAN

PROTOCOL TO PREVENT DOS ATTACK IN

MANET”

A Dissertation Proposal

Submitted By

Simranpreet Singh

(10810446)

To

Department of Computer Science & Engineering

In partial fulfilment of the Requirement for the

Award of Degree of

Master of Technology in Information Technology

Under the guidance of

Mr. MANMOHAN SHARMA

Assistant Professor, LPU

(APRIL 2015)

i

PAC FORM

ii

ABSTRACT

Wireless network technically, refers to the category of networks in which

intercommunication between nodes is implemented without the use of wires. Wireless

networks use radio waves and microwaves to establish communication between the

devices. The Kerberos assisted authentication protocol is the efficient protocol that has

been used for this identity validation. KAMAN, the extension of Kerberos protocol,

which is responsible for the authentication of nodes from secure server. SAT KAMAN

means secure, acknowledge and timer based KAMAN. This can caused for large

number of attacks like replay attack, fabrication, eavesdropping etc. Kaman provides

secure solution to the problem of secure channel establishment, secure exchange of

session keys and prevention of nodes identity forgery. In this work, the Kaman

(Kerberos assisted Authentication in Mobile Ad hoc Network) model has been analyzed

for the existing loopholes. Black hole attack that aroused when Kaman protocol is

embedded into large network has been worked upon, by the incorporation of the timers.

AODV, on-demand routing protocol had been used to select the secure small path and

node communicate with an authenticated server for mutual authentication, optimal path

will be selected by the virtue of the proposed methodology. Thus, it ensures the secure

communication establishment in case of mobile ad hoc networks. Hence the network

performance has been upgraded.

iii

CERTIFICATE

This is to certify that Simranpreet Singhhas completed M.Tech Dissertation Proposal

titled “A NOVEL APPROACH ON SAT KAMAN PROTOCOL TO PREVENT

DOS ATTACK IN MANET”under my guidance and supervision. To the best of my

knowledge, the present work is the result of his original investigation and study. No part

of the dissertation proposal has ever been submitted for any other degree or diploma.

The dissertation proposal is fit for the submission and the partial fulfillment of the

conditions for the award of M.Tech Computer Science & Engineering.

Date: 04-May-2015 Name: Mr. Manmohan Sharma

Signature of Advisor: UID:16073

iv

ACKNOWLEDGEMENT

I would like to express my sincere gratitude to my advisor Mr. Manmohan Sharma for

the continuous support of my thesis study, for his patience, motivation, enthusiasm, and

immense knowledge. His guidance helped me in all the time of research and writing of

this thesis. I could not have imagined having a better advisor and mentor for my M.Tech

study.

v

DECLARATION

Iherebydeclarethatthedissertation proposal entitled“A NOVEL APPROACH ON

SAT KAMAN PROTOCOL TO PREVENT DOS ATTACK IN MANET” submitted

forthe M.Tech Degree is entirely my original work and all ideas and

referenceshavebeendulyacknowledged.Itdoesnotcontainanyworkfor

theawardofanyotherdegreeordiploma.

Date:04-May-2015

Investigator

SIMRANPREET SINGH

Reg.No. 10810446

vi

TABLE OF CONTENTS

PAC FORM ......................................................................................................................... i

ABSTRACT ......................................................................................................................... i

CERTIFICATE ................................................................................................................ iii

ACKNOWLEDGEMENT ................................................................................................ iv

DECLARATION ................................................................................................................ v

LIST OF TABLES ........................................................................................................... vii

LIST OF FIGURES ....................................................................................................... viii

CHAPTER 1INTRODUCTION ....................................................................................... 1

1.1 WIRELESS NETWORK ......................................................................................... 1

1.2 MANET (Mobile AD-HOC Network) .................................................................... 4

1.3 AODV ROUTING PROTOCOL ............................................................................ 8

1.4 WHAT IS KERBEROS PROTOCOL? ............................................................... 11

CHAPTER 2REVIEW OF LITERATURE .................................................................. 14

CHAPTER 3PRESENT WORK .................................................................................... 17

3.1 PROBLEM FORMULATION .............................................................................. 17

3.2 OBJECTIVES OF THE STUDY .......................................................................... 19

3.3 PROPOSED METHODOLOGY .......................................................................... 20

CHAPTER 4RESULTS AND DISCUSSIONS ............................................................. 25

4.1 SIMULATION ........................................................................................................ 25

CHAPTER 5 CONCLUSION AND FUTURE SCOPE ............................................... 47

CHAPTER 6PUBLISHED PAPERS ............................................................................. 48

REFERENCES ................................................................................................................. 49

APPENDIX ...................................................................................................................... 51

vii

LIST OF TABLES

Table 1: DRI Table .......................................................................................................... 43

Table 2: PACKET DELIVERY TABLE ....................................................................... 43

viii

LIST OF FIGURES

FIGURE 1: Wireless Networks ......................................................................................... 1

FIGURE 2: Infrastructure Based Network ..................................................................... 2

FIGURE 3: Infrastructure Less Network ........................................................................ 3

FIGURE 4: MANET Routing Protocols [1] .................................................................... 5

FIGURE 5: AODV Route Request[1] .............................................................................. 9

FIGURE 6: AODV Route Reply[1] .................................................................................. 9

FIGURE 7: Black Hole Attack[2] ................................................................................... 10

FIGURE 8: Gray Hole Attack ........................................................................................ 11

FIGURE 9: Kerberos Protocol operations .................................................................... 12

FIGURE 10: Flow Chart ................................................................................................. 21

FIGURE 11: Attack in KAMAN Schema ...................................................................... 21

FIGURE 12: Cross Verification Phase .......................................................................... 23

1

CHAPTER 1

INTRODUCTION

The group of computers or mobile devices that are linked connected together through a

medium is known as Networking. The devices can be linked through a wired or wireless

medium. Networking is used to exchange information like data transmission. The two

type of network used in the data transmission are wired and wireless. Wired network is

that which used wires for communicate with each other’s and wireless network is that

which communicate without the use of wires through a medium.

1.1 WIRELESS NETWORK

The network that does not require any type of wire to communicate is commonly known

as wireless network. Wireless Network uses radio waves for the communication between

the devices. Now a day’s wireless network become one of the common need because it

provides you the facility to communicate without using wires using radio waves. Wireless

Network commonly known as Wi-Fi. The standard defined by IEEE for wireless network

is 802.11. Wireless Network defines some protocols that are responsible for providing the

communication service between the devices.

FIGURE1: Wireless Networks

2

Wireless Network is based on some operating modes named as follows:

Infrastructure Mode

Infrastructureless Mode or Adhoc Mode

Infrastructure mode is one that uses a pre constructed infrastructure for the

communication between the devices. Infrastructure mode uses a centralized control and

access point for providing the access.

Infrastructure less or Adhoc Modeis that which do not need any pre constructed

infrastructure for the communication. In Adhoc mode every device act as router and

forwards the data to the next device.

1.1.1 Types of wireless network:

Wireless Network nowadays becomes one of the major part of networking. The use of

wired network become history, now wireless networks are provided as much speed as

wired network. Wireless network is mainly divided into two parts:-

Infrastructure Based Network:

FIGURE2: Infrastructure Based Network

Infrastructure Based Network is depending on a pre-constructed infrastructure.

Infrastructure Based Network needs an access point to communicate with one another.

Infrastructure mode network are set up either by communicate indirectly through a central

place or through an access points directly to one another. The first is called infrastructure

modes. At this stage some access points are defined which provides the small network.

Infrastructure modes are advantage of the high power of an access point to cover wide

region. In this case access points are directly connected with the server with the wireless

3

network. Also, these access points are further connected to the different systems with the

wireless link.

Infrastructure Less Network:

FIGURE3: Infrastructure Less Network

Infrastructure less Network does not need any pre-constructed infrastructure to

communicate with one another. Infrastructure less network can be used to communicate

with one another during emergencies. There are many types of infrastructure less network

available but the study mainly focuses on MANET.

Types of infrastructure less or Adhoc Network:

There are mainly three types of infrastructureless or Adhoc networks available. These are

as following:

MANET (Mobile Ad-Hoc Network)

Wireless Sensor Networks (WSN)

Wireless Mesh Networks (WMS)

4

1.2MANET (Mobile AD-HOC Network)

MANET or Mobile Adhoc Network is a self-organized and self-maintain wireless

network consisting of mobile nodes. MANET wireless communication system can be

deployed rapidly on the fly. It is very significant example include establishing survivable,

efficient, dynamic communication in case of disaster operations, relief efforts, military

networks and emergencies. In MANET network scenarios cannot rely on centralized and

organized connectivity. MANET network is autonomous collection of mobile users that

communicate over relatively bandwidth constrained wireless links. Mobile network

topology may change rapidly and unpredictably from time to time. MANET or Mobile

Adhoc Network is decentralized type of network where all network activity including

discovering the topology and delivering messages must be executed by the nodes

themselves. The application of mobile ad hoc network constrained by power sources, to

large-scale, mobility, high dynamic networks. The design of network protocol for this

network is complex issue. Mobile Adhoc Network has used different distributed

algorithms to determine the network, link scheduling and routing. In the mobile ad hoc

network, nodes find the shortest path between the source and destination which is usually

the optimal route. MANET is set of mobile nodes which communicate over radio and do

not need any fixed infrastructure. This type of network is very flexible and suitable for

several situations and applications as it is infrastructureless. Due to the limited

transmission range of wireless interface the communication traffic has to relay over

several intermediate nodes to enable the communication between the nodes.

MANETcomplete the functionality of hosts but each node also be router to forwarding

packets for other nodes.

As MANETs are illustrate by limited bandwidth and node mobility, there is demand to

take into account the energy efficiency of the nodes, topology changes and unreliable

communication in the design. There are many types of protocol are available in Mobile

Adhoc Network. The protocols available are as follows:

1.2.1 Routing Protocols in MANET:

Routing protocols are developed to define the route from one device to another. It helps to

search shortest route from source to destination.

5

There are mainly three types of routing protocol available. These are as following:

FIGURE4: MANET Routing Protocols [1]

Proactive Routing Protocol:

Proactive protocol is the type of protocol that does not always create new route

when a source request the route to destination instead it will check its routing table

and finds the route. Proactive Routing protocol works faster than the Reactive

protocol. It is also known as table driven protocol. Some examples of proactive

protocol are DSDV, OLSR.

Reactive Routing Protocol:

Reactive Protocol is other type of protocol which always builds a new route when

source requested a route to the destination. Reactive protocol is a lazy protocol.

Reactive Protocol is also known as on demand protocol. Some main reactive

protocols are AODV, DSR etc.

Hybrid Routing Protocol:

Hybrid Routing Protocol is the combines the functionality of both proactive

routing protocol as well as reactive routing protocol. Hybrid routing protocol uses

the route discovery functionality of reactive routing protocol and table

maintenance functionality of proactive routing protocol. Hybrid routing protocol

divides the network into the zones and perform routing. It is mainly suitable for

large network. One of the main example of hybrid routing protocol is ZRP i.e.

Zone Routing Protocol.

6

1.2.2 Applications of the MANET:

As the moveable devices in wireless communication increases, ad-hoc networking is

become widespread applications. Anywhere where there is small or no communication

infrastructure is exist or the existing infrastructure is inconvenient or expensive to use. Ad

hoc networking allows the devices can be simply adding and removing devices to and

from the network and to keep connections to the network also. MANET is become very

vast in these days by increase its scalability, provide mobility, become dynamic in nature

etc. The application of MANET is as follows:

Emergency Services:

It can be used in emergency operation where nature disaster occur or any accident,

flood, earthquake where no existing network exits to provide them reliefs. It

collected information from effected area to the people for their help or to any local

control posts. As soon as the control post comes to know about situation they give

responsibilities to works to help them as soon as possible and provide doctors and

other help which they wants at that time.

Military Battlefield:

Military equipment contains some kind of computer equipment. Military take

advantage of common place network technology to keep an information network

between the vehicles, soldier and military information headquarters using adhoc

networks. From this field the basic techniques of ad hoc network came.

Entertainment and Local level:

Ad hoc networks can also link temporary multimedia network palmtop computers

to share and spread information among participants at conference and classroom

using notebooks, laptops and computers. It can be used as home networks where

devices can communicate to exchange information directly [2]. It can be used as

peer to peer networking and multi user game and in theme parks.

Commercial Environments:

It can be used for the purpose of business in dynamic databases and mobile

offices. In the field of E-commerce it can help in the purchasing like we can be

purchase anything from anywhere and electronic payments can be made. In

vehicular service it can be used to transmit the information of road accident, inter

7

vehicles network and road transmission. In sports stadium, taxicab adhoc

networks also help.

Personal Area Network (PAN):

The interconnection between short ranges devices like mobile, PDA, laptops are

comes under PAN communication in adhoc networks. The wired system is

replaced by the wireless communications. It extends the internet scalability to

access the internet with the help of Wi-Fi LANS, GPRS, and EDGE. It has greater

scope in future.

1.2.3 Advantages of MANET

The main advantages of the Adhoc networks are as follows:

In MANET there is no need of centralized network. It can be setup anywhere as

the nodes are mobile.

No need of pre-constructed network setup.

Nodes act as router forwarding data from one to another.

MANET is very flexible type of network.

Last but not the least, In MANET you can scale up and down the network

anytime.

1.2.4 Disadvantages of MANET

The disadvantages of MANET are as following:

One of the main disadvantage is regular changing topology.

No centralized access.

Lack of resources.

Different protocols for Adhoc Network

Detecting of malicious node is very difficult without central access.

8

1.2.5 Challenges to MANET

The main challenges to MANET are as following:

Routing is one of the main challenge to MANET because of regular changing

topology.

Security and Reliability is other challenge to MANET due to neighbor relying

packets.

Providing the Quality of Service in constantly changing environment.

Last but not the least Power Consumption is also another challenge to MANET

because MANET rely on battery power.

1.3AODV ROUTING PROTOCOL

AODV is an ad-hoc on demand distance vector routing protocol that establishes route to

the destination when it is desired by the source node. It maintains these routes as when

needed by the source node. It offers quick adoption to dynamic link conditions, low

processing, memory overhead, low network utilization, and determines unicast routes to

the destinations within the ad-hoc network [1paper]. Route Request (RREQ), Route

Reply (RREP), Route Error (RERR) messages are three control packets that are used in

AODV. RREQ and RREP are used in route discovery process and RERR is used in

maintenance phase. AODV also maintains destination sequence number for each routing

table entry. AODV protocol firstly discover the route by using route discovery process, In

route discovery process firstly, source node broadcast a Route Request Packet (RREQ) to

all its neighbors, and they transmits packet to their neighbors until and unless they find a

valid route to the destination. After receiving Route Reply (RREP) messages, source node

check its table and selects the route with the highest sequence number. If a link breaks,

neighbors of that link broadcast Route Error Message (RERR) through the network to

alert other nodes about this failure.

AODV protocol does not provide a complete view of network topology to the nodes. In

AODV protocol each node only knows about only its neighbors. AODV protocol is not a

secure protocol in MANET. The security of AODV protocol is compromised due to

presence of the malicious nodes in the network. The malicious node can be a Black hole

as well as it can be a Gray hole node.

9

The standard AODV protocol cannot detect malicious node in the network due to its

nature of finding the new routes to destination every time a source request to transfer the

data packets.

FIGURE5: AODV Route Request[1]

FIGURE6: AODV Route Reply[1]

10

1.3.1 Black Hole Attack in AODV Protocol

Black hole attack is one of most frequent attack that happened in the network. In black

hole attack the malicious node falsely advertise that it has the shortest path to the

destination. The reason behind such malicious activity is to stop the destination from

receiving the packets. In Black hole attacker introduced itself as the destination or it has

the shortest path to the destination by replying with a high sequence number RREP

message. The source node selects the high sequence RREP message and ignores all other

RREP message including the correct ones and starts transmitting the data packets to the

malicious node. The malicious node will not forward any data packet to other nodes

instead it will drop all the data packets. This type of attack is very severe to detect and we

proposed a technique to detect and to prevent black hole attack in Mobile Adhoc

Network.

FIGURE7: Black Hole Attack[2]

1.3.2 Gray Hole Attack in AODV Protocol

Gray hole attack is bit similar to black hole attack with a small variation where the

malicious node does node drop the whole packets instead it will drop some selective

packets. In Grayholeattack, a node which is member of the network, gets RREQ packets

and create a route to destination. After creating the route, it drops some of data packets.

Grayhole attack is very difficult to detect because malicious node do not drop data

packets regularly but instead it will drop the data packets occasionally. Therefore

11

sometimes node will act normal node and sometime node switch to malicious node.Gray

hole attacks are more frequent in AODV routing protocols and are bit hard to detect and

can cause disruption in the network without being detected.

FIGURE8: Gray Hole Attack

1.4WHAT IS KERBEROS PROTOCOL?

Kerberos is the network authentication protocol and it provides strong authentication to

the clients and servers. Kerberos protocol facilitates secure communication between the

clients and servers by the incorporation of a secret-shared key. The client, when wishes to

communicate with the server, has to authenticate itself to the server. While proving its

identity, client has been sharing its password to the server. Once the password has been

matched and correctly client will successfully authenticated. If the passwords are

unencrypted, then attacker can simply sniff the network traffic and get the access to the

passwords of the legitimate clients. When illegitimate client gets the password of the

legitimate client, it can use it whatever way he wish to. Kerberos protocol provides

imbibement of encryption in the passwords. The legitimate client prior to the

12

establishment of the authentication encrypts the password that has been used for

validating identity. When client will be successfully authenticated with the server, all the

communication between the client and server will be in the cipher text form.

Consequently, data integrity and privacy has been ensured.

FIGURE9: Kerberos Protocol operations

As, shown in the FIGURE9, when the client wants to successfully authenticate with the

application server. It needs to get the hold of the ticket which it presents to the application

server. For getting the ticket, client communicates with the key distributed center

components. Authentication server and Ticket Grand server are the two components of

Key Distributed Center.

Following are the messages which are exchanged between the client, Key Distributed

Center and Application Server for successful Authentication:-

Message 1: Client sends its identity to the Authentication server and requests for

the ticket (TGT).

Message 2: When authentication server successfully validates the identity of the

client. It provides the TGT to the client, which then decrypts the TGT with its own

hash password.

Message 3: When client gets the TGT, it presents TGT to the ticket grand server

to receive the service ticket.

13

Message 4: When Ticket grand server verifies the TGT, it provides the service

ticket to the client.

Message 5: When client gets the service ticket, it then presents the service ticket

to the application server for mutual authentication.

Message 6: When the client and server are mutually authenticated, server

provides the session key for secure communication between two.

Following are some of the disadvantages of Kerberos Authentication Protocol:-

In the Kerberos protocol, if the service ticket granted by the ticket grand server

has been compromised, Kerberos protocol will be at risk.

If the two parties are communicating with each other and one of the parties is

using Kerberos protocol, then both the parties will not be benefitted of using the

Kerberos.

In Kerberos authentication protocol, we require a secure server, that maintains

the copy of the hashed passwords of the clients. The secure server must be

physically and technically secure.

Kerberos authentication protocol uses secure server for mutual authentication, if

the secure server goes down, then the protocol will be at risk.

Kerberos protocol only works with single user per workstation. When the

number of users at single workstation increases, Kerberos protocol will fail.

14

CHAPTER 2

REVIEW OF LITERATURE

This chapter reviews the literature about the previously proposed techniques for detecting

and preventing Black and Grayhole attack.

Marti et.al (2000)proposed a technique to trace malicious nodes using watchdog. This

protocol works by checking the routing table of next node that the node forwards the

packet or not. In this technique when a node forwards the data packet to its neighbor node

than node’s watchdog verifies that next node forward the data or not. If the neighbor node

does not forward the data packet in a defined threshold time than it will blame the next

node as malicious node [3].

Sukla Banerjee (2001)proposed a technique for detection and removal of Black and Gray

hole in MANET. In this technique firstly the source node will divide all data packets into

K equal parts, after source node sends a message to destination informing about the

number of packets. If destination node does not receive total number announced packet

than it starts removing the malicious node from the network. Also, neighboring node uses

a counter for counting the data packet of its neighbors [4].

Steven M. Bellovin et.al (2002) Author of this paper discussed Kerberos authentication

protocol and various limitations of Kerberos authentication protocol. The main limitation

of Kerberos authentication protocol was that large numbers of messages were exchanged

for successful authentication and this approach had been degrading the battery

performance of the hand held devices. Second, disadvantage is the assumptions of the

Kerberos authentication protocol when environment changed assumptions are need to

changed for efficient working of Kerberos protocol. Reply attack, login spoofing, session

key expose, password guessing attacks are possible in Kerberos authentication protocol.

S. Ramaswamy et.al (2003) proposed a technique that uses Data Routing Information

table. The DRI table uses two fields named as ‘from’ and ‘through’. From nodes is that

from which the node getting the data packets and through node is that sends the message

to current node. The mechanism will check the value of ‘from’ and ‘through’ fields. This

protocol uses RREQ and RREP packets [5].

15

Priyanka Goyal et.al (2004) have introduced the elementary problems of ad hoc

network by giving its background which is related to its work including the concept,

status, features and vulnerabilities of MANET. This paper presents summarized study of

the routing protocols. Different types of Routing protocol like reactive, proactive and

hybrid routing protocol and their subcategories all are mentioned in this paper[6].

HizbullahKhattak et.al (2005) introduced a mechanism that is based on Optimal Path

and Hash Based Scheme. The proposed solution chooses the second shortest path by

discarding the first shortest path. This solution also embeds the technique of hash

algorithm which maintains the integrity of the data [7].

Harmandeep Kaur et.al (2006)proposed a mechanism that will integrate the Data

Routing Information table (DRI) with Ant Colony Optimization (ACO). The proposed

mechanism send a promiscuous mode activation message to all neighbor nodes and

checks the DRI table of all nodes and after that find all available path from source to

destination using ACO table[8].

Kurosawa, Satoshi et.al (2007)introduced a new algorithm that is based on the limit of

sequence number. The proposed algorithm checks the RREP packets number with the

threshold value of that route, if the RREP sequence number is higher than the node,

source enters the node ID in the block list and broadcast the node as malicious node[9].

Sen, Jaydip et.al (2008)proposed a four step method for the detection of gray hole in the

network. The first step is Data Collection of neighbors in which every node will gather

the information of its neighbor and enters in its DRI table, in next step which is ‘local

anomaly detection’ source selects a Cooperative Node (CN) by checking the DRI table of

that node. Source node forwards a RREQ packet to CN and asks it if it receives the packet

or not, if not it will increase its maliciousness. Third step is Cooperative Anomaly

Detection is done to avoid the mistake in the detection of malicious node. Last step is

‘Global Alarm Sending’ in which source broadcast the node as grayhole node[10].

Alem et.al (2010) proposed a technique based on Intruder Detection using Anomaly

Detection. IDAD monitored the activities of nodes and collect the audit data. IDAD

compare the activity of each node with audit data and find the malicious node and isolate

it from the system[11].

16

Yang, Shu et.al (2010) proposed the two combine method technique to prevent the

Mobile Adhoc Network i.e. local collaboration of neighboring nodes to monitor each

other and cross validation method in which each node cross verify the next node and

monitor overheads transmission. The technique improves the security of Mobile Adhoc

Network to some extend but in some case this technique breaks[12].

P. Agarwal et.al (2011)proposed a technique for detecting cooperative malicious black

and grayhole nodes in mobile Adhoc networks. The technique initially establishes a

trustful backbone network of strong nodes over ad hoc network. Each strong nodeis

assumed to be a trustful one. These strong trustful nodes detect the malicious nodes

between the regular nodes. The backbone network of trusted strong nodes carry out end-

to-end checking to determine whether the data reached the destination or not. If result

fails then the backbone network initiates a protocol to detect the malicious node in the

network[13].

Assad Amir Prada et.al (2011)in this paper they had proposed a new mutual

authentication scheme is Mobile ad hoc Network. Kerberos Assisted Authentication

Scheme is the extension of tradition Kerberos version 5 Protocol. They had assumed that

the hashed password of users is stored on the server and each server is mutually

authenticated with other server. When any mobile node wants to communicate with the

mobile node .Secure server provides shared key communication between the mobile

nodes is encrypted with that shared key.

G. Carolio et.al (2012)proposeda technique that improves routing efficiency of Mobile

Adhoc Network by selecting the most stable path so as to reduce the latency and

overhead. The selection of path depends on mobility patterns of nodes in the network and

this mobility pattern depends on the movement of nodes with respect to other nodes in the

Mobile Adhoc Network[14].

Sung-Ju Lee et.al (2013)proposed a new type of technique known as AODV-BR. The

proposed technique is based on backing up the alternate routes to the destination. The

technique uses mesh structure and alternate paths. The scheme can be merged with any ad

hoc on demand routing protocol. The backed up alternate routes can be used when data

packets cannot delivered using primary routes. The proposed technique will improve the

efficiency of the network[15].

17

CHAPTER 3

PRESENT WORK

3.1 PROBLEM FORMULATION

In Mobile Ad-hoc networks, security is one of the most important concerns because this

system is more exposed to attacks than a wired or infrastructure-based wireless network.

It is very challenging task to design a good security protocol. This is generally due to the

unique features of MANETs, namely pooled broadcast radio network, insecure operating

atmosphere, absence of central authority, absence of association among consumers,

limited availability of resources.

Security issues of MANETs in group (multicast) communications are even more

challenging because of the involvement of multiple senders and multiple receivers.

Although several types of security attacks are possible in MANETs but black hole attack

had been studied in the literature, Black hole attack affects the network performance. To

meet the security challenges of MANETs, in group communication nodes in the ad hoc

network should trust each other. To maintain the trust relationship between the nodes

mutual authentication is needed, various mutual authentication algorithms have been

studied in the literature. KAMAN is the most secure and easy to implement algorithm.

Along with this, it is the extension of secure Kerberos authentication protocol.

In KAMAN model the mutual authentication procedure between nodes and server is

explained. It is as under:-

Suppose two mobile nodes are node 1 and node 2. Server1 and server 2 are the

authentication servers. When mobile node 1 wants to communicate with node 2. Node1

and node 2 should be mutually authenticated with the authentication server. For

authentication, node 1 requests for a ticket to server 1. When node 1 has been

successfully authenticated, server 1 sends ticket to node 1.Ticket contains the virtual ids

of node 1 and node 2. Shared key communication between node 1 and node 2 is

encrypted with shared key and tickets are encrypted with public key of node 1. When

node 1 receives ticket, it decrypts the ticket with its own private key and encrypts the

same ticket with the public key of node 2. When node 2 receives, ticket from node 1, it

will decrypt that ticket with its own private key. After receiving the ticket, node 2 sends

acknowledgment to node1. On receiving the acknowledgment node 1, starts

18

thecommunication with node 2. Both the servers, server1 and server2 have been

replicated. In KAMAN, we have assumed that hashed passwords are stored on the

authentication servers and each server is mutually authenticated with other server. But

when we talk about large number of nodes present in network then a ticket replay attack

is possible. A paper published in 2012 which is modification in KAMAN and prevents

Ticket replay attack. In this paper they have added one feature in KAMAN model that

was the incorporation of the session key. When node asked, for the ticket from server, it

has been granted to the node with the session key. The session key indicates the tenure of

this communication. In the network, malicious node drops the packet and next nodes will

not be able to receive the packets. In this model, a malicious node gets the session key

from the server. When the legitimate node asked for the ticket, it changes the session key

and sends to the legitimate node. Now the Malicious node listen the communication and

may even change the messages. Confidentiality has not been achieved here.

In this work, when KAMAN protocol is embedded into larger network, multipath routing

is needed. We have used AODV, simulation-based, results to illustrate that black hole

problem arises in KAMAN. When a black hole node, who is requesting for a ticket to

server, will not be able to get the ticket from the server,consequently, communication will

not be started between the illegitimate nodes. To solve this problem in KAMAN model

we have used timers. When a node requests for a ticket, it chooses the path according to

AODV routing protocol. If the legitimate node, have not received the ticket between

defined interval of time. Then it signifies that, black hole problem has arisen, which leads

to dropping of the tickets or packets. The node has tried to choose the second path for

request and it gets the ticket in defined interval amount of time. Then the communication

takes place. By using the timer black hole problem is solved in KAMAN model.

19

3.2 OBJECTIVES OF THE STUDY

When we deal with the web MANET, more security is required because MANET do not

depend on pre-constructed infrastructureand in MANET nodes are free to join and leave

the network any time so while looking at appropriate security schema the objectives of

our work are as following:

Study of Kerberos assisted authentication protocol.

Implement KAMAN (SAT) model in large network and demonstrate the problems

associated with it.

Enhancement in KAMAN model using timers.

To Increase reliability and confidentiality in data transmission.

20

3.3 PROPOSED METHODOLOGY

This work is about wireless ad hoc networks .The purpose of this work is to promote the

secure and reliable data transmission. It has been attained by the use of Kerberos assisted

authentication protocol with multipath routing ADOV protocol .Kerberos assisted

authentication protocol have been used for the mutual authentication, to maintain the

trust relationship between the mobile nodes and multipath routing protocol AODV for

fast data transmission.

Here our work is based on two methods:

Kerberos assisted authentication protocol

Multiple routing protocol AODV

We are implementing the KAMAN model in large network and embedded AODV routing

protocol with the same. The network had been set up with finite number of nodes and

servers, along with defining the source and destination nodes. By using AODV routing

protocol, source chooses the shortest path between source and server. Source wishes to

communicate with destination. So prior to communication, there must be mutual

authentication established between the two parties. For mutual authentication, source

requests to its nearest server. The source sets the threshold value of timer. If source gets

the ticket within threshold value, then sends the same to the destination for mutual

authentication. If not, the source has to change its path, as Black hole has been triggered

and it drops the ticket. So, source has to make the request to the server for ticket again.

When source gets successfully authenticated to Server, Server then issues Ticket to

source. If the ticket is successfully received by the source afterwards, source passes that

Ticket to destination. When destination receives, the Ticket it sends the acknowledgement

to source. Ticket contains the shared key which is generated by the Server. Data

exchanged between source and destination is encrypted by using shared key. Server 1 and

Server 2 both are mutually authenticated. The servers are self-replicating and keep on

producing their replicas from time to time.

21

In KAMAN, we have assumed that hashed passwords are stored on the authentication

servers and each server is mutually authenticated with other server.

FIGURE10: Flow Chart

MANET is a self-configured type of network it means any node can join it or leave it at

any time. So nodes are changing during time to time so it has synchronization between

nodes and server so that every node can store key inside server which is required for

ticket granting. If a malicious node exists during synchronization in between nodes and

server then it will drop data and server will never synchronize with nodes. So to remover

these kind of DOS attacks we are proposing a scenario which is based on symmetric,

asymmetric, timer and acknowledgement based.

FIGURE11: Attack in KAMAN Schema

22

Here nodes are strongly synchronized using symmetric and asymmetric key cryptography

techniques and the cross checking is done on the basis of timer and ACK.

Authentication steps of proposed schema:

PUBkeyNode: Server broadcast its public key

E(PRIkey) Server: All nodes encrypt there private key with public key of

server and send to server.

If (Server receive all keys = communication done) else

Timer: server waits till timer gets expired if it will not receive any key.

If the network have black hole node then it will drop all packets.

Isolate last node of path because it is the one who is responsible for packet drop

because black hole node is always exist on last of path because it never forward

data.

Server broadcast message to send key again.

Nodes send keys again. This time server receiver keys because black hole node

is isolated.

SERVER NODESMSG: Server receives all keys.

Client request to server.

Request for path till R1.

If there is new black hole node join network and it reply for path.

Set Timer at R1.

R1 alert C1 that he is not getting any data.

Isolate new black hole node.

23

Send data through path from where C1 receive ACK from R1. Now to prevent attacks

caused for selective packet drop like grayhole attack we will use the method of cross

verification from nexthop.

FIGURE12: Cross Verification Phase

In this process the source node will transmit data and verify from the next hop of the node

that whatever data he had send is received at the next node or not. If there is too much

data loss on the node then it will declare it as a grayhole attack.

Transmission Process

Now after detection of various attacks we will use encryption algorithm to encrypt

and transmit data.

The encryption will be based on the symmetric key encryption.

Server will generate a random key and encrypt it with the public keys of source

and destination node.

Now source and destination nodes will receive this key and decrypt it with their

own private keys.

Now they both have a same key and source will encrypt data with the key and

destination will decrypt it with his own same key.

24

Here the key exchange will be based on diffie-hellman algorithm which is having

following steps.

Alice and Bob agree to use a prime number p = 23 and base g = 5.

Alice chooses a secret integer a = 6, then sends to Bob

A = ga mod p

A = 56 mod 23

A = 15,625 mod 23

A = 8

Bob chooses a secret integer b = 15, then sends to Alice.

B = gb mod p

B = 515 mod 23

B = 30,517,578,125 mod 23

B = 19

Alice computes s = Ba mod p

s = 196 mod 23

s = 47,045,881 mod 23

s = 2

Bob computes s = Ab mod p

s = 815 mod 23

s = 35,184,372,088,832 mod 23

s = 2

25

CHAPTER 4

RESULTS AND DISCUSSIONS

MANET security is one of the major concerns because of the lack of centralized access

and regular changing topologies. One of the major tasks is to design a security effective

protocol that will help to avoid the attacks and provide a secure communication between

the nodes. In a group communication security issues become worst because there are

number of senders and number of receivers. So I am going to propose a new technique

that will be more efficient against the Black, Gray hole and Man-in- middle attacks and

helps to detect and prevent the attacks.

4.1 SIMULATION

Problem in base paper

FIGURE 4.1:Implementationsnapshot

Sender will request to KDC for verification

26


Request will reached at KDC for verification.


KDC will verify that request is valid or not.

27


Sender will choose the TGS and the receiver to whome he wants to communicate.

E


Ticket will generated by TGS to both sender and receiver.

28


Sender will write message and encrypt it.


It will send to receiver 1.

29


Receiver will receive message and he will decrypt it.

Solution to the problem proposed in new methodology


GUI will buttons of different functionality. And axes field to show working.

30


Deploy network.


Whole network will deployed and also a server will deployed.

31


Add new node into network.


New node will broadcast message and check DRI values.

32


DRI values are shown and the node with DRI value 1-0 will be isolated from network.


Now hello message will be broadcast from new node because he needs a path till server.

33


Path found.

Case 1


Timer will start on source node.

34


Server will send his public key to source node.


Diffi helman is used to encrypt key exchange scenario.

35


Server will now send random key.


Server will generates random key and encrypt with the private keys of both parties.


Server sending encrypted key to Source node.

36


Server sending encrypted key to Destination node.


Communication will start between both the nodes i.e. Source and Destination.

37

Case 2


Key exchange scenario is used to exchange key between Server and Source.


Key exchange scenario is used to exchange key between Server and Source.

38


Malicious node is in between path. It will drop data and caused for black hole attack.


Checking DRI values and isolate the node from network.

39

Case 3


Key exchange scenario is used to exchange key.





.

40


Source node requesting for keys.


Server node will sent keys to both parties.

41


Server node will sent keys to both parties.


Selective packet drop is here. So grayhole attack is occour during transmission.

42


Total numberof packets send by source node=50 and receive by intermedit node is 50 and

received by destination node is 30.


It will block malicious node and isolate it and choose new path for transmission.

43

Table 1: DRI Table

FIGURE4.38:Implementationsnapshot

DRI table for all nodes which will show the DRI values for each node. Form DRI we can

check which node is forwarding the packet and which node is dropping the packet.

Table 2: PACKET DELIVERY TABLE


The table shows the number of packet received and forwarded by each node.

44

GRAPH 4.1:PDR Graph

PDR of 3 cases are shown in the above graph. Here the PDR of case 1 is high as compare

to both cases because there is no attack in case 1 but if we talk about the case 2 and case 3

the PDR of case 2 is high because after detecting black hole attack the communication

will flows normal but in case 3 because of gray hole attack the detection procedure is

little long and some packets are got dropped so here PDR is less.

GRAPH 4.2:Overload Graph

Overload of case 1 is very low because minimum number of packets are travelled but in

case of case 2 the overload is little high because of detection procedure. But in case 3

overload is little higher because the detection procedure is little much longer and lots of

packets are travelled into network.

45

GRAPH 4.3:Delay Graph

Delay of is very less as compare to case 1 and case 2 because of direct communication.

but delay in case 2 is very high because black hole node drops lots of packets but in case

of gray hole attack less number of packets are dropped so here the delay is medium.

GRAPH 4.4:Throughput Graph

Throughput of case 1 is much high because of direct communication. But the throughput

of case two is less than case 3 because in case 2 lots of packets are directly dropped by

black hole node as compare to gray hole node.

46

BASE PAPER COMPARISON

GRAPH 4.5:Delay Graph

Delay of is very less as compare to case 1 and case 2 because of direct communication.

but delay in case 2 is very high because black hole node drops lots of packets but in case

of gray hole attack less number of packets are dropped so here the delay is medium. But if

we talk about the delay of base paper than the delay ratio is much high as compare to all

other cases.

GRAPH 4.6:Throughput Graph

Throughput of case 1 is much high because of direct communication. But the throughput

of case two is less than case 3 because in case 2 lots of packets are directly dropped by

black hole node as compare to gray hole node. But the throughput of base paper is less as

compare to all cases.

47

CHAPTER 5

CONCLUSION AND FUTURE SCOPE

In our work, we conclude that when Kaman will be implemented in larger networks,

some routing protocol is needed for routing the packets; here we have used AODV

reactive routing protocol.Which opened room for the black hole problem. The black hole

problem is solved with the user of timer in KAMAN. We conclude that when Kaman will

be implemented in larger network, some routing protocol is needed for routing the

packets; here we have used AODV reactive routing protocol .Which opened room for the

black hole problem. The black hole problem is solved with the user of timer in KAMAN.

Timer is embedded into KAMAN, which will expire after threshold period of timer. In

fixed threshold period of timer, if source unable to get ticket from secure server

automatically source select another best route for communication with secure server.

The future work of the research is to enhance proposed technique to detect the

cooperative black hole attacks in the network.Also in future the technique will be tested

in more mobility environment where the nodes can move more freely in the ad hoc

network. In future Implementations, we will increase the number of mobile nodes as well

as the availability of alternate path used for cross verification of a node and evaluate the

proposed scheme under this scenario.

48

CHAPTER 6

PUBLISHED PAPERS

6.1 PUBLISHED PAPER

6.1.1 PAPER TITLE: A NOVEL APPROACH TO DETECT BLACK HOLE

ATTACK BY MODIFYING AODV WITH DRI TABLES

CONFERENCE NAME: INTERNATIONAL CONFERENCE ON FUTURE &

CHALLENGES OF COMPUTATIONAL AND INTEGRATED SCIENCES

(ICFC – 2014)

PUBLISHED DATE:November 7th and 8th 2014

COLLEGE NAME: HANS RAJ MAHILA MAHA VIDYAIAYA

6.1.2 PAPER TITLE: A REVIEW ON NOVEL SAT KAMAN PROTOCOL TO

PREVENT DOS ATTACK IN MANET

JOURNAL NAME: International Journal for Research in Applied Science and

Engineering Technology (IJRASET) Indexed with CAB Abstract (CABI)of

Thomson Reuters

PUBLISHED DATE: Volume 2, Issue XII, December 2014

6.1 .3 PAPER TITLE:DETECTION OF IMPERSONATION ATTACK IN VANET’S

CONFERENCE NAME: International Conference on Computer Communication

and Informatics (ICCCI2015)

COLLEGE NAME: Sri Shakti Institute of Engineering and Technology

Coimbatore

CONFERENCE SPONSORED BY:IEEE

PUBLISHED DATE: 8-10 JAN 2015

6.1.4 PAPER TITLE: NOVEL ENHANCEMENT OF SECURITY AND

PERFORMANCE OF SOFTWARE DEFINE NETWORK (SDN)

JOURNAL NAME: International Journal of Applied Engineering Research

(IJAER) Indexed with Scopus

PUBLISHED DATE: MAY ISSUE

49

REFERENCES

[1] B. G. A. A. Meghna Chhabra, "A Novel Solution to Handle DDOS Attack in

MANET," Journal of Information Security, pp. 165-179, 2013.

[2] K. Prajapati, "Slideshare," [Online]. Available:

http://www.slideshare.net/Kunal1194/study-of-security-attacks-in-MANET.

[Accessed 28 March 2015].

[3] S. G. T. J. L. K. &. B. Marti, "Mitigating routing misbehavior in mobile ad hoc

networks," ACM, pp. 255-265, 2000.

[4] S. Banerjee, "Detection/removal of cooperative black and gray hole attack in mobile

ad-hoc networks," in proceedings of the world congress on engineering and

computer science, 2001.

[5] S. e. a. Ramaswamy, "Prevention of Cooperative Black Hole Attack in Wireless Ad

Hoc Networks," in International Conference on Wireless Networks, 2003.

[6] P. V. P. a. R. R. Goyal, "MANET: Vulnerabilities, challenges, attacks, application.","

IJCEM International Journal of Computational Engineering & Management , pp. 32-

37, 2004.

[7] H. N. N. a. F. K. Khattak, "Preventing black and gray hole attacks in AODV using

optimal path routing and hash," in 10th IEEE International Conference, 2005.

[8] H. K. a. R. Singh, "A NOVEL APPROACH TO PREVENT BLACK HOLE

ATTACK IN WIRELESS SENSOR NETWORK," IJARET, 2006.

[9] S. e. a. Kurosawa, " Detecting Blackhole Attack on AODV-based Mobile Ad Hoc

Networks by Dynamic Learning Method," J Network Security, pp. 338-346, 2007.

[10] J. S. K. a. A. U. Sen, "A mechanism for detection of cooperative black hole attack in

mobile ad hoc networks," in Second International Conference on IEEE, 2011, 2009.

[11] Y. F. a. Z. C. X. Alem, "Preventing black hole attack in mobile ad-hoc networks

using Anomaly Detection," in 2nd International Conference on. Vol. 3. IEEE, 2010.

[12] H. e. a. Yang, "SCAN: self-organized network-layer security in mobile ad hoc

networks." Selected Areas in Communications," IEEE Journal, pp. 261-273, 2010.

[13] R. G. S. K. D. Piyush Agarwal, "Cooperative Black and Gray Hole Attacks in Mobile

Adhoc Networks," in 2nd International conference on Ubiquitous Information

50

Management and Communication, Suwon,Korea, 2011.

[14] C. C. M. G. E. L. G. CaroFIGURElio, "Route stability in MANETs under the random

direction mobility model," in Mobile Computing, IEEE Transactions on 8, no. 9,

2012.

[15] M. G. Sung-Ju Lee, "AODV-BR: Backup routing in ad hoc networks," in Wireless

Communications and Networking Confernce, 2000. WCNC. 2000 IEEE. Vol. 3.,

2013.

[16] M. e. a. Abdelhaq, "A local intrusion detection routing security over MANET

network," in IEEE Conference , 2011.

[17] E. t. E. D. A. o. P. O.-d. R. Protocols, "Taneja, Sunil, and Amandeep Makkar".

[18] A. H. B. Mohamed, "Analysis and Simulation of Wireless Ad-Hoc Network Routing

Protocols," Universiti Putra Malaysia, 2004.

[19] B. e. a. Wu, "A survey of attacks and countermeasures in mobile ad hoc networks,"

Springer US, pp. 103-135, 2007.

[20] E. G. a. K. S. Nilsson, "Ad Hoc Networks and Mobile Devices in Emergency

Response–a Perfect Match," Springer Berlin Heidelberg, pp. 17-33, 2010.

[21] J. e. a. Hoebeke, "An overview of mobile ad hoc networks: Applications and

challenges," Journal-Communications Network, pp. 60-66, 2004.

51

APPENDIX

List of Abbreviations

AODV On demand distance vector routing protocol

ADN1 Network Address of Node1

CW Contentional Window

IDN1 Identity of Node1

IDN2 Identity of Node2

KAMAN Kerberos Assisted Authentication Protocol in Mobile Ad Hoc Network

KCnEncryption key based on hashed password of user n

KN1, N2 Session key between Node1 and Node2

MANETMobile Ad-Hoc Networks

RT Informs of time when this authenticator was generated

TGT Ticket

WMN Wireless Mesh Networks

WSN Wireless Sensor Network

A Dissertation Proposal Submitted By

Documents

Transcript of A Dissertation Proposal Submitted By