www.ijecs.in
International Journal Of Engineering And Computer Science ISSN: 2319-7242
Volume 4 Issue 11 Nov 2015, Page No. 15024-15029
Detection of Black Hole Attack in DTN with Authentication
D.Humera1, M.VeereshBabu2
#1
M.Tech Departmentof CSE, MITS, Madanapalli&JNTUAIndia
Assistant Professor Departmentof CSE,MITS,Madanapalli&JNTUAIndia
1
shaikhume9@gmail.com
2
veereshbabu@mits.ac.in
#2
Abstract: DTN such as sensor networks with schedule occurring at irregular intervals and the packets transferring
will be referred to as store–carry-forward technique. Here the routing is decided with characterized by opportunity.
These nodes will be acts like malicious node. Here the malicious behaviour can be occurred due to the attacker/hacker
who leads to lose of data and increases remission delay, to overcome this problem we are using the SERVICE
PROVIDER term which provides the services to the senders and the receivers with confidentially. By using the
Vehicular Algorithm, we can detect Black Hole Attack and we can improve the security and the authentication to our
data and it chooses the shortest path to transfer the data from sender to receiver, if the chosen path can have the
malicious node then immediately router skip to another path which is nearer to it.
Keywords- DTN, Cloud Security, Service Provider
I.
Introduction
DTN, for instance, sensor frameworks with
timetable occurrence at sporadic breaks accessibility
and the packs trading will be insinuated as the store
–carry-forward methodology and the coordinating is
picked with depicted by condition in the framework
these centre points will be acts like harmful by
losing packages purposefully despite when it can
sending the data confidentially. Here the threatening
behaviour can be happened in light of the
attacker/software engineer which prompts the free of
data and manufactures transmission deferment, to
vanquish this issue we use the SERVICE
PROVIDER term which gives the organizations to
the switch and the recipients with private.
Directing inconvenience making can be realized by
infantile (or sensible) centre points that endeavour to
expand their own specific preferences by getting a
charge out of the organizations gave by DTN while
declining to forward the gatherings for others, or
pernicious centre points that drop packages or
changing the groups to dispatch attacks. The late
investigates exhibit that coordinating awful lead will
basically lessen the group movement rate and, in like
manner, speak to a honest to goodness threat against
the framework execution of DTN [4], [6]. Therefore,
a fiendishness disclosure and help tradition is
significantly appealing to ensure the secured DTN
coordinating and also the trust's establishment
among DTN centre points in DTNs. Lightening
coordinating inconvenience making has been all
around focused on in standard flexible
extraordinarily selected systems. These works use
neighbourhood checking or destination confirmation
to perceive package dropping [7], and attempt creditbased and reputation based rousing power
arrangements to engage sensible centre points or
denial arrangements to deny vindictive centres [4],
[8].
This can be outlined by Fig. 1, in which a narrow
minded hub B gets the bundles from hub A yet
dispatches the dark gap assault by declining to
forward the parcels to the following jump recipient
C [9]. Since there may be no neighbouring hubs
right now that B meets C, the mischief (e.g.,
dropping messages) can't be distinguished because
of absence of witness, which renders the checking
D.Humera1, IJECS Volume 04 Issue 11 November, 2015 Page No.15023-15028
Page 15024
DOI: 10.18535/Ijecs/v4i11.28
based bad conduct identification less reasonable in
an inadequate DTN.
Message
of absence of witness, which renders the checking
Drop away
based bad conduct identification less reasonable in
an inadequate DTN. As of late, there are truly a
couple of recommendations for is behaviours
B
recognition in DTNs [4], [8], [9], [10], a large
portion of which depend on sending history
confirmation (e.g., multilayered credit [4], [8], threeMessag
jump criticism instrument [10], or experience ticket
e
[6], [9]), which are exorbitant regarding transmission
c
overhead and check cost.
cloud computing is regularly characterized as a sort
of figuring that depends on sharing registering assets
Fig.1: Shows the drop away message from DTN
other than having neighbourhood servers or
This can be outlined by Fig. 1, in which a narrow individual gadgets to handle applications. Cloud
minded hub B gets the bundles from hub A yet registering uses systems of vast gatherings of servers
dispatches the dark gap assault by declining to commonly running minimal effort buyer pc
forward the parcels to the following jump recipient innovation with particular associations with spread
C [9]. Since there may be no neighbouring hubs information preparing tasks crosswise over them.
right now that B meets C, the mischief (e.g.,
dropping messages) can't be distinguished because
II.
Related Work
is much more viable than existing systems our
Cloud computing gives three administrations that are outcomes show the proposed plan gives high
infrastructure as an administration, plat structure as information accessibility and bundle conveyance
an administration and software as a service. Our proportion with low idleness in dtns under enemy
principle target in this paper is to add to a strong assaults. in this present reality, in any case, the vast
trust system and a proficient and ease vindictive hub majority are socially selfish; i.e., they are willing to
identification procedure for dtns. Roused by our late forward parcels for hubs with whom they have social
results on notoriety administration for online ties however not others, and such ability differs with
frameworks and e-trade, we added to an iterative the social's quality tie . Here in this paper it takes
pernicious hub discovery component for dtns which
after the Store and Forward method.
III.
Proposed Work
In Delay Tolerant Networks despite the fact Disadvantages in the existing system:
that every one of the hubs are having quality to Following are the major disadvantages in the
exchange the information however with the existing system:
disnature of hub it can't exchange to destination. In
the transmission of an information deliberately the
 It takes lots of time to transmit the data and
dark gap assault is struck drop the information of
we didn’t have a guarantee that it transfers to
course we need to distinguish it after that we need to
destination node.
retransmit the information. For this issue we utilize
the store and forward method to exchange the
 Here the major problem is to detect the black
information, it serves to estimate the way of our
node.
bundle which is prepared to exchange.
IV.
Proposed Solution
We are proposing the Vehicular calculation
alongside the I Trust theory. The fundamental
D.Humera1, IJECS Volume 04 Issue 11 November, 2015 Page No.15024-15029
Page 15025
DOI: 10.18535/Ijecs/v4i11.28
thought is to propose this framework to give trust
administration which is utilized to deal with the way
before it begins transmission. Another highlight
which is included this framework is to give an
evaluation directing.
methodologies. In an immaculate shared DTN, the
sending history could be sent to some exceptional
framework sections (e.g., roadside unit (RSU) in
vehicular DTNs or judge nodes in [10]) by means of
DTN transmission. In some half and half DTN
system environment, the transmission in the middle
In this paper, we embrace the framework model like of TA and every hub could be additionally
[4]. We consider a typical DTN comprised of cell performed in an immediate transmission way (e.g.,
phones possessed by individual clients. Every hub i WIMAX or cell systems [14]). We contend that in
is accepted to have an exceptional ID Ni and a light of the fact that the trouble making identification
relating open/private key pair. We accept that every is
performed
intermittently;
the
message
hub must pay a store C before it joins the system, transmission could be reformed in a clump model,
and the store will be paid back after the hub leaves if which could further diminish the transmission
there is no trouble making movement of the hub. overhead.
Like [13], we accept that an occasionally accessible Advantages:
 It gives the high security.
TA exists so that it could assume the liability of
misconduct recognition in DTN. For a particular
 Decreases the work over head.
location target Ni, TA will demand Ni's sending
 It improves the reliability and efficiency.
history in the worldwide system. In this manner,
 Provides authentication in routing
every hub will present its gathered Ni's sending
management.
history to TA by means of two conceivable
V.
Model
The primary target of this proposed work is to
diminish the postponement rate in transmission.
Systems administration is one of the speediest
executing advancement in the decade. We Focus in
this paper essentially is to diminish the overhead and
to expand the unwavering quality, efficiency. This
procedure comprises of two sections.
 Vehicular Model
 Routing Model
Vehicular Algorithm:
 Set N to Number of copies for relay message
 Set L to Number of bus routes
 While (messages Hop Count<=L)
 Do Routing Strategies in cars: If(encountered
Node=BUS)and(encountered Node paths
contains destination location)
 Do Forward message to encountered Node
Else Do Forwarding message randomly to N
node. If (encountered Node=BUS) and
(encountered Node paths contains destination
location)
 Do Forward message to encountered Node
Else if (encountered Node=RSU)
 Do Fetch RSU messages that can be
delivered to destination by BUS Else Do
Forwarding messages randomly to N node.
information sender out of destination hub's
correspondence reach can just transmit packetized
We embrace the single-duplicate steering information by means of an arrangement of
system, for example, First Contact directing moderate hubs in a multi hop way. Our getting out of
convention, and we expect the correspondence scope hand discovery plan can be connected to designation
of a versatile hub is limited. In this manner, an
VI. Architecture
D.Humera1, IJECS Volume 04 Issue 11 November, 2015 Page No.15024-15029
Page 15026
DOI: 10.18535/Ijecs/v4i11.28
based steering conventions or multi copy-based
directing ones, for example, Max Prop and Pro
PHET. We expect that the system is approximately
synchronized (i.e., any two hubs ought to be in the
same time space whenever).
Above all else, we expect that every hub in the
systems is sane and a sane's hub will likely amplify
its own benefit. In this work, we basically consider
two sorts of DTN hubs: narrow minded hubs and
pernicious hubs. Because of the egotistical nature
and vitality devouring, childish hubs are not ready to
forward packs for others without adequate prize.
Fig: PEER-1
Fig6: Architecture
VI.
Screenshots Of Application:
Fig: Saving Text
D.Humera1, IJECS Volume 04 Issue 11 November, 2015 Page No.15024-15029
Page 15027
DOI: 10.18535/Ijecs/v4i11.28
Fig: PEER-3
Fig: Select Text
Fig: Selecting Sender Peer
VII.
Experimental Results
8
6
14
12
10
8
6
4
2
0
1
3
4
2
2
3
2
1
0
1
2
3
4
Fig: Graph Shows Rate of Data Authentication
1
2
3
4
Fig: Graph Shows Detection of Malicious Node
VIII. Conclusion
In this paper, we propose a Vehicular
Algorithm which gives predictability advantage of
node’s movement in DTN,public transportation
systems was used to introduce the proposed
algorithm. Later, simulation and comparison results
demonstrated acceptable efficiency of the proposed
algorithm and importance of using public
transportation
systems.
References:
D.Humera1, IJECS Volume 04 Issue 11 November, 2015 Page No.15024-15029
Page 15028
DOI: 10.18535/Ijecs/v4i11.28
[1] H. Zhu, X. Lin, R. Lu, P.-H. Ho, and X. Shen, “SLAB:
SecureLocalized Authentication and Billing Scheme for
Wireless MeshNetworks,” IEEE Trans. Wireless Comm., vol.
17, no. 10, pp. 3858-3868, Oct. 2008.
[2] Q. Li and G. Cao, “Mitigating Routing Misbehavior in
DisruptionTolerant Networks,” IEEE Trans. Information
Forensics and Security,vol. 7, no. 2, pp. 664-675, Apr. 2012.
[3] S. Marti, T.J. Giuli, K. Lai, and M. Baker, “Mitigating
RoutingMisbehavior in Mobile Ad Hoc Networks,” Proc.
ACMMobiCom ’00, 2000.
[4] R. Lu, X. Lin, H. Zhu, and X. Shen, “Pi: A Practical
IncentiveProtocol for Delay Tolerant Networks,” IEEE Trans.
WirelessComm., vol. 9, no. 4, pp. 1483-1493, Apr. 2010.
[5] F. Li, A. Srinivasan, and J. Wu, “Thwarting Blackhole
Attacks inDisruption-Tolerant Networks Using Encounter
Tickets,” Proc.IEEE INFOCOM ’09, 2009.
[6] E. Ayday, H. Lee, and F. Fekri, “Trust Management and
Adversary Detection for Delay-Tolerant Networks,” Proc.
MilitaryComm. Conf. (Milcom ’10), 2010.
[7] D. Fudenberg and J. Tirole, Game Theory. MIT Press,
1991.
[8] M. Rayay, M.H. Manshaeiy, M. Flegyhziz, and J.
Hubauxy,“Revocation Games in Ephemeral Networks,” Proc.
15th ACMConf. Computer and Comm. Security (CCS ’08),
2008.
D.Humera1, IJECS Volume 04 Issue 11 November, 2015 Page No.15024-15029
Page 15029