International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 3, Issue 7, July 2013)

MANETs Using Advance DSR Algorithm and Improve the

Secure Transmission
Sivasakthi. S1, Seramannan. S2, S. Rajesh3, S.Thamilselvan4, N. Premkumar5
1,3

AP/ECE, CMS College of Engineering, Namakkal, Tamilnadu, India,

AP/ECE TRP Engineering College, Trichy, Tamilnadu, 4AP/EEE, CMS College of Engineering, Namakkal, Tamilnadu, India,
5
AP/CSE, Kongunadu college of Engineering & Technology, Trichy, Tamilnadu, India

The challenge is for MANET routing protocols to

provide a communication platform that is solid, adaptive
and dynamic in the face of widely fluctuating wireless
channel characteristics and node mobility.
A malicious node drops packets or generates additional
packets solely to disrupt the network performance and
prevent other nodes from accessing any network services (a
denial of service attack). Misbehavior can be divided into
two categories: routing misbehavior (failure to behave in
accordance with a routing protocol) and packet forwarding
misbehavior (failure to correctly forward data packets in
accordance with a data transfer protocol.

Abstract-- In Wireless communications the traffic across a

mobile ad hoc network (MANET) can be highly vulnerable to
security threats. The mobile ad hoc networks are more prone
to suffer from the malicious behaviors than the traditional
wired networks. Therefore, it becomes very much necessary to
pay more attention to the security issues in the mobile ad hoc
networks. For this we are using DSR protocols. This Dynamic
Source Routing protocol (DSR) is a simple and efficient
routing protocol designed specifically for use in multi-hop
wireless ad hoc networks of mobile nodes. The protocol is
composed of the two main mechanisms of "Route Discovery"
and "Route Maintenance". The presence of malicious node
will interrupt the packets and causes unwanted changes. In
order to avoid these problems signature verification is done at
every hop using new algorithm. This algorithm increases the
amount of data received with respect to time and increases the
throughput.

II. ROUTING IN MANET

Routing is defined as the mechanism used in
communications to find a path between two entities. An Ad
hoc routing protocol is a convention or standard that
controls how nodes come to agree which way to route
packets between computing devices in a mobile ad-hoc
network (MANETs). This is represented in the OSI model
as the third layer (called Network). MANETs routing
protocols is classified in to two broad categories and are
Unicast Routing Protocols and Multicast Routing
Protocols.

Keywords-- DSR, Digital Signature, RREQ, RREP

I. INTRODUCTION
1.1 MOBILE AD HOC NETWORK
A mobile ad hoc network (MANET) is a group of
devices or nodes that transmit across a wireless
communication medium. Cooperation of nodes is important
to forward packets on behalf of each other when
destinations are out of their direct wireless transmission
range. There will be no centralized control or network
infrastructure for a MANET to be set up, thus is making its
deployment quick and inexpensive. The nodes ability to
move freely ensures a flexible and versatile dynamic
network topology which is another important feature of a
MANET.
Mobile ad-hoc network (MANET) routing protocols
play a fundamental role in a possible future of ubiquitous
devices. Current MANET commercial applications have
mainly been for military applications or emergency
situations. However, we believe that research into MANET
routing protocols will lay the groundwork for future
wireless sensor networks and wireless plug-n-play devices.

2.1 MULTIPATH ROUTING

Most of the routing protocols for MANETs usually
develop single path between source and destination for a
given flow. When the developed route fails, the sender
would need to discover a new route to the receiver. This
new route discovery will result in additional packet delay
and network overhead. Multipath routing offers an
interesting alternative in terms of link failure robustness
and load balancing. Some algorithms create multiple paths
at path setup time, and use the best of these until it fails,
after which they switch to the second best and so on. The
benefits of multipath routing include optimal paths
utilization; Load balancing, Fault tolerance, higher
aggregate bandwidth.

213

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 3, Issue 7, July 2013)
An ad hoc network is a system of wireless mobile nodes
that dynamically self-organize in arbitrary and temporary
network topologies allowing people and devices to
internetwork without any preexisting communication
infrastructure.
In mobile ad hoc network (MANET), several routing
protocols such as Ad hoc On-demand Distance Vector
(AODV) and Dynamic Source Routing (DSR) can be used.
However, the unreliability of the wireless medium and the
dynamic topology due to nodes mobility or failure result to
frequent communication failures, and high delays for path
reestablishments. So a multipath routing is a very
promising alternative to single path routing as it provides
higher resilience to path breaks alleviates network
congestion through load balancing and reduces end-to-end
delay. Thus the multipath routing can be highly suitable for
multimedia streaming over wireless ad hoc networks.Lou et
al. proposed and investigated Security protocol for reliable
data delivery (SPREAD) scheme, which provides further
protection to the existed data confidentiality service in an
ad hoc network using multipath routing. It aims to protect
secret message from being compromised.

The DSR protocol is designed mainly for mobile ad hoc

networks of up to about two hundred nodes and is designed
to work well even with very high rates of mobility. This
document specifies the operation of the DSR protocol for
routing unicast IPv4 packets.
3.2 ROUTE DISCOVERY

Fig: 3.1 Route discovery

If node A has in his Route Cache a route to the

destination E, this route is immediately used. If not, the
Route Discovery protocol is started:
Node A (initiator) sends a Route Request packet by
flooding the network
If node B has recently seen another Route Request from
the same target or if the address of node B is already listed
in the Route Record, Then node B discards the request!
If node B is the target of the Route Discovery, it returns
a Route Reply to the initiator. The Route Reply contains a
list of the best path from the initiator to the target. When
the initiator receives this Route Reply, it caches this route
in its Route Cache for use in sending subsequent packets to
this destination. Otherwise node B isnt the target and it
forwards the Route Request to his neighbors (except to the
initiator).

III. DSR ROUTING SCHEME

The Dynamic Source Routing protocol (DSR) is a
simple and efficient routing protocol designed specifically
for use in multi-hop wireless ad hoc networks of mobile
nodes. DSR allows the network to be completely selforganizing and self-configuring, without the need for any
existing network infrastructure or administration. The
protocol is composed of the two main mechanisms of
"Route Discovery" and "Route Maintenance", which work
together to allow nodes to discover and maintain routes to
arbitrary destinations in the ad hoc network.

3.3 ROUTE MAINTENANCE

In DSR every node is responsible for confirming that the
next hop in the Source Route receives the packet. Also each
packet is only forwarded once by a node (hop-by-hop
routing). If a packet cant be received by a node, it is
retransmitted up to some maximum number of times until a
confirmation is received from the next hop. Only if
retransmission results then in a failure, a Route Error
message is sent to the initiator that can remove that Source
Route from its Route Cache. So the initiator can check his
Route Cache for another route to the target. If there is no
route in the cache, a Route Request packet is broadcasted.

3.1 WORKING OF DSR

All aspects of the protocol operate entirely on demand,
allowing the routing packet overhead of DSR to scale
automatically to only what is needed to react to changes in
the routes currently in use. The protocol allows multiple
routes to any destination and allows each sender to select
and control the routes used in routing its packets, for
example, for use in load balancing or for increased
robustness. Other advantages of the DSR protocol include
easily guaranteed loop- free routing, operation in networks
containing unidirectional links, use of only "soft state" in
routing, and very rapid recovery when routes in the
network change.

Fig 3. 2Route error

214

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 3, Issue 7, July 2013)
If node C does not receive an acknowledgement from
node D after some number of requests, it returns a
RouteError to the initiator A. As soon as node receives the
Route Error message, it deletes the broken-link-route from
its cache. If A has another route to E, it sends the packet
immediately using this new route. Otherwise the initiator A
is starting the Route Discovery process again.

The data packets sent by S take the following format

(DATA denotes the packet type): NonceS,NymSA,
EkSA(DATA,NS, seqno,EkSD(payload)).Upon receiving
the above message from S, A knows that this message is
for him according to the pseudonym NymSA. After
decryption using the right key, A knows this message is a
data packet and should be forwarded to B according to
route pseudonym NS. Hence he composes and forwards the
following packet to B: NonceA, NymAB, EkAB(DATA,
NA, seqno, EkSD(payload)). The data packet is further
forwarded by other intermediate nodes until it reaches the
destination node D. At the end, the following data packet is
received by D: NonceC,NymCD, EkCD(DATA,NC,
seqno,EkSD(payload)). By looking up in his route table, D
knows himself is the destination of this packet. So he is
able to decrypt the encrypted payload with the session key
kSD.

3.4 TOPOLOGY FORMING

Constructing project design in NS2 should takes place.
In this phase, every node in the ad hoc network
communicates with its direct neighbors within its radio
range for anonymous key establishment. Each node
employs anonymous key establishment to anonymously
construct a set of session keys with each of its neighbors.
IV. ATTACKS IN MANET
The main goal of the security solutions for an Ad Hoc
network is to provide security services, such as
authentication, confidentiality, integrity, anonymity and
availability to mobile users. One distinguishing
characteristic of this network from the security design
perspective is the lack of a clear line of defense. Unlike
wired networks that have dedicated routers, each mobile
node in an ad hoc network may function as a router and
forward packets for other peer nodes. The wireless channel
is accessible to both legitimate network users and malicious
attackers. In such an environment, there is no guarantee
that a path between two nodes would be free of malicious
nodes, which would not comply with the employed
protocol and attempt to harm the network operation. The
security parameter has been added in route request to make
it secure. These attacks can be broadly classified into two
main categories as:
Passive attacks
Active attacks.

4.2.1 NODE COMPROMISE:

Node compromise is easy for the adversary and highly
possible in ad hoc networks, hence it is crucial for a
privacy-preserving routing protocol to withstand security
attacks due to node capture. In this case, privacy
information leakage is unavoidable due to secret exposure,
while our routing protocol can protect user privacy against
serious node compromise. Suppose a node is compromised
by an attacker, his private signing key and ID-based
encryption key are disclosed to the attacker. The attacker
now is able to establish keys with neighboring nodes, but
only the following information can be obtained by the
attacker: 1) the type of a received packet; 2) data/RREP
packets sent to/via the compromised node; 3) headers of
packets relayed by the compromised node; 4) RREQ
packets sent from the compromised nodes neighbors.
The attacker is not able to gain more beyond this
information. From this information, he cannot infer: 1) the
location of the source/destination node; 2) real identities of
source/destination node of the relaying packets; 3)
source/destination node of the RREQ packets. That is, the
privacy leakage due to node compromise is limited within
the compromised nodes neighborhood, and privacy
information like identity and location is still well protected
by DSR. Even if the global attack exploits the
compromised nodes secret credential for a global attack,
DSRs resilience against privacy leakage can still offer
satisfactory protection, due to its per-hop protection of
packets. RREP and data packets are encrypted hop-by-hop,
and onetime nonces and pseudonyms are used to provide
unlinkability and unobtrusive.

4.1 SECLUSION ROUTE DISCOVERY

Constructing project design in NS2 should takes place.
In this phase, every node in the ad hoc network
communicates with its direct neighbors within its radio
range for anonymous key establishment. Each node
employs anonymous key establishment to anonymously
construct a set of session keys with each of its neighbors.
4.2 PROTECTIVE DATA TRANSMISSION
After the source node S successfully finds out a route to
the destination node D, S can start unobtrusive data
transmission under the protection of pseudonyms and keys.
Data packets from S must traverse A, B, and C to reach D.

215

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 3, Issue 7, July 2013)
Only if the RREP or data packets pass through the
compromised node can the attacker know the packet type.
Even if the compromised node happens to be on the route,
as an intermediate node, the attacker has no clue on where
the source node or the destination node is. If the attacker
tries to impersonate as the source node to request a route to
a specific node, the attacker is still not certain where the
destination node is in any case.

Nevertheless, the anonymity feature of DSR allows the

adversary to launch Sybil attacks which are similar to
collusion attacks discussed above. As discussed in the
collusion attack part, DSR is able to count such attacks
effectively.
V. CONCLUSION
In the existing method the signature verification are
verified at the source and destination only. This leads
decreasing of throughput because of malicious node. To
reduce this constrain in this paper a new algorithm is
proposed. In this algorithm malicious nodes are checked
using signature verification in every node. If it finds any
malicious nodes, the traffic will be rerouted through
another path. This algorithm increases the amount of data
received with respect to time and increases the throughput.

4.2.2 COLLUSION ATTACKS:

For the colluding outsiders, privacy information is
perfectly protected with UDSR. As the attacker is unable to
distinguish a meaningful packet from a dummy packet,
DSR can provide complete protection for privacy with an
appropriate traffic padding scheme. Even if the target node
is surrounded by more than one attack node, given the
assumption that no node is totally surrounded by
compromised nodes, the attacker is unable to perceive
anything except some random dummy packets. If
appropriate dummy traffic is injected into the network, the
colluding outsiders cannot gain any privacy information
about the network at all. For the colluding insiders, DSR
still offers unobtrusive as promised. Though information
disclosure is unavoidable for colluding insiders, and the
adversary knows some keys, the information that the
colluding insiders can obtain is largely restricted by our
algorithm. The attackers are able to know: 1) a target node
is involved in a route discovery procedure since it is
broadcasting a RREQ packet; 2) a target node is the
previous hop or the next hop on a path. However, the
colluding insiders are not able to know identity of the target
node or other intermediate nodes on route. According to the
design of DSR, authentication and key establishment is
achieved by group signature, which perfectly protects user
identity from disclosure. Consequently, unobtrusive is
guaranteed by DSR under colluding insider attacks
according to the definition of unobtrusive.

REFERENCES
Ashanti Kush,Jinshong Hwang.C, (2009) Proposed Protocol for
Secured Routing in Ad hoc networks ,IEEE Spring Conference ,
pp. 76-81.
[2] Young Fang,(2009) Securing Resource Constrained Wireless Ad
Hoc Networks , IEEE Wireless Communications, pp. 24-29.
[3] Farads Farnoud (Hassanzadeh) and Shahrokh
Valaee,(2009),
Reliable Broadcast of Safety Messages in Vehicular Ad Hoc
Networks, IEEE Infocom. pp. 226-234.
[4] Bo Rong, Hsiao-Hwa Chen, (2009), A Pyramidal Security Model
for Large-Scale Group-Oriented in Mobile Ad Hoc Networks: The
Key Study, IEEE Transactions on Vehicular Technology, pp. 398408.
[5] Jie Liu, Richard Yu.F, (2009), Optimal Combined Intrusion
Detection and Biometric-Based Continuous Authentication in High
Security Mobile Ad Hoc Networks, IEEE Transactions on Wireless
Communications, pp. 806-815.
[6] Qingfeng Feng,,Xiaozhong Liu,Yougbo Yu, (2008), A Secure
Standby Route Mechanism For Ad Hoc Networks, IEEE
International Conference on Communication Proceedings pp. 77-80.
[7] Bin Xie, Anup Kumar Srinivasan.S., (2006), GMSP: A Generalized
Multi-hop Security Protocol for Heterogeneous Multi-hop Wireless
Network, IEEE, pp. 634-639.
[8] Kaveh pahlavan and Prashant Krishnamurthy (2002), Principles of
Wireless Networks a unified approach.
[9] P. Papadimitratos and Z. J. Haas, Secure link state routing for
mobile ad hoc networks, in Proc. IEEE CS Workshop on Security
and Assurance in ad hoc Netw., Orlando, FL, Jan. 2003, pp. 379
383.
[10] of frequently changing network topologies, IEEE Trans. Wireless
Communication., vol. 3, no. 2, pp. 500511, Mar. 2004.
[11] J. R. Douceur, The Sybil attack, In First International Workshop on
Peer-to-Peer Systems (IPTPS 02), American Mathematical Society,
March 2002.
[1]

4.2.3 SYBIL ATTACKS:

In the Sybil attack a single node presents multiple fake
identities to other nodes in the network. Sybil attacks pose
a great threat to decentralized systems like peer-to-peer
networks and geographic routing protocols. In DSR, the
centralized key server generates group signature signing
keys and ID-based keys for network nodes. Thus, it is
impossible for the adversary to obtain other valid identities
except the compromised ones.

216