ISSN:2229-6093

Sudha Panwar et al, International Journal of Computer Technology & Applications,Vol 8(2),185-189

Survey on Wireless Sensor Network Protocol to Solve Rushing Attack

Sudha Panwar1 , Sunil Malviya2
1
M.Tech Scholar, CSE Dept., Sagar Institute of Research & Technology, Bhopal
sudhapawar37@gmail.com
2
Assistant Professor, CSE Dept., Sagar Institute of Research & Technology, Bhopal
Sunilmalviya0104@gmail.com

Abstract

Wireless sensor network (WSNs) is network formed by
a huge amount of sensor nodes which is furnished with
a sensor to explore physical incident, such as light,
heat, sound, pressure, etc. and to communally transfer
their data by the network in the direction of main
location. For sensor nodes, the factors that required to
be worked upon are limited energy and memory.
Wireless sensor networks are required to deliver
communication with security necessities like
confidentiality, reliability and accessibility. The intent
of this paper is to analyze five WSNs protocols DSR,
SDSR, SAODV, ARAN and Trust Oriented Secure
AODV against Rushing attack in wireless sensor
network. This paper concentrates estimate the
performance of WSNs protocols when Rushing attacks
involve in wireless network
Index Terms— Wireless sensor network (WSNs),
DoS Attack. Rushing Attack, Routing Protocol.
battery, radio transceiver with an interior antenna or
connection in the direction of an external antenna, an
electronic circuit for interfacing with the sensors and an
power source, a microcontroller frequently or
an embedded form of power harvesting. When
batteries get empty, in this condition a node becomes
out of service and network performance is degraded.
Thus, energy efficiency is most important factor in a
protocol design for multi-hop networks like WSNs.
This had strong influence on the protocols design.
There are many application of WSNs like Area
observing, Health care observing , Environmental
sensing, Air pollution observing, Forest fire detection,
Landslide ascertain e, Water quality observing , Natural
disaster preclusion, Data logging and Structural
condition observing.

1. Introduction

A Wireless sensor network (WSNs) [1] consists of

various detection node called sensor nodes, each of
which is low cost, small, slight and convenient. The
entire sensor node is equipped with a microcomputer,
transducer, transceiver and energy source. In (WSNs)
few nodes are known as source nodes which explore
the event in the environment e.g. variation in
temperature, pressure, any signal etc. Whereas, some
another special kind of nodes that collect information
about these events from every nodes. These types of
nodes are called sink or base station (BS). The main
task of sensor networks is to sense the events, collect
data and send it to their requested destination Due to
their broadcast Transmission, unattended nature and Fig. 1: Architecture of Sensor Node
unfriendly environmental situation, the WSN nodes are
vulnerable to numerous Denial of Service’ (DoS) In this network, sensor nodes are respondsible for the
attacks[1]. In this networks sensor nodes are information exchange.
responsible for the information exchange. all sensor
network node has usually a variety of parts like The main aim of DoS attacks is is to disturb the routing
and interrupt data generated from the source nodes to

IJCTA | Mar-Apr 2017 185

Available online@www.ijcta.com
 ISSN:2229-6093

Sudha Panwar et al, International Journal of Computer Technology & Applications,Vol 8(2),185-189

reach the sink or target nodes. A few well known DoS

attacks are Hello Flood, Sink hole, Wormhole, INA,
Black hole, Rushing Attack, gray hole, jamming, node
replication etc. Our main focus on Rushing attack and
its prevention protocol.

2. Some important characteristics of WSN

• In WSN Power consumption constraints for all

node using batteries or energy harvesting.
• WSN have ability to manage with node
failures. Fig. 3 Cluster Tree Topology

• WSN have Ability to withstand rigid 3.3 Mesh Topology

environmental situation. Mesh networks feature nodes that can connect to
numerous nodes inside the system and pass data
• Scalability to large scale of expansion. through the most reliable path obtainable. This mesh
• It is ease to use. link is often referred to like as a router (see Figure 4).

3. Some wireless sensor network topology that

use commonly.

3.1 Star Topology

Star topology is the one most essential or basic
topology. In star topology every node are linked in the
direction of the gateway node. Gateway node is also
called protocol converters. It can activate at any
network layer. The basic diagram of star topology is
shown in fig. The black node is gateway node and blue
node is simple network node.

Fig .4 Mesh Topology

Fig .2 Star Topology
3.2 Cluster Tree Topology
Cluster tree network topology is a topology in which
each and every node attach to a higher node in the tree
and then linked to the gateway node, and data is routed
from the lowest node on the tree to the gateway node.
Lastly, it increases the reliability of network.
4. Rushing Attack
Rushing attack, which outcome in denial of services
when used against all earlier published on-demand ad-
hoc network routing protocol [2]. Rushing attack
exploits this doublet suppression mechanism by
speedily forwarding route discovery packet in order to
avail reach to the forwarding group. When a sender
node send a route request (RREQ) packet to other node
in the wireless sensor network, if there an attacker
present then he will admit the RREQ and transmit to
his neighbour with high transmission speed as
compared to other original nodes, which are extant in
the wireless sensor network. Due to this high

IJCTA | Mar-Apr 2017 186

Available online@www.ijcta.com
 ISSN:2229-6093

Sudha Panwar et al, International Journal of Computer Technology & Applications,Vol 8(2),185-189

transmission speed, packet forwarded by the attacker

will first reach to the target node. Destination node will
accept this RREQ and leave other RREQ which are
arriving later. Receiver found this route as a valid route
and use for further communication. This manner
attacker will successfully avail access in the
communication between sender and receiver. The
attacker in WSNs can be occurring anywhere in the
network like as follows:

4.1 Attacker at near sender

In fig. no. 2, S is a sender node and R is receiver node
and A is the attacker node B, C, D and E is the
intermediate nodes. Source node S send packet to the
node A and node D. attacker node A forward the packet
to the receiver more quickly then node D. Receiver
discard letter receive packet.
Fig. 6 Attacker at near receiver
4.3 when Attacker anyplace in the network
In fig. no.4, attacker node A is at anyplace in the
network. S sends RREQ to B, C and D. Attacker A
acquire the RREQ from B, and transmit the RREQ to
its neighbour F. Here, attacker node A gets RREQ from
some intermediate nodes and it has to also forward that
requests to some other intermediate nodes. In this the
chance of reaching the RREQ forwarded by attacker
depends on the middle nodes between attacker and
destination node. In this situation the attack success
rate is little [11].

Fig. 5 Attacker at near sender

4.2 Attacker at near receiver

In fig.3 attacker node A is at close to receiver. S send

RREQ to neighbours B and D. Attacker A accept the
request packet RREQ from B.B is neighbour of them.
But it forwards the RREQ packet which came earlier.
Here, attacker A forwards RREQ packet quickly
compared to C & E. So RREQ from A will reach the Fig. 7 Attacker anyplace in the network
destination D first. Thus route will be discovered by
attacker A. In this situation attacker A can directly 5. Some WSNs Routing protocol
forward RREQ to destination node with no any
5.1 Dynamic Source Routing Protocol
intermediate nodes. At this point, attacker A gets the
REQUESTs from most of node. In this situation the The DSR routing protocol utilized a source routing. In
attack success rate is high [11]. source routing the sender node knows hop-by-hop route
in the path of the destination node. These routes are
formerly stored in a route cache.When a sender node in
the wireless sensor network try to send a data packet to

IJCTA | Mar-Apr 2017 187

Available online@www.ijcta.com

Sudha Panwar et al, International Journal of Computer Technology & Applications,Vol 8(2),185-189
a destination node for which it does not beforehand
know the route, it uses a route discovery works
throughout flooding the network with route request
(RREQ) [1]. Every node rebroadcast the received
RREQ in entire network after that node responding to
the RREQ with a RREP packet that is routed back to
the unique source node. The RREQ build up the path
traversed transversely the network. The RREP itself
reverse to the source node through traversing this path
to the destination. The route passed back by the RREP
packet is cached at the source for future use [1].
5.2 SDSR (Secure Dynamic Source Routing)
protocol
In the extant protocols, since each and every node
forwards only the first received route request, the
rushing attacker tries to forward the first received
request to its neighbors. In this protocol change this
property to overcome this Attack. This protocol every
node doesn't forward the first receive route request
(RREQ). Instead it waits for some amount of time
(which is proportional to its distance from the source);
gathers the all request through different nodes and
randomly choose a request to forward. By doing so, the
probability that the request selected to forward by the
attacker is reduced. Since every node attacker, the other
successive nodes might discard it and the probability
that the route through the attacker is nearly zero [1].
5.3 Secure Adhoc on Demand distance Vector
(SAODV) routing protocol
SAODV is a safe extension for AODV. The SAODV
concentrate on security necessities like integrity,
affirmativeness and authentication. The Secure AODV
routing method is based on the imagination that each
and every node hold established public keys for all
network nodes. The inventors of the routing manage
packet add a RSA signature with the last constituent of
a hash chain to the routing packets. A packet
transversal the network, reasonable nodes
cryptographically verify the signature and its hash
value. The moderate nodes originate the kth element of
the hash chain, with k being the number of transverse
hops, and place it in packet. The SAODV routing
protocol provide two option for RREQ and RREP. In
the first condition when a Route Request is sent, the
IJCTA | Mar-Apr 2017
Available online@www.ijcta.com
ISSN:2229-6093
sender generates a signature and attaches it to packet.
Moderate nodes validate the signature earlier than
creating or updating the reverse route to the host. The
converse route is stored only when the signature is
verified. When the node reaches the destination, the
node signs the Route Reply with its private key and
sends it back. The Moderate nodes again verify the
signature .The signature of the sender is again stored
with the along route entry.
5.4 Trust Oriented Secure AODV Routing Protocol
Trust becomes a passable approach to provide security
in a distributed way for mobile ad-hoc network. A
system is based on path repute and trust value, is
proposed to magnify network Trust Oriented Secure
AODV Routing Protocol throughput and reliability of
discovered route. In this protocol trust value is
incremented and decremented according to positive and
negative observations. An integrated trust management
model is introduced to select trustworthy service by
quantification of trust on platform of context-aware
service. This model, addresses a basic set of trust
aspects related to identity provisioning, confidentiality
enforcement, and context provisioning activities [3].
Using trust conception AODV is secured by numerous
proposed approaches. Trust-based SAODV is projected
on the base of intrusion detection mechanism (IDM)
and trust-based mechanism (TBM) to penalize self-
centered nodes in AODV. If signature is to be verified,
node reaches the destination node and ciphers the
Route Reply with its private key and sends it back. The
Moderate nodes once more validate the signature .The
signature of the sender is once more stored with the
along route entry.
5.5 Authenticated Routing Protocol (ARAN)
Authenticated Routing protocol for mobile Ad hoc
Networks uses asymmetric cryptography key pairs such
as SAODV via the signed public keys which are
available to all the nodes in the network [5]. In ARAN
protocol, all nodes that farther the packets have to sign
it and examine the signatures which intercede all
routing data. As the route discovery in the ARAN
protocol does not endorsement a TTL meadow or a hop
count, there will not be any changeable parts in the
packet and the stationary signatures are measure
188
 ISSN:2229-6093

Sudha Panwar et al, International Journal of Computer Technology & Applications,Vol 8(2),185-189

enough [5]. However, it was noted that the overhead in [8]. De Rango, F., Marano, S.: Trust-based SAODV
the network is large because of the flooding of the route Protocol with Intrusion Detection and Incentive
discovery packets are incapable to be controlled. In Cooperation in MANET. In: IWCMC 2009,
addition, with ARAN, the problem of route lengthening Leipzig, Germany (2009).
is feasible. [9]. Yi-Chun Hu, Adrian Perrig, David B. Johnson
"Rushing Attacks and Defense in Wireless Ad Hoc
6. CONCLUSION Network Routing Protocols", WiSe 2003,
In this paper, we introduce the WSNs and its September 19, 2003, San Diego, California, USA.
characteristics. Rushing attack and analysis of its [10]. H. Deng, W. Li, and Dharma P. Agrawal,
routing protocols with in WSNs. This papers us "Routing Security in Ad Hoc Networks, "IEEE
relevant the Rushing attack, and different defence Communications Magazine, Special Topics on
schemes proposed by many scholars. In future, we Secuity in Telecommunication Networks, October
present some other WSNs routing protocol to solve 2002.
Rushing Attack. [11]. V. PALANISAMY, P.ANNADURAI,
“Impact of Rushing attack on Multicast in Mobile
REFERENCES Ad Hoc Network”, International Journal of
[1]. Akhil Dubey, Deepak Meena, Shaili Gaur” A Computer Science and Information Security, Vol.
Survey in Hello Flood Attack in Wireless Sensor 4, No. 1 & 2, 2009.
Networks” International Journal of Engineering [12]. P.Parthiban, G.Sundararaj “Optimal Location
Research & Technology (IJERT) Vol. 3 Issue 1, of Base Station in a Wireless Sensor Network
January – 2014 ISSN: Using Gravity Location Model” International
[2]. S. Albert Rabara1 and S.Vijayalakshmi2, “Rushing Journal Of Engineering And Computer Science
Attack Mitigation In Multicast MANET (RAM3)”, ISSN:2319 – 7242 Volume 2 Issue 11 November ,
International Journal of Research and Reviews in 2013.
Computer Science (IJRRCS), Vol. 1, No. 4,
December 2010. 2278-0181
[3]. Swarnali Hazra and S.K. Setua “Trust Oriented
Secured AODV Routing Protocol” © Springer-
Verlag Berlin Heidelberg 2012.
[4]. Amrit Suman, Praneet Saurabh, Bhupendra Verma
“A Behavioral Study of Wormhole Attack in
Routing for MANET”, International Journal of
Computer Applications (0975 – 8887) Volume 26–
No.10, July 2011.
[5]. Aakanksha Jain1, Samidha Dwivedi Sharma2 “An
Efficient Rushing Attack Prevention Algorithm for
MANET Using Random Route Selection”
International Journal of Science and Research
(IJSR), Volume 3 Issue 6, June 2014.
[6]. Capkun, S., J. Hubaux, and L. Buttyan, “Mobility
helps peer-to-peer security”. IEEE Transactions on
Mobile Computing, 2006.
[7]. Xiu, D., Liu, Z.: A Formal Definition for Trust in
Distributed Systems. In: Zhou, J., López, J., Deng,
R.H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650,
pp. 482–489. Springer, Heidelberg (2005).

IJCTA | Mar-Apr 2017 189

Available online@www.ijcta.com