International Journal of Research in Advanced Technology IJORAT

Vol. 1, Issue 6, JUNE 2016

SECURED ROUTING USING

CRYPTOGRAPHIC TECHNIQUES IN
WIRELESS SENSOR NETWORKS
Sowmiya.S1, Dr.A.Babu Karuppiah2
PG Scholar,Velammal College of Engineering and Technology,Madurai,Tamil Nadu India.1
Associate professor,Velammal College of Engineering and Technology,Madurai,Tamil Nadu India.2
ABSTRACT
In neoteric technology, Wireless Sensor Networks (WSNs) have become obligatory for monitoring several
applications. It offers an interesting attention to observe environments and used in health, military,
engineering fields, etc. Wireless Sensor Network senses the location by providing remote interaction with
the physical world. The sensor nodes in the Mobile Ad hoc networks are powered by batteries and secured
routing is an important challenge in WSNs. Mobile Ad hoc Network (MANET) which is a type of WSN
composed of a collection of movable nodes which can exchange the data with each other using a wireless
physical medium and sensor nodes are to be protected from various attackers. The objective of this thesis is
to investigate the security related issues and to attain efficient routing in wireless sensor networks. Here
secured routing is done through database system in which cryptographic techniques (AES, DES, RSA,
MD5) are included with various routing protocols (AODV, DSDV, DSR, OLSR). The techniques are
updated in the database and chosen randomly; hence attacker finds it difficult to analyze technique used.
Keywords: WSN, AES, DES, RSA, MD5, AODV, DSDV, DSR, OLSR.

I. INTRODUCTION

II. MANET

Wireless Sensor Network offer an attention to

monitor surroundings and have a lot of interesting
applications in logistics, engineering, health,
military side, etc. It senses environmental
conditions such as temperature, sound, vibration to
pass the data to sink where the data can be
analyzed in [1]. Depending on the application the
size of the Wireless Sensor Network varies from
few to several nodes. A sensor node also known as
mote is a node in a sensor network consists of radio
transceiver, microcontroller, external memory, one
or more sensors, power source with input and
output ports. The radio transceiver is a combination
of transmitter and receiver. This transceiver is used
for wireless radio communication. Microcontroller
consists of peripherals, memory and processor core
and are used to communicate with other devices,
such as sensors, motors, switches. The power
source is needed for sensor node for
communicating, sensing and data processing. The
sensor node has a certain area of coverage and
processes the portion that it is observing. Each
sensor consists of nodes, gateways, and software.
The distributed nodes interface with sensors to
monitor the environment. The obtained data is
wirelessly transmitted to the gateway, which gives
a connection to the wired world. Then we can
collect, process, analyze the data using software.

Locating fixed access points is not always feasible.

Infrastructure may not be present in a war zone or
disaster area and fixed network infrastructure is
impractical in an environment, so Mobile Ad hoc
Network is preferred. Hence in this paper MANET
is considered. Ad hoc network is a wireless
network built spontaneously to connect the device.
To include in an ad hoc network, network adapter
is to be induct in a computer. Mobile Ad hoc
Network is an emanating type of wireless
networks, in which mobile nodes associate on an ad
hoc basis. It does not need base station for
transferring the messages within the network and
are self-forming and self-curing, enabling peerlevel communications to take place between mobile
nodes without depending on centralized resources
or fixed infrastructure. Hence the packet
transformation is done to and from each other by
the individual network.

All Rights Reserved 2016 IJORAT

CHARACTERISTICS OF MANET

In MANET, each and every node acts as

both host and router.
When a source node or destination node
tries to send information to other nodes
which is away from its communication

16

International Journal of Research in Advanced Technology IJORAT

Vol. 1, Issue 6, JUNE 2016

range, packets are forwarded through one

or more intermediate nodes.
The network topology is dynamic in
nature. Hence the nodes can join or leave
the network anytime.
For
security,
routing
and
host
configuration there is Distributed nature of
operation
with
decentralized
infrastructure.
User mobility and user density is in large
level.

III. ROUTING PROTOCOL

Routing is the process of choosing path over which
the packets are sending. Routing protocol denotes
how routers communicate with each other and
messages are broadcasted and it enables them to
select routes between any two nodes. Ad hoc
network routing protocol types are of Proactive
routing, Reactive routing, Hybrid routing and
Hierarchical routing protocols.

routing tables and the updated information from

every node to all other nodes are entered in it.
Examples of Table Driven Routing Protocols are
OLSR (Optimized Link State Routing) and DSDV
(Destination Sequenced Distance Vector).
DSDV is a table-driven routing method for ad hoc
mobile networks in [2]. There is Traffic overhead
even if there is no change in network topology. It
maintains routes which are never used. It makes an
immediate route advertisement on significant
changes in routing table. If topology changes
immediate advertisements are given to the nodes.
Information about new routes, broken links are
immediately passed to neighbors. There is
incremental update that sends only entries that has
been changed. Most routing information which has
been never used causes the overhead.
REACTIVE ROUTING PROTOCOL
It determines the route if and when needed. Route
discovery is initiated by source node. There is low
overhead since routes are determined on demand
with significant delay in route determination.
Examples of reactive routing protocols are OLSR
(Optimized Link State Routing) and AODV (Ad
Hoc On-Demand Distance Vector Routing) in [3].
Routes are maintained only between nodes that
need to communicate. It reduces overhead of route
maintenance. In AODV routes need not be
included in packet headers. Every node in AODV
maintains routing table and it contains entries only
for routes that are in active use. To evade the
broken or old routes and also prevent the formation
of routing loops sequence numbers are used

Fig. 3.1 Routing Protocol Types

TABLE-DRIVEN ROUTING PROTOCOL
It is known as proactive routing protocol. It
maintains the routing tables at each node, which is
updated periodically. Next-hop model is the
method in which each node keeps the best hop
node information for all destination nodes in the
network. Table-driven routing finds routes to all
possible destination nodes in the network. In the
routing tables the every host pair at all times is
entered. One of the routing-table driven routes is
recorded and is updated with specific intervals.
Proactive routing protocols are faster in decision
making, but if the topology of the network
continually changes it cause problems. This type of
protocol maintains new lists of destinations and it
requires every node to maintain one or more
All Rights Reserved 2016 IJORAT

Fig. 3.2 Pathway formed in AODV

Unused routes expire even if topology does not
change in AODV. It is a routing protocol for
mobile ad hoc networks and other wireless ad hoc
networks. In Fig. 3.2, AODV pathway formation is
shown. AODV routing works by using route
request (RREQ) and route reply messages (RREP).
17

International Journal of Research in Advanced Technology IJORAT

Vol. 1, Issue 6, JUNE 2016

RREQ Messages
RREQ message is broadcasted when a node is in
need to find a route to a destination. If a node is not
in range with a node it communicates, it sends a
RREQ message to its neighbors [4]. The RREQ
contains source IP address, sequence number and
destination IP address as well as the lifespan of
RREQ. If a neighbor of the source does not know
the route to destination, it rebroadcasts the RREQ
to its nearby nodes.
RREP Messages
RREP messages are used to finalize the routes.
When a RREQ reaches a destination node, the
route to destination is made accessible by sending a
RREP back to the source node. At last a node
which generates a RREP is itself the destination. It
has an active route from source to the destination.
As the RREP reached back to the source node, their
routing tables are updated by the intermediate
nodes.
RERR Messages
It is broadcasted when a node detects that a link
with its adjacent neighbor is broken or failure.
Hello Messages
This message is used for broadcasting information
about node connectivity. If a neighbor node does
not receive any packets like Hello messages then
the node will assume that the link to this neighbor
is currently lost.
HYBRID ROUTING
This protocol combines the schemes of proactive
and reactive routing. Examples of hybrid routing
protocols are ZRP (Zone Routing Protocol) and
EIGRP (Enhanced Interior Gateway Routing
Protocol).
In [5] ZRP, within a local neighborhood each node
maintains route to destination. Each node finds its
own neighborhood nodes which it calls a routing
zone. The protocols proactive part is restricted to a
small neighborhood of a node and reactive part is
used for routing across the network. This tends to
reduce the latency in route discovery and the
number of control messages as well. In order to
maintain the route, repairing a broken link requires
establishing a new path between the nodes.
The types of routing in ZRP includes intra zone and
inter zone routing. In intra zone routing each node
collects information about all the nodes in its
routing zone in proactive manner the packet is
transmitted within the routing zone of the source
All Rights Reserved 2016 IJORAT

node to reach the peripheral nodes. This strategy is

similar to a proactive protocol. Each node
maintains a routing table and periodically
broadcasts a message similar to a hello message
called as a zone notification message in [6]. In inter
zone routing the nodes from peripheral node are
sent to the destination node. It discovers pathway to
the destination reactively. It the route is not
directed correctly, inter zone routing generate many
copies of the same RREQ message and these
messages are sent towards the destination or to the
previously undetermined regions of the network or
else the same RREQ message may reach the same
nodes repeatedly causing flooding of the network.

IV. METHOD USED

Various cryptographic algorithms are used
for the operation of ad hoc networks. Each Mobile
Host operates as a specially designed router and
routes are obtained as needed. The cryptographic
techniques used in [7], [8], [9], [10] are RSA, AES,
DES, MD5, Public key cryptography. The security
techniques are included in the database as packages in
ns3 software. Various Routing protocols such as
AODV, DSDV, DSR and OLSR are used for
packet forwarding. Routing table contains
destination IP address, destination Sequence
Number Flag, destination Sequence Number, and
routing flags network interface, next hop, hop
Count. Each node maintains a routing table that
includes information about reaching destination
nodes and each entry is keyed to a destination
node.
The key techniques are randomly selected while
transmitting packets, hence the attacker find it
difficult to determine the technique. Routing
protocols are selected along with the cryptographic
technique and the routes are determined to send the
data packets.

V. RESULT AND ANALYSIS

BROADCAST OF PACKETS
When the node enters into the network,
the base station includes it to the routing table
which randomly selects one of the cryptographic
techniques. Then the key is provided to that node
and the secure broadcast begins. Each node
broadcast its packet to remaining nodes in the
network. When the next node starts to transfer the
packet same process takes place.
When the node enters into the network,
the base station includes it to the routing table
which randomly selects one of the cryptographic
techniques. Then the key is provided to that node
and the secure broadcast begins. Each node
broadcast its packet to remaining nodes in the
network. When the next node starts to transfer the
18

International Journal of Research in Advanced Technology IJORAT

Vol. 1, Issue 6, JUNE 2016

packet same process takes place. The broadcast of

packet is shown in Netanim tool.

Fig.5.3 Comparison Graph for Encryption

In this section comparison of Encryption time
for AES, DES, RSA are presented. In the fig
5.2 x-axis denotes size of the packet and y-axis
denotes time. From view of this comparison
graph encryption time for DES is lesser.

Fig 5.1 Broadcast of Packets

ENCRYPTION
It is the process of transforming the original
data in to cipher text. It makes the data unreadable
by unauthorized users for the purpose of preventing
others from gaining access to its contents.
The results are obtained with ns3 software are
shown below:

DECRYPTION
It is the process of transforming encrypted
data back into plain text. This is a method of unencrypting the data manually using the proper
codes or keys. The time taken for the packet
transmission during decryption by using AES,
DES, RSA are shown below:
II. Decryption
Size
153
196
312
868

AES
1
1.4
1.6
1.8

DES
1.1
1.2
1.3
1.4

RSA
4.9
5.9
5.1
5.1

Fig 5.2 Terminal output

The time taken for the packet transmission during
encryption by using AES, DES, RSA are shown
below:
I. Encryption
Size
153
196
312
868

AES
2.1
3.2
1.4
5.1

DES
6.5
5.4
6.1
5.8

All Rights Reserved 2016 IJORAT

RSA
8.9
11.2
7.8
9.3

Fig. 5.3 Comparison Graph for Decryption

In this section comparison of Decryption time
for AES, DES, RSA are presented. In the fig
5.3 x-axis denotes size of the packet and y-axis
denotes time to decrypt the message send..
From view of this comparison graph as same as
encryption, time taken for DES to decrypt is
lesser.

19

International Journal of Research in Advanced Technology IJORAT

Vol. 1, Issue 6, JUNE 2016

VI. CONCLUSION
As security plays a vital role in wireless sensor
networks, its very important to make the network
to be secure. Hence various cryptographic methods
are used along with various routing protocols. Here
we used the ns3 software to get the simulation
results. In some wireless sensor networks attackers
tends to reduce the throughput by dropping the
packets, and this packet dropping tends to increase
the delay and increase the packet loss in the
network. But throughput plays a vital role in
wireless sensor networks. In order to increase the
throughput, here cryptographic techniques are
included with RSA, AES, DES, MD5 and Public
key cryptography. This technique depends on
database system where cryptographic key
techniques are updated. Hence attacker finds it
difficult to determine the technique. Here we
achieved packet broadcasting with moving sensor
node and routing technique is updated with
database. Thereby secured routing is achieved by
increasing the throughput and packet delivery ratio.

States Keys , The 5th International Conference On

Information Technology,2011.
[10] Xiaoling Zheng, JiDong Jin, Research for the
Application and Safety of MD5 Algorithm in Password
Authentication, 9th International Conference on Fuzzy
Systems and Knowledge Discovery, 2012.

REFERENCES
[1] M. Li, Z. Li, and A. V. Vasilakos, A survey on
topology control in wireless sensor networks: Taxonomy,
comparative study, and open issues, Proc. IEEE, vol.
101, no. 12, pp. 25382557, Dec. 2013.
[2] Nor Surayati Mohamad Usop, Azizol Abdullah,
Ahmad Faisal Amri Abidin, Performance Evaluation

of AODV, DSDV & DSR Routing Protocol in Grid

Environment, IJCSNS International Journal of
Computer Science and Network Security, VOL.9 No.7,
July 2009.
[3] Mr. L Raja 1, Capt. Dr. S Santhosh Baboo2
Comparative study of reactive routing protocol (AODV,
DSR, ABR and TORA) in MANET, in International
Journal Of Engineering And Computer Science
ISSN:2319-7242 Volume 2 Issue 3 March 2013 Page
No. 707-718.
[4] Navjot Kaur and Ashok kumar Comparison and
Analysis of RREQ and RREP for Dynamic Wireless
Network, in Navjot Kaur et al./ Indian Journal of
Computer Science and Engineering (IJCSE) Vol. 2 No. 3
Jun-Jul 2011.
[5] Natasha Dhiman and Mr. Jagtar Singh
Implementation of Zone Routing Protocol using NS2
Simulator, International Journal of Advanced Research
in Computer Science and Software Engineering Volume
3, Issue 10, October 2013.
[6] Xiaofeng Zhang and Lillykutty Jacob, MZRP: An
Extension of the Zone Routing Protocol for Multicasting
in MANETs, Journal Of Information Science And
Engineering 20, 535-551 In 2004.
[7] Kaur, Swinder,Vig and Renu ,Efficient
Implementation of AES Algorithm in FPGA Device, in
Conference on Computational Intelligence and
Multimedia Applications, Nov 2007,pp. 179-187
[8] Alani, M.M.," A DES96 - improved DES security ",
7th International Multi-Conference on Systems, Signals
and Devices, Amman , 27-30 June 2010.
[9] Afaf M. Ali Al- Neaimi, Rehab F. Hassan New
Approach for Modified Blowfish Algorithm Using 4

All Rights Reserved 2016 IJORAT

20