UDRPG for MANET

1. IEEE-32331
International Conference on Science, Engineering and Management Research (ICSEMR 2014)
978-1-4799-7613-3/14/$31.00 ©2014 IEEE
UDRPG: Dynamic Key Management Based Node
Authentication for Secret Communication in MANET
Mr. G. Venkata Swaroop1
Research Scholar,
Department of Computer Applications,
St. Peter's University,
Avadi, Chennai - 600 054
venkataswaroop.g@gmail.com
Dr. G. Murugaboopathi2
Associate professor,
Department of Information
Technology,
Veltech Multitech Dr. Rangarajan Dr.
Sakunthala Engineering College,
Avadi, Chennai- 600 620
gmurugaboopathi@gmail.com
Mr. S.A. Kalaiselvan3
Research Scholar,
Department of Computer Science and
Engineering,
St. Peter's University,
Avadi, Chennai - 600 054
kalaiselvanresearch@gmail.com
Abstract- One of the main issues in MANET is security. Since
MANET characteristics are dynamic, it make vulnerable to
various severe attacks. Cryptography can provide a strong
solution for most vulnerability. Various approaches are discussed
in the literature review. From them, ID-based cryptography and
key management approaches are utilized for reducing the cost
and time. This paper presents a UDRPG – [Unique-Dynamic-
Random-Password-Generation] method to generate unique IDs
for entire nodes in the network. Each node should submit their
unique random key while communication in the network. The
simulation results show that UDRPG can give better results than
the existing approaches.
Keywords—Dynamic Key; Cryptography; MANET; Malicious
Attack.
I. INTRODUCTION
Because of the fast improvement of mobile and
communication based innovations, MANET has pulled in a ton
of consideration from both the exploration and industry groups.
MANETs are agreeable networking systems where the
independent nodes should have collaboration based operations.
Because of node adaptability, the network topology is
exceedingly powerful. Then again, because of MANET’s
qualities, they are defenseless to numerous categories of attacks
[1]. It is broadly recognized that cryptographic instruments can
give a set procedures against general vulnerabilities. Ordinary
cryptographic systems may be partitioned into symmetric ones,
depending upon the way they utilize keys [2]. Albeit symmetric
systems assist less control than unbalanced ones, they are not
adaptable, requesting that mystery keys must be imparted
either by a safe pre-established network. In this way, ordinary
symmetric plans are hard to apply in MANETs [3]. A key
management scheme is discussed in [8] and ID-based schemes
necessitate the structure of servers.
A. Nomenclature
Symbol Description
MANET Mobile Ad-Hoc Networks
UDRPG Unique-Dynamic-Random-Password-Generation
ID Identification
UDKG Universal Dynamic key Generator
AC Authentication Certification
ABC Authentication Based Certification
Veltech Multitech Dr.Rangarajan Dr.Sakunthala Engineering College,
Avadi, Chennai (Sponsors)
Symbol Description
VBEDM Variable size Block
Encryption utilizing
Dynamic-key Mechanism
IBE Information Based
Encryption
PKG Private Key Generation
II. RELATED WORKS
In ABC general common key of every node is determined
from his Authenticity which could be a self-assertive string.
Every node needs to get their private key from a server called
UDKG for Authenticity. To mix a message for a node, just his
Authenticity the UDKG's open key are required and no open
key accreditation is required. The UDKG could be seen as a
confirmation executor for a specially appointed gathering. At
the point when utilized within MANET, ABC has clear
preference over standard open key plans in that others can
make an impression on a validated node without collaboration
or prearrangement (accepting the UDKG's open key is all
around known) — that is, non-intuitive session key setup —
which is a craved property when just an unidirectional channel
exists between two nodes or getting to the AC is outlandish; in
standard open key plans, nodes need to acquire the general
population key endorsement from the beneficiary or the server.
Be that as it may, the principle issue of receiving ABC in
MANETs is that an incorporated server is required as the
UDKG, which defiles the companionship toward oneself
nature of a MANET. Nodes in a MANET normally fit in with
diverse nodes, suggesting trouble in discovering a trusted
server to issue node private keys. The UDKG undertaking must
be appropriated among all nodes. We give a convention for
this, hence expanding the ease of use of ABC for MANET.
At the point when nodes have no former trust built, it might
be enticing to utilize gathering key consent to acquire a
gathering key as the introductory trust. Then again, the key
assent ion process needs to be directed again at whatever point
parts join or leave the gathering and this rekeying methodology
is not proficient in MANET and much of the time can't survive
or endure its evolving topology. Then again, pre-computing all
the gathering keys utilizing key assent ion is not doable
because of the colossal key stockpiling necessity. Dispersing
general society key accreditation assignment among nodes has
been acknowledged in [5]. Through the provision of Feldman's
obvious secret imparting plan, a development for offering the

2. IEEE-32331
errand of the ABC-UDKG among all nodes is given. All the
more particularly, the principle commitment of this article is
that an appropriated UDKG usage for Boneh-Franklin's IBE
[4] is exhibited, which permits the capacity of a trusted
Dynamic key Generator (required for ABC) to be safely
disseminated among all the taking an interest nodes in a
MANET.
Various algorithms and techniques were discussed in the
earlier studies for secured communication. An encryption
system called VBEDM [5], which is defined with unlimited
key size, powerfully changing change table focused around the
encryption key and variable square size for each one round. In
most provisions, cryptography is carried out in machine
programming. By and large, symmetric calculations are much
speedier to execute on a workstation than unbalanced ones.
VBEDM is a symmetric encryption calculation. The key size
[6] is not settled the tomb expert needs to pursuit the numerous
conceivable outcomes. Despite the fact that if the sepulcher
expert gets the some possible key organization, the VBEDM
produces the more distinction for the plaintext due to its
boundless key size era by utilizing cyclically variable
positional perusing of bits from the produced key bits stream,
encryption is requisitioned distinctive piece size [7] with
variable stage and variable round perplexing capacity.
III. PROPOSED APPROACH
UDRPG is basically developed for creating and developing
keys to be assigned for every node in the network and the
complete key management system has four random processes
discussed below.
Unique dynamic random password generation-[UDRPG] is
basically started from key management applications in less
cost, less storage and less time. UDRPG has integrated by four
internal random algorithms.
 Reads the parameters used for security as input and
delivers an appropriate public or private key pair known
to PKG. i.e. PKG generates dynamic, random public or
private keys to any item or node.
 Accepts the key obtained from (1) as node’s identity
and provides a personal private key for the node.
 Read the message to be passed as input and encrypt
using public key obtained from (1), and return cipher
text.
 Using public used in (3) of the node and cipher text then
returns decrypted message.
UDRPG in MANET
Let us consider UDRPG applied into a network G with N
number of nodes.
1.) A generator G G1 is arbitrarily picked by either
one node or all nodes. Joint processing could
basically be attained by summing the generators
picked by all nodes.
2.) Every node Pi arbitrarily picks a secret xi Z*
q and
registers Yi = xi G. Pi sets ai0 = xi and picks an arbitrary
polynomial fi(z) over zq of degree t-1 as takes after:
fi(z)= ai0 + ai1z + … + ai(t-1)Zt-1
Pi telecasts Aik = aik G for k [0, t-1.]
Note that Aio = Yi. Pi processes the offer sij =fi(j) mod
q for j [1,n] and sends sij subtly to node Pj.
3.) Every Pj confirms the shares he accepted from
different nodes by checking for i = 1…n:
Sij G = t-1
k=0 jk
Aik
On the off chance that the check falls flat for a file i,
Pj shows a dissention against Pi.
4.) On the off chance that t or more nodes grumble
against a node Pi, and then Pi is recognized as
defective and precluded. Overall, Pi uncovers the
offer sij for each one whining node. In the event that
any of the uncovered shares fizzles the check once
more, Pi is disentitled. The secret imparted by a
precluded node Pi is situated to xi = 0 and Yi
equivalent to the Authenticity component in G1. The
set of non-disentitled nodes is meant by QS.
5.) Node in general key Y = i QS Yi and the offer of
secret x for Pj is Wj = i . Node in general
confirmation qualities are: Ak = i QS Aik for
k = 1, …, t-1. Note that Ao = Y. Given any t nodes
Pi1,Pi2,…, Pit, the secret x can be reconstructed as
j - ir
x= t
l=1 Lil(0) wil where Lil(j) = 1 r  t  l 
il - ir
is the Lagrange coefficient for Pil and wil is the secret share of
Pil.
Note that wiG = t
k=0 ik
Aik for i [1,n].
UDRPG Based Node Communication
IDnode B pKpkg PKG sKnode B
DATA DATA
Fig. 1. Generic ID based encryption scheme
Fig.1 demonstrates a nonexclusive ID-based encryption
plan, in which node A needs to send a scrambled message to
node B. Node A uses the general population key of node B
(IDnodeB) and the general population key of the PKG(pkpkg) to
figure the message (DATA). At the point when node B accepts
the cipher text (C), it uses its private key (sKnodeB) to
Decryption
Encryptio
n
Encryption

3. IEEE-32331
unscramble the message. Note that node B accepts its private
key from the PKG.
UDRPG Algorithm ( )
{
 Let G = {N1… Nn} is a network with N number of
Nodes
 Assume PKG is common to sender and receiver
 For I = 1 to N
 Generate public or private key for all Ni
 End
 Get IF of source node, data, get key from PKG for node
i
 Encrypt data using key of ith
node from PKG
 Send encrypted data.
 Receiver receives encrypted data, get key from PKG
then decrypt the cipher text
}
IV. SIMULATION AND DISCUSSION
UDRPG algorithm can be written in any language and its
efficiency is verified. In this paper NS2 software is used to
verify the UDRPG’s efficiency and its performance can be
computed and evaluated in terms of Throughput, Energy and
delay by changing the number of nodes deployed in the
network as: 10, 20, 30, 40 and 50.
Fig. 2. VBEDM vs. UDRPG Comparison In Terms of Energy
Fig.2 depicts the comparative results of remaining energy
obtained from existing system as well as propsoed system in
each round. VBEDM obtaines the remaining energy as 94%,
91%, 90%, 88.11% and 85.12% for 10, 20, 30, 40 and 50 nodes
respectively. Whereas UDRPG obtaines 99.12%, 98.34%,
97%, 96.01% and 95.55% for 10, 20, 30, 40 and 50 nodes
respectively. Hence UDRPG saves more energy than VBEDM
and UDRPG is efficeint in terms of energy.
Fig. 3. VBEDM vs. UDRPG Comparison In Terms of Throughput
The throughput in a network is also depends on the number
of nodes and number of transactions among the nodes. Some of
the nodes are doing only transmitting the data packets; some of
the nodes are doing only receiving the data packet. Some of the
nodes are idle and some of the nodes are doing both
transmitting and receiving the data packets. Fig.3 depicts the
comparative results of throughput obtained by VBEDM and
UDRPG in each round. VBEDM obtaines the throughput as
1893, 2134, 2898, 3698 and 4589 KB for 10, 20, 30, 40 and 50
nodes respectively. Whereas UDRPG obtaines the throughput
as 2100, 2350, 3400, 4100 and 5103 KB for 10, 20, 30, 40
and 50 nodes respectively. Hence UDRPG obtaines more
throughput than VBEDM and UDRPG is efficeint in terms of
throughput also.
Fig.4 depicts the comparative results of delay taken for
transmitting the data from source ndoe to destination node by
VBEDM and UDRPG in each round. VBEDM took delay as
102, 134, 167, 189 and 211 ms for 10, 20, 30, 40 and 50 nodes
respectively. Whereas UDRPG took delay as 49, 78, 101, 148
and 184 ms for 10, 20, 30, 40 and 50 nodes respectively.
Hence UDRPG tooks less delay than VBEDM and UDRPG is
efficeint in terms of delay also. The formulas used for energy,
throughput and delay calculation is given below
Delay:
Every transaction in the network takes an amount of time to
complete the process. In this paper the delay time is computed
using the following equation as:
e2e – delay = N [delay transmission + delay propagation + delay process]
Where N  is the Number of Links in the network;
delay transmission  time taken for transmitting the data;
delay propagation time taken for propagation;
delay process  time taken for complete the process. In this
paper the Delay is computed for various numbers of iterations.
Energy:
Like delay to do any functions like transmission, receiving,
listening and wakeup, sleep, idle each node needs some amount
of energy. Each node assigned by an initial energy value like
100. Whenever a node completes a function according to the
function the energy value is reduced from the initial energy
value and the relevant formula is given below.
Remaining Energy = EINIT – [ETX + ERX + EIDLE + ESL]
Where EINIT  Initial Energy;
ETX  Transmission Energy;

4. IEEE-32331
ERX Receiving Energy;
EIDLE  Idle Energy;
ESL  Sleeping Energy;
Fig.4: VBEDM vs. UDRPG Comparison In Terms of Delay
V. CONCLUSION
UDRPG utilized PKG based private key and public key
generation for each node to create a dynamic ID which
improves the trustiness of a node. In ordinary systems this is
not a significant issue, yet in MANETs, in which the power is
appropriated among online servers or copied by a subjective
substance, this may be an issue. Moreover, the utilization of
ID-based plans needs namelessness and security protection, as
they utilize the personality of a node as their open key.
UDRPG improves the quality of service factors than the
existing approaches and shown in Fig.2, Fig.3 and Fig.4. In
future UDRPG can be compared with various algorithms and
more number of nodes in a network for evaluating the
performance.
REFERENCE
[1] D. Djenouri, L. Khelladi, and N.Badache, “A Survey of Security Issues
in Mobile Ad Hoc and Sensor Networks,” IEEE Surveys & Tutorials,
vol. 7, no. 4, 2005,pp. 2–28.
[2] A. J. Menezes, P. C. V. Oorschot, and S. A. Vanstone, Handbook of
Applied Cryptography, CRC Press, 1996.
[3] I. Chlamtac, M. Conti, and J. J.-N. Liu, “Mobile Ad Hoc Networking:
Imperatives and Challenges,” Ad Hoc Networks, vol. 1, no. 1, 2003, pp.
13–64.
[4] D. Boneh and M. Franklin, “Identity-based encryption from the Weil
pairing,” in Proc. 2001 Advances in Cryptology, pp. 213–229, 2001.
[5] K.C.ShyamalaBai, “Variable Size Block Encryption using Dynamic-
key Mechanism (VBEDM)”, IJCA-Volume 27– No.7, August 2011.
[6] Hamid Mirvaziri, Kasmiran Jumari Mahamod Ismail and Zurina Mohd
Hanapi, “Message Based Random Variable Length Key Encryption
Algorithm” Journal of Computer Science 5 (8): 573-578, 2009.
[7] Zhu Shun-le, Wang Ya-xiang, Li Xin, “Design and Analysis of
Variable-length Block Encryption Based on Chaos Particle Swarm”,
Hefei, China. August 24–27, 2010.
[8] H. Chien and R. Lin, “Improved ID-Based Security Framework for Ad
Hoc Network,” Ad Hoc Networks, vol. 6, no. 1, 2008, pp. 47–60.