Content Final Phase2

7/31/2019 Content Final Phase2

1/55

1

CHAPTER 1

INTRODUCTION

1.1 MOBILE AD HOC NETWORK

Mobile Ad Hoc Networks are autonomous and decentralized wireless systems.

MANETs consist of mobile nodes that are free in moving in and out in the network.

Nodes are the systems or devices i.e. mobile phone, laptop, personal digital assistance,

MP3 player and personal computer that are participating in the network and are

mobile. These nodes can act as host/router or both at same time. They can form

arbitrary topologies depending on their connectivity with each other in the network.

These nodes have the ability to configure themselves and because of their self-

configuration ability, they can be deployed urgently without the need of any

infrastructure.

A major performance constraint comes from path loss and multipath fading.

Many MANET routing protocols exploit multihop paths to route packets. The

probability of successful packet transmission on a path is dependent on the reliability

of the wireless channel on each hop. Rapid node movements also affect link stability,

introducing a large Doppler spread, resulting in rapid channel variations.

Channel-aware version of the AOMDV routing protocol. The key aspect of this

enhancement, which is not addressed in other work, is that we use specific, timely,

channel quality information allowing us to work with the ebb-and-flow of path

availability. This approach allows reuse of paths which become unavailable for a time,

rather than simply regarding them as useless, upon failure, and discarding them. The

channel average nonfading duration (ANFD) as a measure of link stability, combined

with the traditional hop-count measure for path selection.


2/55

2

The protocol then uses the same information to predict signal fading and

incorporates path handover to avoid unnecessary overhead from a new path discovery

process. The average fading duration (AFD) is utilized to determine when to bring a

path back into play, allowing for the varying nature of path usability instead of

discarding at initial failure. This protocol provides a dual attack for avoiding

unnecessary route discoveries, predicting path failure leading to handoff and then

bringing paths back into play when they are again available, rather than simply

discarding them at the first sign of a fade.

Security in Mobile Ad Hoc Network is the most important concern for the

basic functionality of network. Availability of network services, confidentiality and

integrity of the data can be achieved by assuring that security issues have been met.

MANET often suffer from security attacks because of the its features like open

medium, changing its topology dynamically, lack of central monitoring and

management, cooperative algorithms and no clear defense mechanism. These factors

have changed the battle field situation for the MANET against the security threats.

Figure 1.1 Communications in Wireless Networks


3/55

3

MANET work without a centralized administration where node communicates

with each other on the base of mutual trust as shown in Figure 1.1. This characteristic

makes MANET more vulnerable to be exploited by an attacker from inside the

network. Wireless links also makes the MANET more susceptible to attacks which

make it easier for the attacker to go inside the network and get access to the ongoing

communication. Mobile nodes present within the range of wireless link can overhear

and even participate in the network.

MANETs must have a secure way for transmission and communication and

this is quite challenging and vital issue as there is increasing threats of attack on the

Mobile Network. Security is the cry of the day. In order to provide secure

communication and transmission engineer must understand different types of attacks

and their effects on the MANETs. Wormhole attack, Black hole attack,

Sybil attack, flooding attack, routing table overflow attack, Denial of Service

(DoS), selfish node misbehaving, impersonation attack are kind of attacks that aMANET can suffer from. MANET is more open to these kinds of attacks because

communication is based on mutual trust between the nodes, there is no central point

for network management, no authorization facility, vigorously changing topology and

limited resources.

1.2 OBJECTIVE OF THE PROJECT

The project focuses on circumventing of the black hole attack in MANETs.

Simulating the black hole attack using CA-AOMDV routing protocol.

Analyzing the effects of black hole attack in the light of Network load,

throughput and End to End delay in MANET.


4/55

4

Simulating the security algorithm in CA-AOMDV routing protocol to

circumvent the black holes and analyze its performance.

1.3 LITERATURE SURVEY

Literature survey is carried out by analyzing many papers relevant to

encryption and keying for wireless mobile ad hoc networks. The research carried out

by different authors is surveyed and the analysis done by the researchers are discussed

in the following paragraphs.

A new cross layer design [2] was proposed to overcome the unnecessary packet

transmission using new cross layer design during channel fading. Cross Layer design

relates to the sharing of information between various layers, as specified in the OSI

layered architecture. In this study, we make use of the channel state information from

the physical layer, specifically the predictability of the slow Rayleigh fading channel,

to improve the network performance. The IEEE 802.11 standard is the most mature

technology for Wireless Local Area Networks (WLANs) and thus widely adopted as a

Medium Access Control (MAC) mechanism in ad hoc networks. However, the

research on the performance of ad hoc networks under Rayleigh fading channel is still

at its early age. Some works have indicated that the network performance could be

badly affected by Rayleigh fading channel. This makes use of AODV Algorithm

which is a single path routing algorithm which degrades the performance of the

system.

Associativity-based routing scheme [1] is proposed, where the route is selected

based on its stability. To discover shorter routes and to shorten the route recovery time

when the association property is violated, the localized-query and quick-abort

mechanisms are respectively incorporated into the protocol. The problem here relates

to how MHs can communicate with one other, over the wireless media, without any

infra-structured network component support. The most obvious problem is to devise a


5/55

5

scheme to compute routes which can adapt well to link changes. Conventional

distributed routing schemes attempt to maintain consistent routing information by

performing periodic link and topology updates. These, however, are undesirable for

MHs in an ad-hoc mobile network since MHs migrations cause frequent link changes,

which result in enormous transmissions over the wireless media to propagate and

update routes. This is very inefficient in an environment where radio bandwidth and

battery power are scarce resources. Hence, there is a need for a new, efficient and

robust routing scheme for MHs in an ad-hoc mobile network. To Thus the routes

selected are likely to be long lived and hence no need to restart frequently. But the

main drawback in this algorithm is that it does not consistently maintain the routinginformation in the nodes.

Mobility Prediction Model [5] is proposed for selecting a stable link. A

mobility prediction model based link stability metric algorithm is proposed in this

paper, in which the stable neighbor metric and local movement metric is defined. It

calculates stable neighbor metric and local movement metric. Mobility prediction

model is applied to predict stability probabilities between each mobile node (MND)

and its neighbors by use of these two metrics for finding the most stable neighbor of

each MND and most stable route in a route discovery. The metrics to be calculated is

more complex and consumes a lot of time.

ExOR [4] is an integrated routing that increases the throughput of large unicast

transfers in multi-hop wireless networks. ExOR, an integrated routing and MAC

protocol for multi-hop wireless networks in which the best" of multiple receivers

forwards each packet has been proposed. ExOR improves performance by taking

advantage of long-distance but lossy links which would otherwise have been avoided

by traditional routing protocols. A source node has a packet that it wishes to deliver to

a distant destination. Between the source and destination are other wireless nodes

willing to participate in ExOR. The source broadcasts the packet. Some sub-set of the

nodes receives the packet. The nodes run a protocol to discover and agree on which


6/55

6

nodes are in that sub-set. The node in the sub-set that is closest to the destination

broadcasts the packet. Again, the nodes that receive this second transmission agree on

the closest receiver, which broadcasts the packet. This process continues until the

destination has received the packet. The algorithm will cause a lot of overhead in

retransmission if the forwarder is chosen incorrectly.

The main attacks on wireless networks are the compromised node and denial of

service. These are overcome by the use of randomized dispersive algorithm [7].

Develop mechanisms that generate randomized multi-path routes. Under our designs,

the routes taken by the shares of different packets change over time. So even if the

routing algorithm becomes known to the adversary, the adversary still cannot pinpoint

the routes traversed by each packet. Besides randomness, the generated routes are also

highly dispersive and energy efficient, making them quite capable of circumventing

black holes. This mechanism does not handle multiple collaborating black holes. The

routes are highly dispersive to bypass the black hole attack. In reality, a stronger attack

could be formed, where by the adversary selectively compromises a large number ofsensors that are several hop away from the sink to form clusters of black holes around

the sink. Collaborating with each other, these black holes can form a cut around the

sink and can block every path between the source and the sink.

The Paper mainly addresses the problem of coordinated attack by multiple

black holes [3] acting in group. The proposed solution can be applied to identify

multiple black hole nodes cooperating with each other in a MANET; and Discover

secure paths from source to destination by avoiding multiple black hole nodes acting in

cooperation. Discover secure paths from source to destination by avoiding multiple

black hole nodes acting in cooperation. a methodology for identifying multiple black

hole nodes cooperating as a group with slightly modified

AODV protocol by introducing Data Routing Information (DRI) Table and

Cross Checking. The proposed system rely on reliable nodes (nodes through which the


7/55

7

source node has routed data) to transfer data packets. The main drawback is that it is

applied only to single path on demand routing.

The proposed technique will extend Dynamic source routing algorithm to

mitigate the effects of routing misbehavior [6]; the watchdog and the path rater. It is

capable of circumventing the black holes. This mechanism increases the throughput of

the network .The ad hoc networks in the presence of nodes that agrees to forward

packets and fails to do so. This paper uses watchdog that identifies misbehaving

nodes and path rater that helps routing protocols avoid these nodes. More tests must be

conducted to the two methods to achieve optimal values to increase the throughput.

The paper analyzes the black hole attack which is one of the possible attacks in

ad hoc networks. In a black hole attack, a malicious node impersonates a destination

node by sending a spoofed route reply packet to a source node that initiates a route

discovery. By doing this, the malicious node can deprive the traffic from the source

node. In order to prevent this kind of attack, it is crucial to detect the abnormality

occurs during the attack. In conventional schemes, anomaly detection is achieved by

defining the normal state from static training data. However, in mobile ad hoc

networks where the network topology dynamically changes, such static training

method could not be used efficiently. In this paper an anomaly detection scheme is

proposed using dynamic training method in which the training data is updated at

regular time intervals. The paper does not support multiple paths discovery during the

transmission of the data to the destination.


8/55

8

CHAPTER 2

SYSTEM STUDY

The study of the existing and proposed system is being analyzed and the

drawbacks of the existing system is studied and it is overcome in the proposed system

2.1 EXISTING SYSTEM

Wireless mobile ad hoc networks (MANETs) are self-configuring, dynamicnetworks in which nodes are free to move. A major performance constraint comes

from path loss and multipath fading. Many MANET routing protocols exploit multihop

paths to route packets. The probability of successful packet transmission on a path is

dependent on the reliability of the wireless channel on each hop. Rapid node

movements also affect the link stability.

Thus the existing system makes use of an enhanced version of AOMDVprotocol which makes use of the fading characteristics. Channel aware AOMDV is

split into two phase, Route discovery and Route maintenance. In route discovery

phase, ANFD is combined with the hop count criterion from AOMDV to serve as a

metric with which to select short but stable paths instead of simply choosing the

shortest path.

This phase takes into account stability and length of the link to improve overall

path quality. In Route maintenance phase, predicted signal strength is used to trigger a

handoff before a fade occurs, reducing the Source-destination connection failure rate.

The breaking link AFD is recorded, so that it maybe reutilized once out of the fade.


9/55

9

Figure 2.1 Handoff in CA-AOMDV

The main advantage of the system is that it overcomes the channel fading

which is not addressed by any other protocol features. The main drawback of the

existing system is that it does not provide any security against the attacker who spoofs

the data. This will allow the attacker to compromise the nodes in the network and the

message from the source does not reach the destination due to the attack. These attacksare said to be the black hole attack which is not being overcome by the existing

system.

2.2 PROPOSED SYSTEM


10/55

10

The project proposes a randomized multi-path routing algorithm that can

overcome the Black hole attack. In this algorithm, multiple paths are computed in a

randomized way each time an information packet needs to be sent, such that the set of

routes taken by various shares of different packets keep changing over time. As a

result, a large number of routes can be potentially generated for each source and

destination. To intercept different packets, the adversary has to compromise or jam all

possible routes from the source to the destination, which is practically not possible.

The Algorithm considers a 3-phase approach for secure information delivery in

a MANET: secret sharing of information, randomized propagation of each information

share, and normal routing toward the sink is illustrated in figure 2.2.

Figure 2.2 Randomized dispersive routing in a MANET

More specifically, when a sensor node wants to send a packet to the sink, it

first breaks the packet into M shares according to a (T;M)-threshold secret sharing


11/55

11

algorithm. Each share is then transmitted to some randomly selected neighbor. That

neighbor will continue to relay the share it has received to other randomly selected

neighbors, and so on. In each share, there is a TTL field, whose initial value is set by

the source node to control the total number of random relays. After each relay, the

TTL field is reduced by 1.

When the TTL value reaches 0, the last node to receive this share begins to

route it towards the sink using min-hop routing. Once the sink collects at least T

shares, it can reconstruct the original packet. No information can be recovered from

less than Tshares. Clearly, the random propagation phase is the key component that

dictates the security and energy performance of the entire mechanism.

2.2.1 Advantages of the proposed system

Randomized propagation utilizes only one hop neighborhood information.

No information can be recovered from less than threshold share.

Random Propagation is a key component that dictates the security and energy

performance of the entire mechanism.

the algorithm ensures that the randomly generated routes are

as dispersive as possible.

CHAPTER 3


12/55

12

SYSTEM CONFIGURATION

3.1 HARDWARE REQUIREMNTS

Processor : Intel Dual Core 1.6 GHz.

Ram : 512 MB DDR-2.

HDD : 80 GB.

Mother Board : Intel 945g.

3.2 SOFTWARE REQUIREMENTS

Operating System : Red hat Linux 9.

Simulation Tool : NS 2(OTCl &TCl)

3.3 SYSTEM DESCRIPTION


13/55

13

3.3.1 Software Description

Ns-2 Simulator

Ns-2 stands for Network Simulator version 2.

It is a discrete event simulator for networking research

It Works at packet level.

It provides substantial support to simulate bunch of protocols like DSR

It simulates wired and wireless network.

It is primarily UNIX based

It Uses TCL as its scripting language.

ns-2 is a standard experiment environment in research community

Figure 3.1 Ns-2 Structure

otcl: Object-oriented support

tclcl: C++ and otcl linkage


14/55

14

Discrete event scheduler

Data network (the Internet) components

Languages in Ns-2

Ns use two languages because simulator has two different kinds of things it

needs to do. On one hand, a detailed simulation of protocols requires a systems

programming language which can efficiently manipulate bytes, packet headers, and

implement algorithms that run over large data sets. For these tasks run-time speed is

important and turn-around time (run simulation, find bug, fix bug, recompile, re-run) is

less important. On the other hand, a large part of network research involves slightly

varying parameters or configurations, or quickly exploring a number of scenarios. In

these cases, iteration time is more important.

Since configuration runs once, run-time of this part of the task is less

important. ns meets both of these needs with two languages, C++ and OTCL. C++ is

fast to run but slower to change, making it suitable for detailed protocol

implementation. OTCL runs much slower but can be changed very quickly (and

interactively), making it ideal for simulation configuration. nsprovides glue to make

objects and variables appear on both languages.

Wireless model in Ns

The wireless model essentially consists of the Mobile Node at the core, with

additional supporting features that allows simulations of multi-hop ad-hoc networks,

wireless LANs etc. The Mobile Node object is a split object. The C++ class Mobile

Node is derived from parent class Node. A Mobile Node thus is the basic Node object

with added functionalities of a wireless and mobile node like ability to move within a

given topology, ability to receive and transmit signals to and from a wireless channel


15/55

15

etc. A major difference between them, though, is that a Mobile Node is not connected

by means of Links to other nodes or mobile nodes.

Mobile node: creating wireless topology

Mobile Node is the basic ns Node object with added functionalities like

movement, ability to transmit and receive on a channel that allows it to be used to

create mobile, wireless simulation environments. The class Mobile Node is derived

from the base class Node. Mobile Node is a split object. The mobility features

including node movement, periodic position updates, maintaining topology boundary

etc are implemented in C++ while plumbing of network components within Mobile

Node itself have been implemented in Otcl.


16/55

16

Figure 3.2Node Architecture

Creating Node movements

The mobile node is designed to move in a three dimensional topology.

However the third dimension (Z) is not used. That is the mobile node is assumed to

move always on a flat terrain with Z always equal to 0. Thus the mobile node has X,

Y, Z(=0) co-ordinates that is continually adjusted as the node moves. There are two

mechanisms to induce movement in mobile nodes. In the first method, starting position

of the node and its future destinations may be set explicitly. The second method

employs random movement of the node.

Class simulator

Class Simulator provides a set of interfaces for configuring a simulation and

for choosing the type of event scheduler used to drive the simulation. A simulation

script generally begins by creating an instance of this class and calling various

methods to create nodes, topologies, and configure other aspects of the simulation.


17/55

17

3.3.2 Hardware Description

Hard disk drive (HDD or hard drive or hard disk) is a non-volatile, random

access digital magnetic data storage device. It features rotating rigid platters on amotor-driven spindle within a protective enclosure. Data is magnetically read from and

written to the platter by read/write heads that float on a film of air above the platters.

Random-access memory (RAM) is a form ofcomputer data storage. It takes

the form ofintegrated circuits that allow stored data to be accessed in any order with a

worst case performance ofconstant time.

The Intel Core2 Quad processor for desktop PCs is designed to handle

massive compute and visualization workloads enabled by powerful multi-core

technology. Intel Core 2 Quad processors are built on 45nm Intel Core micro

architecture enabling, faster, cooler, and quieter desktop PC and workstation

experiences.

A monitor or display (sometimes called a visual display unit) is an electronic

visual display forcomputers. The monitor comprises the display device, circuitry, and

an enclosure.
http://en.wikipedia.org/wiki/Non-volatile_storagehttp://en.wikipedia.org/wiki/Random_accesshttp://en.wikipedia.org/wiki/Random_accesshttp://en.wikipedia.org/wiki/Magnetic_storagehttp://en.wikipedia.org/wiki/Data_storage_devicehttp://en.wikipedia.org/wiki/Hard_disk_plattershttp://en.wikipedia.org/wiki/Hard_disk_drive#Spindlehttp://en.wikipedia.org/wiki/Magneticallyhttp://en.wikipedia.org/wiki/Disk_read-and-write_headhttp://en.wikipedia.org/wiki/Computer_data_storagehttp://en.wikipedia.org/wiki/Integrated_circuithttp://en.wikipedia.org/wiki/Datahttp://en.wikipedia.org/wiki/Constant_timehttp://en.wikipedia.org/wiki/Electronic_visual_displayhttp://en.wikipedia.org/wiki/Electronic_visual_displayhttp://en.wikipedia.org/wiki/Computerhttp://en.wikipedia.org/wiki/Electronic_circuithttp://en.wikipedia.org/wiki/Non-volatile_storagehttp://en.wikipedia.org/wiki/Random_accesshttp://en.wikipedia.org/wiki/Random_accesshttp://en.wikipedia.org/wiki/Magnetic_storagehttp://en.wikipedia.org/wiki/Data_storage_devicehttp://en.wikipedia.org/wiki/Hard_disk_plattershttp://en.wikipedia.org/wiki/Hard_disk_drive#Spindlehttp://en.wikipedia.org/wiki/Magneticallyhttp://en.wikipedia.org/wiki/Disk_read-and-write_headhttp://en.wikipedia.org/wiki/Computer_data_storagehttp://en.wikipedia.org/wiki/Integrated_circuithttp://en.wikipedia.org/wiki/Datahttp://en.wikipedia.org/wiki/Constant_timehttp://en.wikipedia.org/wiki/Electronic_visual_displayhttp://en.wikipedia.org/wiki/Electronic_visual_displayhttp://en.wikipedia.org/wiki/Computerhttp://en.wikipedia.org/wiki/Electronic_circuit


18/55

18

CHAPTER 4

SYSTEM ANALYSIS

4.1 OVERVIEW

The goal ofsystem analysis is to determine where the problem is in an attempt

to fix the system. This step involves breaking down the system in different pieces to

analyze the situation, analyzing project goals, breaking down what needs to be created

and attempting to engage users so that definite requirements can be defined.

4.2 DATA FLOW DIAGRAM

A two-dimensional diagram that explains how data is processed and transferred

in a system. The graphical depiction identifies each source of data and how it interacts

with other data sources to reach a common output.

Protocol Implementation

PacketTransferring

NeighborNode Routing

PacketScheduling and

Queuing

Traffic

Generation
http://en.wikipedia.org/wiki/Systems_analysishttp://en.wikipedia.org/wiki/Work_breakdown_structurehttp://www.businessdictionary.com/definition/diagram.htmlhttp://www.businessdictionary.com/definition/data.htmlhttp://www.businessdictionary.com/definition/system.htmlhttp://www.businessdictionary.com/definition/source.htmlhttp://www.businessdictionary.com/definition/reach.htmlhttp://www.businessdictionary.com/definition/common.htmlhttp://en.wikipedia.org/wiki/Systems_analysishttp://en.wikipedia.org/wiki/Work_breakdown_structurehttp://www.businessdictionary.com/definition/diagram.htmlhttp://www.businessdictionary.com/definition/data.htmlhttp://www.businessdictionary.com/definition/system.htmlhttp://www.businessdictionary.com/definition/source.htmlhttp://www.businessdictionary.com/definition/reach.htmlhttp://www.businessdictionary.com/definition/common.html


19/55

19

Figure 4.1: Routing Flow in MANETs

4.3 BLOCK DIAGRAM

The block diagram is typically used for a higher level, less detailed description

aimed more at understanding the overall concepts and less at understanding the details

of implementation.

4.3.1 Existing system

CA-AOMDV

ROUTING

ALGORITHM

MANETs

Traffic Analysis based onsystem lifetime

Performance Analysis

Data Transmission

Selecting a stable path

Hand-off strategy

Routediscovery

Routemaintenanc


20/55

20

Figure 4.2. The mechanism of C A-AOMDV protocol

4.3.2 Proposed system

The block diagram in figure 4.3 exlais the phases of the random multipath

algorithm which is proposed in the project.

Data Transmission

MANETs

CA-AOMDV

Secure Information Sharing

Randomized Propagation

Normal Routing

Threshold SecretSharing Algorithm

Non Repetitive Scheme

Min Hop Routing

Analysis of Black HoleAttack on MANETs


21/55

21

Figure 4.3: Random Multipath Routing

CHAPTER 5

SYSTEM DESIGN

5.1 OVERVIEW

In systems design the design functions and operations are described in detail,

including screen layouts, business rules, process diagrams and other documentation.

The output of this stage will describe the new system as a collection of modules or

subsystems. The design stage takes as its initial input the requirements identified in the

approved requirements document. For each requirement, a set of one or more design

elements will be produced as a result of interviews, workshops, and/or prototype

efforts.

Design elements describe the desired software features in detail, and generallyinclude functional hierarchy diagrams, screen layout diagrams, tables of business rules,

business process diagrams, pseudo code, and a complete entity-relationship diagram

with a full data dictionary.

5.2 MODULES

The project consists of three modules which implements the existing system of

the project. Each module specifically describes about the implementation of theprotocol and its enhancement made to improve the overall performance of the network.

5.2.1 Network creation and routing Implementation

In this module the nodes for the mobile network are created and packets are

transmitted in order to check whether the packets are delivered properly. This routing

mechanism involves The AODV protocol which is an On-demand single routing


22/55

22

protocol. When a source node, ns, generates a packet for a particular destination node,

nd, it broadcasts a route request (RREQ) packet. The RREQ contains the following

fields:

where the source and destination IP addresses remain constant for the lifetime

of the network, source sequence number is a monotonically increasing indicator of

packet freshness, destination sequence number is the last known sequence number

for nd at ns and hop-count is initialized to zero and incremented at each intermediate

node which processes the RREQ. A RREQ is uniquely identified by the combinationof source sequence number and broadcast ID. An intermediate node only processes a

RREQ if it has not received a previous copy of it. If an intermediate node has a route

to nd with destination sequence number at least that in the RREQ, it returns a route

reply (RREP) packet, updated with the information that it has. The RREP packet

contains the following fields:


23/55

23

The route expiration time is the time after which the route is considered to have

expired and a new route discovery process must be undertaken.

The Figure 5.1 shows the flow diagram of the node creation and routing in the

mobile network using the AODV protocol.

Figure 5.1Node creation and routing

5.2.2 Implementation of AOMDV multicast routing protocol

This module implements the AOMDV protocol which replaces the AODV

protocol by usage of multipath for routing the information. The key distinguishing


24/55

24

feature of AOMDV over AODV is that it provides multiple paths to n d. These paths are

loop free and mutually link-disjoint. AOMDV uses the notion of advertized hop-count

to maintain multiple paths with the same destination sequence number. In both AODV

and AOMDV, receipt of a RREQ initiates a node route table entry in preparation for

receipt of a returning RREP. In AODV, the routing table entry contains the fields:

Where entry expiration time gives the time after which, if a corresponding

RREP has not been received, the entry is discarded. In AOMDV, the routing table

entry is slightly modified to allow for maintenance of multiple entries and multiple

loop free paths. First, advertized hop-count replaces hop-count and advertized hop

count is the maximum over all paths from the current node to nd, so only one value is

advertized from that node for a given destination sequence number. Second, next-hop

IP address is replaced by a list of all next-hop nodes and corresponding hop-counts of

the saved paths to nd from that node, as follows:


25/55

25

Figure 5.2 illustrates a flow diagram for implementing the AOMDV protocol.

This protocol will find multiple paths to send the packets to the destination.

Figure 5.2 Multicast Routing Protocol

5.2.3 Implementation of Channel Aware - AOMDV protocol

In this module the channel aware feature is added to already existing AOMDV

protocol to overcome the channel fading which is common in MANETs.


26/55

26

Channel aware-AOMDV is split in to two phase: Route Discovery and Route

Maintenance. In route discovery phase, ANFD is combined with the hop count

criterion from AOMDV to serve as a metric with which to select short but stable paths

instead of simply choosing the shortest path. So, CA-AOMDV takes into account

stability and length to improve overall path quality.

In Route Maintenance phase, CA-AOMDV uses predicted signal strength to

trigger a handoff before a fade occurs, reducing the ns-nd connection failure rate. The

breaking link AFD is recorded, so that it maybe reutilized once out of the fade.

Route handoff is triggered when a link downstream node predicts a fade and transmits

a HREQ to the uplink node.

Table 5.1

Comparison of Routing Table Entry Structures in AOMDV and CA-AOMDV


27/55

27

Figure 5.3 illustrates the enhanced feature in the AOMDV protocol which

overcomes the link fluctuations. This will also give the handoff strategy to overcome

the packet loss.

Figure 5.3 CA-AOMDV Protocol


28/55

28

CHAPTER 6

SIMULATION RESULTS AND DISCUSSIONS

6.1 SIMULATION SETUP

This chapter describes the simulation of CA-AOMDV. The simulation is done

by using the public domain simulator NS-2. The following assumptions are made in

the simulation:

The effect of propagation delay on the model is neglected. This is fairly realistic

considering the fact the area in which stations are present is limited to 1500mx1500m

and inter-node distance is of the order of few hundred feet.

The effect of channel errors is ignored in the simulations.

No stations are operating in power save mode.

A finite buffer is maintained at each station. If the buffer fills, the newly

generated Packets are simply dropped. The safe distance up to which a station can

receive is Maximum 250m. The interference range is 500m. All the packets in the DCF

mode are sent using RTS/CTS exchange. We use constant bit rate (CBR) traffic with

data packet size of 512 bytes. The routing protocol used is DSDV. The reason for

choosing AOMDV protocol for routing is that it provides multiple routing paths in

case of static and less mobile networks.

6.2 SIMPLE SCENARIO AND RESULTS


29/55

29

In order to gain an understating of the CA-AOMDV, a simple scenario is set up

as shown in Figure 6.1. The number of stations in the topology is 20. The receiving

station for all the transmitting stations is the station labelled Source and Destination.

The stations numbered 0, 4, 12, 8, 6, and 3 are inner nodes. These stations are within

one hop distance of the source and destination. The stations

1,5,7,9,10,11,12,13,14,15,16,17 and 18 are the boundary nodes. Rest of the stations in

the network are the outer stations.

Figure 6.1 Simple Scenario

The Figure 6.2 shows the performance of the CA-AOMDV as compared to the

normal Routing stratergy.The number of connections is 20, and the packet rate is

varied to increase the load on the network. It can be observed that as the load on the

network increases, the throughput of network increases with number of packets being


30/55

30

transmitted .The graph of packet delivery ratio for with respect to offered load is

shown in Figure 6.3.

Figure 6.2 Throughput Graph for CA-AOMDV


31/55

31

Figure 6.3 PDR Graph for CA-AOMDV

The graph for the packet delivery ratio vs. number of connections for

different packet rates is shown in the Figures 6.4. The x-axis indicates the number of

CBR connections and the y-axis indicates the ratio of packets delivered to the

destinations to the number of packets sent. The dual MAC offers substantially decrease

packet delivery ratio for the first cases due to environmental factors. When the packets

rate is increased there is an increase in packet delivery ratio.

Figure 6.4 Packet Delivery Ratios for CA-AOMDV vs. Normal AOMDV

The throughput when the packets delivered are increased seems to show

increase in its curve. The figure 6.5 shows the throughput graph for CA-AOMDV.


32/55

32

Figure 6.5 Throughput of CA-AOMDV With increase in packet delivery rate

The other Graphs that are generated for the CA-AOMDV protocol are being

given in the figure 6.6 and 6.7.The Bandwidth used by CA-AOMDV is very less

compared to normal AOMDV is shown in Figure 6.6.

Figure 6.6 Bandwidth usage of CA-AOMDV vs. AOMDV


33/55

33

The delay of the packets being transmitted is shown in the figure 6.7.The delay

of CA-AOMDV protocol is minimum compared to the normal AOMDV.

Figure 6.7 Delay caused during the packet transmission by CA-AOMDV vs.

AOMDV

6.3 DISCUSSION ON RESULTS

As seen from the graphs in the Figure 6.2 and 6.5, the performance of CA-AOMDV is

considerably better than that of AOMDV. The increase in the performance is attributed

to following reasons:

The route discovery is based on the channel strength rather than just the shortest path

to the destination. This means that there is parallelism in the packet transmissions. This

also eliminates the black node problem in the centralized scenario.


34/55

34

The CA-AOMDV also allows the packets to be distributed into shares which will

overcome the black hole attack that is most common in the MANETs.

From the graphs it is seen that the throughput performance increase with CA-

AOMDV is more than twice that of AOMDV, which is remarkable considering that

only few stations have AOMDV.

CHAPTER 7


35/55

35

CONCLUSION & FUTURE ENHANCEMENT

The major problems in mobile computing are channel fading and security

issues in transmission of data packets. A channel adaptive scheme was proposed

which overcomes the channel fading in addition to it a multi path propagation

algorithm is proposed to overcome the back hole attack that is common in

MANETs.The two metrics, Average Non fading metric and Average fading metric is

calculated to keep track of fading and perform handoffs. The multi path propagation

algorithm makes use of information shares that are split from the original informationand dispersed in multiple paths. The packets are being delivered without packet loss.

The results are obtained to prove that the proposed system is much better than the

existing system.

The current work is based on the assumption that there is only a small number

of black holes in the MANETs. In reality, a stronger attack could be formed, whereby

the adversary selectively compromises a large number of nodes that are several hops

away from the sink to form clusters of black holes around the sink. Collaborating with

each other, these black holes can form a cut around the sink and can block every path

between the source and the sink. Under this cut-around-sink attack, no secret share

from the source can escape from being intercepted by the adversary. The current work

does not address this attack. Its resolution requires us to extend the mechanisms to

handle multiple collaborating black holes, which will be studied in the future work.

APPENDICES

APPENDIX-I (Sample Coding)


36/55

36

CA-AOMDV.tcl

set val(chan) Channel/WirelessChannel

set val(prop) Propagation/TwoRayGround

set val(netif) Phy/WirelessPhy

set val(mac) Mac/802_11

set val(ifq) Queue/DropTail/PriQueue

set val(ll) LL

set val(ant) Antenna/OmniAntennaset val(x) 1500

set val(y) 1500

set val(ifqlen) 1000

set val(adhocRouting) AOMDV

set val(nn) 20

set val(stop) 5.0

set ns_ [new Simulator]

set topo [new Topography]

set tracefd [open out.tr w]

set namtrace [open out.nam w]

$ns_ trace-all $tracefd

$ns_ namtrace-all-wireless

$namtrace $val(x) $val(y)

$topo load_flatgrid $val(x) $val(y)

set god_ [create-god $val(nn)]

$ns_ color 0 red

$ns_ node-config -adhocRouting AOMDV \

-llType $val(ll) \

-macType $val(mac) \

-ifqType $val(ifq) \

-ifqLen $val(ifqlen) \


37/55

37

-antType $val(ant) \

-propType $val(prop) \

-phyType $val(netif) \

-channelType $val(chan) \

-topoInstance $topo \

-agentTrace ON \

-routerTrace ON \

-macTrace OFF

for {set i 0} {$i < $val(nn) } {incr i}

{set node_($i) [$ns_ node]

}


{

set ip_($i) 1.0.$i

}

set X1(0) 135.201

set Y1(0) 444.699

set X1(1) 244.365

set Y1(1) 521.418

set X1(2) -18.1268

set Y1(2) 300.612

set X1(3) 723.89

set Y1(3) 343.533

set X1(4) 122.34

set Y1(4) 311.755

set X1(5) 373.498

set Y1(5) 472.206

set X1(6) 548.549

set Y1(6) 361.062

set X1(7) 389.995


38/55

38

set Y1(7) 381.178

set X1(8) 494.798

set Y1(8) 477.771

set X1(9) 275.01

set Y1(9) 381.99

set X1(10) 600.143

set Y1(10) 143.595

set X1(11) 427.307

set Y1(11) 172.152

set X1(12) 36.964set Y1(12) 164.467

set X1(13) 213.653

set Y1(13) 50.7235

set X1(14) 149.096

set Y1(14) 162.93

set X1(15) 425.77

set Y1(15) 61.483


{

$node_($i) set X_ $X1($i)

$node_($i)

set Y_ $Y1($i)

$node_($i) set Z_ 0.0

}

puts "----------------------------------------"

puts "| Node | ip | "

puts "----------------------------------------"


{

if { $i < $val(nn)} {

puts "| node_($i) | $ip_($i) | "


39/55

39

}

}

puts "---------------------------------------"

set m 0

puts "----------------------------------------"

puts "| Node | One hop neighbour |"

puts "----------------------------------------"

for {set i 0} {$i < $val(nn) } {incr i} {

set k 0

for {set j 0} {$j < $val(nn) } {incr j} {set a [ expr $X1($j)-$X1($i)]

set b [ expr $a*$a]

set c [ expr $Y1($j)-$Y1($i)]

set d [ expr $c*$c]

set e [ expr $b+$d]

set f 0.5

set g [expr pow($e,$f)]

#puts "Distance from node($i) --to--node($j)----------->$g"

if {$g


40/55

40


$ns_ at $val(stop).0 "$node_($i) reset";

}

set udp_(0) [new Agent/UDP]

$ns_ attach-agent $node_(2) $udp_(0)

set null1_(0) [new Agent/Null]

$ns_ attach-agent $node_(3) $null1_(0)

set cbr1_(0) [new Application/Traffic/CBR]

$cbr1_(0)

set packetSize_ 1000$cbr1_(0)

set interval_ 0.06

$cbr1_(0)

set maxpkts_ 1000

$cbr1_(0) attach-agent

$udp_(0)

$ns_ connect

$udp_(0) $null1_(0)

$ns_ at 1.00 "$cbr1_(0) start"

source ./scenerio

source link.tcl

$ns_ at $val(stop).0002 "puts \"NS EXITING...\" ; $ns_ halt"

puts $tracefd "M 0.0 nn $val(nn) x $val(x) y $val(y) rp "

puts $tracefd "M 0.0 prop $val(prop) ant $val(ant)"

puts "Starting Simulation..."

$ns_ run

Black Hole.tcl

set val(chan) Channel/WirelessChannel

set val(prop) Propagation/TwoRayGround


41/55

41

set val(netif) Phy/WirelessPhy

set val(mac) Mac/802_11

set val(ifq) Queue/DropTail/PriQueue

set val(ll) LL

set val(ant) Antenna/OmniAntenna

set val(x) 1500

set val(y) 1500

set val(ifqlen) 100

set val(adhocRouting) AOMDV

set val(nn) 25set val(stop) 5.0

set ns_ [new Simulator]

set topo [new Topography]

$ns_ color 0 red

set tracefd [open out.tr w]

set namtrace [open out.nam w]

$ns_ trace-all $tracefd

$ns_ namtrace-all-wireless $namtrace $val(x) $val(y)

$topo load_flatgrid $val(x) $val(y)

set god_ [create-god $val(nn)]

set myagent [new Agent/MyAgentOtcl]

$myagent call-my-priv-func

puts "Node (15)--BH NODE "

$ns_ node-config -adhocRouting AODV \

-llType $val(ll) \

-macType $val(mac) \

-ifqType $val(ifq) \

-ifqLen $val(ifqlen) \

-antType $val(ant) \

-propType $val(prop) \

-phyType $val(netif) \

-channelType $val(chan) \


42/55

42

-topoInstance $topo \

-agentTrace ON \

-routerTrace ON \

-macTrace OFF

for {set i 0} {$i < 14 } {incr i} {

set node_($i) [$ns_ node]

}

$ns_ node-config -routerTrace OFF \

for {set i 14} {$i < 25 } {incr i} {

set node_($i) [$ns_ node]

}

$node_(0) set X_ 382.379

$node_(0) set Y_ 421.915

$node_(0) set Z_ 0.0

$node_(1) set X_ 432.748

$node_(1) set Y_ 231.609


$node_(2) set X_ 743.753

$node_(2) set Y_ 516.093


$node_(3) set X_ 562.949

$node_(3) set Y_ 547.951


$node_(4) set X_ 385.909

$node_(4) set Y_ 522.684


$node_(5) set X_ 611.179

$node_(5) set Y_ 80.8467


43/55

43


$node_(6) set X_ 872.342

$node_(6) set Y_ 176.713


$node_(7) set X_ 659.178

$node_(7) set Y_ 340.335


$node_(8) set X_ 858.163

$node_(8) set Y_ 261.955

$node_(8) set Z_ 0.0$node_(9) set X_ 488.711

$node_(9) set Y_ 439.31


$node_(10) set X_ 602.09

$node_(10) set Y_ 427.595

$node_(10) set Z_ 0.0

$node_(11) set X_ 809.522

$node_(11) set Y_ 109.988

$node_(11) set Z_ 0.0

$node_(12) set X_ 584.09

$node_(12) set Y_ 246.405

$node_(12) set Z_ 0.0

$node_(13) set X_ 812.363

$node_(13) set Y_ 404.247

$node_(13) set Z_ 0.0

$node_(14) set X_ 686.411

$node_(14) set Y_ 173.332

$node_(14) set Z_ 0.0

$node_(15) set X_ 739.587

$node_(15) set Y_ 278.069

$node_(15) set Z_ 0.0

puts "Loading connection pattern..."


44/55

44

puts "Loading scenario file..."


$ns_ initial_node_pos $node_($i) 30

}


$ns_ at $val(stop).0 "$node_($i) reset";

}

set udp_(0) [new Agent/UDP]

$ns_ attach-agent $node_(4) $udp_(0)

set null1_(0) [new Agent/Null]$ns_ attach-agent $node_(6) $null1_(0)

set cbr1_(0) [new Application/Traffic/CBR]

$cbr1_(0) set packetSize_ 1000

$cbr1_(0) set interval_ 0.01

$cbr1_(0) set random_ 1

$cbr1_(0) set maxpkts_ 1000

$cbr1_(0) attach-agent $udp_(0)

$ns_ connect $udp_(0) $null1_(0)

$ns_ at 1.00 "$cbr1_(0) start"

$ns_ at 4.5 "$cbr1_(0) stop"

$ns_ at 4.1 "$node_(19) add-mark m red circle"

$ns_ at 2.1 "$node_(18) add-mark m red circle"

$ns_ at 1.1 "$node_(4) add-mark m green circle"

$ns_ at 1.1 "$node_(6) add-mark m blue circle"

$ns_ at 1.0 "$node_(17) setdest 689.471 471.541 100"



$ns_ at 0.5 "$node_(4) label SOURCE"

$ns_ at 0.5 "$node_(6) label DESTINATION"

$ns_ at 2.1 "$node_(18) label BH-NODE"

$ns_ at 4.1 "$node_(19) label BH-NODE"



45/55

45










$ns_ at 0.0 "$node_(11) setdest 584.654 940.915 7"$ns_ at 0.0 "$node_(12) setdest 734.307 863.633 7"




puts "Node (17)--BH NODE "

$ns_ at $val(stop).0002 "puts \"NS EXITING...\" ; $ns_ halt"

puts $tracefd "M 0.0 nn $val(nn) x $val(x) y $val(y) rp "

puts $tracefd "M 0.0 prop $val(prop) ant $val(ant)"

puts "Starting Simulation..."

$ns_ run

APPENDIX-II (Screen Shots)

A1. Node Creation


46/55

46

A2. Mobility of nodes


47/55

47

A3. Discovery of non-faded path


48/55

48

A4. Routing of packets through non fading path


49/55

49

A5. Injection of one black hole in the network


50/55

50

A6.Routing of packets through Black hole in the network


51/55

51

A7. Injection of another black hole in the network


52/55

52

A8. Implementation multipath routing algorithm


53/55

53

PUBLICATIONS


54/55

54

[1] Sherril Sophie Maria Vincent, Thamba Meshach W.,Preventing black hole

attack in MANETs Using Randomized Multipath Routing Algorithm, Emerging

Trends In Informatics and Computing 2011,Prathyusha Institute of Technology and

Management.

[2] Sherril Sophie Maria Vincent, Circumventing black holes in MANETs Using

Randomized Dispersive Routes, National Conference on cloud computing and

Network Security 2012, RMK Engineering College.

[3] Sherril Sophie Maria Vincent, Black hole Attack Prevention in Mobile Ad hoc

Networks, National Conference on Technological Advancements in Mechanical

Engineering 2012, Selvam College of Technology.

[4] Sherril Sophie Maria Vincent, Thamba Meshach W., Preventing black hole attack

in MANETs Using Randomized Multipath Routing Algorithm, International Journal

of Soft Computing and Engineering, ISSN:2231-2307, Volume-1, Januray2012.

REFERENCES


55/55

55

[1] Biswas S. and Morris R., ExOR: Opportunistic Multi-Hop Routing for Wireless

Networks, ACM SIGCOMM Computer Comm. Rev., vol. 35, no. 4, pp. 133-144,

Aug. 2005.

[2] Charles E. Perkins, and Elizabeth M. Royer, Ad-hoc On-Demand Distance Vector

(AODV) routing, Internet Draft, November 2002.

[3] Pham P., Perreau S., and Jayasuriya A., New Cross-Layer Design Approach to Ad

Hoc Networks under Rayleigh Fading, IEEE J. Selected Areas in Comm., vol. 23, no.

1, pp. 28-39, Jan. 2005.

[4] Toh C., Associativity-Based Routing for Ad-Hoc Mobile Networks, Wireless

Personal Comm., vol. 4, pp. 103-139, Nov. 1997.

[5] Vaidya B, Pyun Y. J., Park J A., and Han S.J.. Secure multipath routing scheme for

mobile ad hoc network. In Proceedings of IEEE International Symposium on

Dependable, Autonomic and Secure Computing, pages 163171, 2007.

[6] Ye Z., Krishnamurthy V., and Tripathi S.K., A framework for reliable routing in

mobile ad hoc networks. In Proceedings of the IEEE INFOCOM Conference, volume

1, pages 270280, Mar. 2003.

[7] Zhang H. and Dong Y.N., Mobility Prediction Model Based Link Stability Metric

for Wireless Ad Hoc Networks, Proc. Intl Conf. Wireless Comm., Networking and

Mobile Computing (WiCOM), pp. 1-4, Sept. 2006.

Content Final Phase2

Documents

Transcript of Content Final Phase2