International Journal of Computer Applications in Engineering Sciences
[VOL II, ISSUE II, JUNE 2012]
[ISSN: 2231-4946]
An Evaluation of GET to Secure Data Transmission using DH Routing Approach against
NLA in MANETs
Venkatesh S , 2G.S. Mamatha
1
1,2
Department of Information Science & Engg, R V College of Engineering, Bangalore
1svenkatesh200@gmail.com
2mamatha.niranjan@gmail.com
Abstract: A Mobile Ad-Hoc networks (MANETs) is a collection of mobile node which communicate each other
through wireless link to give a stationary infrastructure
network without any centralized administration. With
increase in number of attacks strategies on MANETs there
is need to propose best routing approach with efficient
encryption technique which resist attacks.
In this paper we have implemented network grid, GC
technique for text, image and graphics, and DH routing
approach along with prominent network layer attack such
as black hole, grey hole and message tampering attacks.
Our objective is to thoroughly encrypt, route and analyze
the impact of above attacks on MANETs performance.
Our evaluation result significantly depends on attack type
and parameter used. The performance of the network is
analyzed with number of nodes and load to transmit in the
network.
Keywords: MANETs, Gene Crypt Technique, DH routing
approach, Network layer attacks, Performance Evaluation.
I.
INTRODUCTION
MANETs were introduced in early 1970 by BBN
Technologies and SRI International designed as packet
radio network [1]. Since MANETs is a recent technology it gained a huge attention of many researchers and
exhibit there new ideas that would enhance the features
and potential of MANETs. These networks are suitable
for disaster recovery, battle field, emergency situation
and commercial sector [2]. MANETs use routing protocol such as DSR, DSDV, and AODV etc to transmit data
between nodes efficiently. MANETs consists of many
nodes with wireless connection in which there is a possibility of node become inactive, breakage of link between nodes, addition of foreign nodes into network
which act malicious or node in the network may act malicious. With this problem in MANETs the performance
metrics such as round trip time, end to end delay and
through put of the existing routing protocol have decreased and vulnerable to many of the network attacks.
In this paper we present a travelling salesman problem approach to design reactive routing approach for
MANETs. Proposed approach detects and corrects net-
work layer attacks using genetic encryption technique
(GET).
The remaining of this paper is structured as follows: section II briefly examines the related works section, III proposes network model, gene crypt encryption
technique, distance hop count (DH) routing approach
and network layer attack, section, IV provides performance comparison between without attack and with
attack, section V concludes the paper with future work.
II. RELATED WORK
Several encryption techniques to encrypt data,
routing protocol and attacks have been proposed in
MANETs environment. Two of the prominent encryption techniques are advance encryption standard (AES)
and data encryption standard (DES).
Wails S, Elkilani, Haten M. Abdul-Kader [3] address AES algorithm as symmetric key cryptosystem
that processes 128-bit data blocks using cipher keys with
lengths of 128 bits was adapted to secure multimedia
applications. Tingyuan Nie, Teng Zhang [4] address
DES as a 64-bit block cipher under 56-bit key. This algorithm processes with an initial permutation, sixteen
round block cipher and a final permutation. The drawback of using AES and DES is fault injection attack in
which attacker can reset an entire byte of the key or corrupt the basic round instruction to get the secrete key.
Since both encryption technique uses higher key size
which leads to clear change in the battery and time consumption.
S. M. Bo, H. Xiao, A. Adereti, J. A. Malcolm and
B. Christianson [5] present a performance analysis of
different routing protocols under attack. They compare
three different routing protocols under attack by two
types of selfish nodes: Destination-Sequenced DistanceVector (DSDV), Dynamic Source Routing (DSR), and
Ad-hoc On-Demand Distance Vector (AODV). Evaluation metrics are end to end delay, throughput, and routing overhead. Their evaluation results show that proactive DSDV routing is the most defence routing protocol
under the considered attacks.
66 | P a g e
Venkatesh et. al.
NZ Ali, R B Ahmad, S. A Alijunid exhibit the ability of source and destination to have multipath between
them if the route fails fault tolerance is given with alternative route. TORA, AODV-BR and ZRP protocol were
used with above technique to check the performance
metric. It shows that duplicate RREQ messages are not
rejected hence diminish the performance of network. [6]
OLSR is a proactive routing protocol which is vulnerable to many attacks hence M. Wang, L. Lamont, P.
Mason, M. Gorlatova, presented a paper to provide necessary security and authentication to OLSR protocol. To
accomplish intrusion detection system a semantic checking property is integrated into OLSR protocol to fight
against any abnormal semantics protocol to enter into
system a case study is in the paper explains how OLSR
protocol gives intrusion detection alarm to the working
system by sending warning message to all the nodes in
the network. The drawback of this paper is there is no
correction stage after detection alarm and the protocol
detect external node misbehaviour but there is a need to
study malicious behaviour of internal nodes. [1]
1) Key Generation:
In this stage, a stream of keys is generated using
the initial values which are given by the user. These
keys are nothing but a set of random numbers generated
using equation 𝑋𝑛 + 1 = (𝑎𝑋𝑛 + 𝑐) 𝑚𝑜𝑑 𝑚. where
𝑚
𝑎
the modulus
the multiplier
Initial
Keys
𝑚>0
0<𝑎<𝑚
Sender
Receiver
Original File
Original File
Key Stream
Generation
Message
Authentication
Message
Authentication
Second
Crossover
First Crossover
Mutation
Mutation
First Crossover
Second
Crossover
Key Stream
Generation
III. PROPOSED APPROACH
In this section a brief overview of network grid
model, gene crypt, a routing DH approach and network
layer attacks on proposed approach is explained.
A. Network Model
Ad-hoc network is a modeled using a directed
graph N (V, E) where V represents a finite set of mobile
nodes and E is a finite set of duplex wireless radio links
between nodes. Each node iЄV possess a unique ID and
moves randomly. S and D being the source and the destination of N respectively. Every mobile node i would
possess transmission radius of size R as modeled in
wireless transmission. N (i) is a set of neighbor node j of
node i but not including node i. If node j is in the
transmission radius R of node i , there is a bi-direction,
wireless radio links E[i, j] between node i and node j ,
E[i, j]ЄE .Set E changes with time.[8]
B. Gene Crypt
Gene crypt technique or genetic encryption technique is a special type of encryption technique which
derives the genetic concept of human being. The process
consists of key generation, message authentication,
crossover and mutation. The working of the process
diagrammatically represented in figure 3.1. In gene
crypt, initial keys are provided by the sender for the key
generation process. The keys generated are used in authentication, crossover and mutation processes. The
crossing-over and mutation processes, used with keys,
are used to scramble the input file. After the second
crossover process, the file will be completely encrypted.
[7]
67 | P a g e
Encrypted File
Transmisson
Initial
Keys
Encrypted File
Figure 3.1 Gene Crypt Process
𝑐
𝑋0
𝑋𝑛
the increment
0≤𝑐<𝑚
initial value or seed
0 ≤ 𝑋0 < 𝑚
sequence of key 0 ≤ 𝑋𝑛 < 𝑚
The strength of sequence number generated under
go Mono-bit test, Poker test, Run test and Long run test
to get rid of trial and error method attack.
2) Message Authentication
Message authentication is a procedure to verify
that received messages come from trusted source and
have not been altered during transmission or at the routers. The following four steps are used for authentication
at the sender side.
1. Padding: The message is padded so that its length in
bits is congruent to 384 modulo 512. That is the padded
message is 128 bits less than an integer multiple of 512
bits.
2. Appending length: A 128 bit representation of the
length in bits of the original message (before padding) is
An Evaluation of GET to Secure Data Transmission using DH Routing Approach against NLA in MANETs
appended to the result of step 1. The outcome of the first
two steps yields a message that is an integer multiple
512 bits in length. This outcome is given to a compression function which calculates the digest.
3. Initialize buffers: An intermediate and final result of
the hash function is stored in 128 bit buffer. Four 32-bit
registers (A, B, C and D) are represented by buffer.
These registers are initialized to the following hexadecimal values.
A=89ABCDEF, B= FEDCBA98, C=76543210,
D=01234567
4. Process the message in 512 bit blocks: Each 512 bit
block is given as input to the processing stage of the
authentication function where it is divided as four 128
bit segments. Each 128 bit segment is fed to one of the
four functions F, G, H, I. These functions are show below
Function
F:
𝐴=𝐴+
((𝑋[0] & 𝑋[1]) | (~𝑋[2] & 𝑋[3]))
Function
G:
𝐵=𝐵+
((𝑋[4] & 𝑋[5]) | (~𝑋[6] & 𝑋[7]))
Function
H:
𝐶=𝐶+
((𝑋[8] & 𝑋[9]) | (~𝑋[10] & 𝑋[11]))
Function I:D= 𝐷 +
((𝑋[12] & 𝑋[13]) | (~𝑋[14] & 𝑋[15]))
3) Crossover
The message after message authentication is represented as a data array with first and the last element are
selected for the first iteration and they are divided at the
positions indicated by the key value for crossover. After
the crossover two children are produced of new value.
4) Mutation
In this we change the bits of data values to produce
a totally new value. Here the multiple bits of the input
data are mutated, depending on the keys generated. The
position where the desired operation is needed to be
carried out is provided by the key and a sample is shown
as follows
0 1 1 0 1 1 0 1
0 0 0 0 0 1 1 0
0 1 1 0 10 1 1
5) Second Crossover
This process is exactly the same as first cross over
but the embedding of mutation in between the two
crossovers makes all the difference.
The decryption process is the reverse process of
encryption process. Here the same key is passed and the
bottom up approach is used for getting the clear text,
image and graphic back at receiver.
C. DH Routing Approach
DH routing approach consists of three main phases; Route discovery, Data transmission and Route
maintenance. [8]
1) Route Discovery
In the route discovery phase, the best path from
distance and hop count aspects is computed. Assume the
source node Ns want to transfer data packet to destination node Nd. with no route to Nd. Ns initiates a route
discovery by flooding a route request message (RREQ)
to its neighbour’s active nodes. The RREQ message
contains source identification number Ns, destination
identification number Nd, hop count and distance between nodes. Each node Nj receives route request packets directly from an intermediate node Ni, and stores Ni`s
information in the route table, an path distance Pij is also
stored in the route table. Each intermediate node Nj
check for early receive of RREQ message if so it drop
the packet else store in route table. After destination
node Nd receives RREQ message it sends RREP message in all existing active path on receiving RREP message the source node Ns sort all the paths based on hop
count if an ambiguity created by two or more paths have
same hop count then source node sort path based on
distance and all the paths are stored in route table. [8]
2) Data Transmission
In this phase encrypted data packets are relayed
through optimal path found in route discovery phase.
Destination node send acknowledgement packet for each
data packet it receive and decrypt the encrypted message
to get original data.
3) Route Maintenance
In this phase if any of the node is inactive in the
optimal path Psd in which data packets are transferring a
route error (RERR) message is sent by the previous
node of the inactive node in the optimal path to the
source node. Source node deletes the corrupted path and
transmits data packets in next optimal path available in
route table. After deleting the path/paths from its route
table, and if no paths are available, then Route Maintenance phase will intimate the Route Discovery phase to
start again from the scratch to find the new paths.
D. Network Layer Attacks (NLA)
This section briefs how attack are detected and corrected by launching attacks such as black hole, grey hole
and message tampering attacks on DH routing approach
which pertaining to the network layer in the network
protocol stack.
1) Black Hole Attack
68 | P a g e
Venkatesh et. al.
2) Grey Hole Attack
The grey hole attack purposefully drop or consume
selected packets by the attacking node. Source node
calculates data packets sent and acknowledgement packets received if it turns to 50% then source node decide
its grey hole attack and route data packets in next alternative path. [9][10]
3) Message Tampering Attack
The message tampering attack alters the content of
the message by deleting or adding content into the message hence confidentiality is lost. This attack is detected
by calculating the message digest for received message
and compares it with the appended message digest.
IV. PERFORMANCE EVALUATION
The comprehensive proposal of encryption, DH
routing, and NLA is implemented on network grid of
800 by 800 with 30 nodes placed randomly is shown in
figure 4.1 and transmission range of each node is set for
relaying of message between nodes. The mobility of
each node is 5 to 10 m/sec pause time.
then we discuss the Simulation result of the DH routing
approach by launching attacks and without attacks on
this approach using performance metrics.
A. Comparison of Message Digest Calculation
The digest calculation which is implemented in gene
crypt is much faster, when compared MD5 algorithm. In
gene crypt, calculation of message digest for the text,
image and graphics shown in the Figure 4.2 takes few
milliseconds, then of MD5 algorithm with the file size
of 10.2MB. These values are taken from a computer
having 64 bit processor with 2.40 GHz and 4GB of
RAM.
140
120
Time in Millisecond
The black hole attack generates and circulates incorrect routing information so that packets are lost or forwarded to attacking node instead of forwarding to intended recipient. With this information source node keep
counter of data packet sent and acknowledgement packet received if the ratio is 100% source node decide its
black hole attack and route data packets in next alternative path.[9][10]
100
80
60
40
20
0
Gene Crypt
Message Digest
Text
Image
Graph
ics
57.5
75
73
99
125
122
Figure 4.2 Comparison of Message Digest Calculation in millisecond
B. Encryption Result:
The gene crypt encryption technique is specially
design for MANETs to preserve confidential information and it can be shown through encryption results.
1) Text:
The plain text shown in the Figure 4.3(a) is given
as input to Gene Crypt; corresponding encrypted file
shown in the Figure 4.3(b) is produced.
Figure 4.1 Network Grid with 30 nodes
In this section we present the comparison of message
digest calculation of gene crypt against MD5. An encrypted text, image and graphics result is analysed and
69 | P a g e
An Evaluation of GET to Secure Data Transmission using DH Routing Approach against NLA in MANETs
(a)
(b)
Figure 4.3 (a) Original text and (b) Encrypted text
2) Image:
Histogram gives the color distribution of an image.
It gives the number of occurrences of distinct pixels in a
given image. The input image is shown in figure 4.4 and
its encrypted image along with histogram is shown in
figure 4.5 and it can be observed that encrypted image
histogram is uniform but it varies for original image.
3) Graphics:
A line, graphs, maps, engineering drawing etc act
as graphics. A simple graphics is shown in figure 4.6 (a)
and its encryption is shown in figure 4.6 (b). Since
graphic is free of colours it does not contain any histogram representation.
(a)
(b)
Figure 4.6 Graphics and its Encryption
Figure 4.4 Original image
It can be observed that the encrypted text, image
and graphics are completely different from that of their
origin and are unintelligible.
C. Simulation Result
The simulation results analysed using performance
metrics such as end to end delay, round trip time and
throughput figure 4.7 show the end to end delay taken
for data packet transmission without any attack and with
attack. The delay in increase with attack to that of without attack taken in terms of percentage varies from 40%
to 50%.
Figure 4.7 End to End Delay (sec)
Figure 4.5 Encrypted image with its RGB histogram
Figure 4.8 show the RRT for data packets transmission without any attack and with attack. The increase
of RTT with attack to that of without attack in terms of
70 | P a g e
Venkatesh et. al.
percentage varies from 45% to 50%. Figure 4.9 show
the throughput taken for data packets transmission per
second without any attack and with attack. The number
of packets transmitted per second varies from 3 to 0 with
respect to number of packets used.
ery and route maintenance of DH routing is more advance then existing routing protocol.
Our evaluation result shows that message digest
calculation in gene crypt is more efficient then MD5
algorithm. The degree of impact of performance metrics
differs depends on the simulation environment used. The
performance evaluation show that our solution for MANETs security favours less end to end delay, round trip
time and throughput.
As a potential direction for future work we can use
the gene crypt for audio, video encryption, and improve
DH routing approach performance by including time
constraint in routing approach.
ACKNOWLEDGEMENT
This work has been supported in part by G.S. Mamatha, Assistant Professor, ISE Department at R V College of Engineering.
REFERENCES
Donatas Sumyla, “mobile ad-hoc network (MANETs)” march
2006,[online].Available:http://ecom.umfk.maine.edu/MMobile%2
0Ad.
pdf
[2] [M. Wang, L. Lamont, P. Mason, M. Gorla tova, “An Effective
Intrsion Detection Approach for OLSR MANET Protocol” in 1st
IEEE ICNP workshop on secure network protocols, 2005, pp 5560.
[3] Wail S. Elkilani, Hatem M. Abdul-Kader, “Performance of Encryption Techniques for Real Time Video Streaming” Proceedings of the Interna
tional Conference on Networking and Media Convergence, 2009, pp
130-134.
[4] Tingyuan Nie, Teng Zhang, “A Study of DES and Blowfish
Encryption
Algorithm”. In A Project of Shandong Province
Higher Educational
Science and Technology Program, 2009,
pp. 1-4.
[5] S. M. Bo, H. Xiao, A. Adereti, J. A. Malcolm, and B. Christianson,“A Performance Comparison of Wireless Ad-Hoc Network
Routing Protocols under Security Attack,” in IAS ’07: Proceedings of the Third International Symposium on Information Assurance and Security. Washington, DC, USA: IEEE Computer Society, August 2007, pp. 50–
55.
[6] NZ Ali, R. B Ahmad, S.A.Aljunid, “A Survey on On-Demand
Multi path Routing Protocol in MANETs”, Proceedings of the
International Conference on Electronic Design, June 2008, pp 14.
[7] E. Baburaj1, and V. Vasudevan2, “An Intelligent On Demand
Multi cast Routing Protocol for MANETs”, First International
Conference on Emerging Trends in Engineering and Technology,
July 2008, pp 214-217.
[8] Fatemeh Saremi, Hamid Mousavi, and Ali Movaghar, “Performance Analysis of SLTC – A Stable Path, Low Overhead, Truthful, and Cost
Efficient Routing Protocol in MANETs with
Selfish Nodes”, Proceed
ings of the Asia-Pacific Services
Computing Conference, August 2008,
pp 243-250.
[9] Sukla Banerjee, “Detection/Removal of Cooperative Black and
Gray Hole Attack in Mobile Ad-Hoc Networks” Proceedings of
the World Congress on Engineering and Computer Science, October 2008.
[10] ]Malcolm Parsons, Peter Ebinger, “Performance Evaluation of
the Impact of Attacks on Mobile Ad-hoc Networks” Wireless
Comunica
tions and Networking Conference, vol 2, 2006, pp.
646-654.
[1]
Figure 4.8 Round Trip Time (sec)
Figure 4.9 Throughput (per sec)
The increase in percentage with attack to that of
without attack is not so significant to the situation chosen because of addition of time taken for detection and
correction stage of launched attack on existing optimal
path.
V. CONCLUSION AND FUTURE WORK
In this paper we have implemented and presented
most prominent gene crypt encryption technique, DH
routing approach and network layer attacks. The comprehensive approaches of above implementation gives a
security, confidentiality, integrity, and authenticate proactive routing approach for MANETs. The route discov-
71 | P a g e