International Journal of Engineering and Technical Research (IJETR)
ISSN: 2321-0869 (O) 2454-4698 (P), Volume-5, Issue-2, June 2016
An Efficient Technique to Find out Origin Fraudulence
and Packet Discard Attacks in Sensor Network
Shreevalli P, H P Mohan Kumar
Abstract The principal issues in network are secured and
effective transmission of information.
Remote sensor system is the foundation of numerous basic
frameworks like environmental monitoring checking, climate
estimating and so forth. They get and prepare the data from
various hubs that consolidated to frame information which is
utilized for basic leadership as a part of basic frameworks. Amid
this procedure the hub on the way of the data might be malicious
and causes issues like-Data Inconsistency, it might change the
contents, It may dispose of the packet as opposed to depending it
to further hub. It might bring about fraudulence of origin of
information. To avoid these obstacles we plan an effective model
for provenance validation at the base station and to discover
packet dispose of assaults in wireless sensor network (WSN).
Index Terms Provenance, origin fraudulence, Packet
discard attacks, Sensor systems, Base station (BS)
I. INTRODUCTION
Sensor systems are utilized as a part of various application
areas, for example, cyber physical base frameworks,
ecological observing, power frameworks, and so forth. Data
are delivered at an extensive number of sensor hub sources
and to form useful information which helps in taking
decisions in system. The differing qualities of sources make
the need to guarantee the reliability of information, such that
lone reliable data is considered in the choice procedure.
Provenance is a powerful technique to evaluate information
reliability, since it condenses the history of possession and the
activities performed on the data. Late research [1] highlighted
the key commitment of provenance in frameworks where the
the utilization of deceitful information may prompt disastrous
disappointments (e.g., SCADA frameworks). Despite the fact
that provenance Demonstrating, accumulation, and
questioning have been concentrated widely for work
processes and curated databases[2][3],provenance in sensor
systems has not been legitimately tended to. We explore the
issue of secure and productive provenance transmission and
preparing for sensor systems, and we utilize provenance to
recognize packet discard attack organized by noxious sensor
hubs.
In a multi-hop sensor system, data provenance permits
the BS to follow the source and sending way of an singular
data packet. Provenance must be recorded for every packet,
except essential difficulties emerge because of the tight
capacity, vitality and transfer speed limitations of sensor
hubs. Along these lines, it is important to devise a light-weight
provenance arrangement with low overhead. Besides, sensors
frequently work in an entrust domain, where they might be
Shreevalli P, MCA, PES College of Engineering, Mandya, India.
H P MohanKumar, MCA ,PES College of Engineering, Mandya, India
55
subject to assaults. Henceforth, it is important to address
security necessities, for example, privacy, trustworthiness and
freshness of provenance. We will likely plan a provenance
encoding also, decoding system that fulfills such security and
execution needs. We propose a provenance encoding
procedure whereby every hub on the way of a data packet
safely implants provenance information inside a Bloom filter
that is transmitted alongside the data. After getting the
packets, the BS separates and checks the provenance data. We
additionally devise an expansion of the provenance encoding
plot that permits the BS to distinguish if a packet discard
assault was organized by a malicious hub. Instead of existing
examination that utilizes separate transmission channels for
information and provenance [4], we as it were require a
solitary channel for both. Besides, conventional provenance
security arrangements utilize seriously cryptography
furthermore, advanced marks , and they utilize affix based
information structures to store provenance, prompting
restrictive costs. Conversely, we utilize just quick Message
Authentication Code (MAC) plans and Bloom filters (BF),
which are altered size information structures that minimalistic
ally speak to provenance. Bloom filters make proficient use
of transfer speed, also, they yield low mistake rates by and by.
II. RELATED WORK
ExSPAN [5] depicts the history and inductions of system
express that outcome from the execution of a circulated
convention. This framework additionally does not address
security concerns and is particular to some system use cases.
SNP [6] stretches out system provenance to antagonistic
situations. Since these frameworks are broadly useful system
provenance frameworks, they are not enhanced for the asset
compelled sensor systems. Hasan et al. [7] propose a chain
model of provenance and guarantee respectability and secrecy
through encryption, checksum and incremental affixed mark
component. Syalim et al. [8] broaden this strategy by applying
advanced marks to a DAG model of provenance. Be that as it
may, these nonexclusive arrangements don't know about the
sensor system particular suppositions, requirements and so
forth. Since provenance has a tendency to develop quick,
transmission of a lot of provenance data alongside
information will acquire huge transfer speed overhead, thus
low productivity and versatility. Vijaykumar et al. [9] propose
an application particular framework for close constant
provenance accumulation in information streams. All things
considered, this framework follows the wellspring of a stream
long after the procedure has finished. Nearer to our work,
Chong et al. [10] install the provenance of information source
inside the dataset. While it mirrors the significance of issues
we tended to, it is not proposed as a security instrument, thus,
does not manage noxious assaults. In addition, reasonable
issues like versatility, information corruption, and so forth
have not been all around tended to. For secure transmission of
www.erpublication.org
 An Efficient Technique to Find out Origin Fraudulence and Packet Discard Attacks in Sensor Network
the provenance requires a few unmistakable packet
transmissions. The basic supposition is that provenance
continues as before for no less than a stream of packets. Our
work surrenders that supposition. While BFs are regularly
utilized as a part of systems administration applications,
iBFs(in-packet bloom filter) have just as of late increased
more consideration being used in applications. The essential
thought in these works is to encode the connection identifiers
constituent to the bundle directing way into an iBF.
Nonetheless, the encoding of the entire way is performed by
the information source, though the middle of the road
switches check their enrollment in the iBF and forward the
bundle further in light of this choice. This methodology is
infeasible for sensor systems where the ways may change
because of a few reasons. Also, a middle of the road switch
just checks its own particular enrollment which may leave a
few honesty assaults, for example, each of the one assault,
irregular piece flips and so on., undetected. Our methodology
determines these issues by encoding the provenance in an
appropriated style
III. OVERVIEW OF PROPOSED SYSTEM
A. Provenance Encoding
For a data packet, provenance encoding alludes to producing
the vertices in the provenance chart and embeddings them into
the iBF. Every vertex begins at a hub in the information way
also, speaks to the provenance record of the host hub. A
vertex is exceptionally distinguished by the vertex ID (VID).
The VID is created per-packet in light of the packet sequence
number (seq) and the mystery key Ki of the host hub. We
utilize a piece figure capacity to deliver this VID in a
protected way. In this way for a given information parcel, the
VID of a vertex speaking to the hub ni is registered as vidi =
generateVID(ni, seq) = EKi (seq) where E is a safe piece
figure, for example, AES, and so forth.
At the point when a source hub produces a packet, it
additionally makes a BF (alluded to as ibf0), introduced to 0.
The source then produces a vertex embeds the VID into ibf0
and transmits the BF as a part of the parcel. After getting the
packet, every moderate hub nj performs data and also
provenance collection. On the off chance that nj gets
information from a solitary child nj1, it totals the halfway
provenance contained in the bundle with its own provenance
record. For this situation, the iBF ibfj1 having a place to the
got parcel speaks to a fractional provenance, i.e., the
provenance diagram of the sub-way from the source
youngster, it produces a totaled provenance from its own
provenance record and the incomplete provenance got from
its tyke hubs. At to start with, nj figures a BF ibfj1 by
bitwise-ORing the iBFs from its kids. ibfj1 speaks to a
halfway accumulated provenance from the majority of the
youngsters. In either case, a definitive accumulated
provenance is produced by encoding the provenance record of
nj into ibfj1. To this end, nj makes a vertex and supplements
the VID into ibfj1 which is then alluded to as ibfj . Figure 1
shows provenance graph.
At the point when the packet achieves the BS, the iBF
contains the provenance records of the considerable number
of hubs in the way i.e. the full provenance. We indicate this
56
last record by ibf .Figure 1 shows leaf node n1 generates data
packet d and each intermediate node aggregate sensor data
with d & then forward to BS. Provenance path represented as
<vl,v1,v2,v3>. Figure 2 shows internal node n1 generates
data d by aggregating data d1..dn from n1n4 then passes d
to BS.
Fig 1 Fig 2
B. Provenance Decoding
At the point when the BS gets a data packet, it executes the
provenance confirmation process, which expect that the BS
comprehends what the information way ought to be, and
checks the iBF to see whether the right way has been taken
after. In any case, directly after system arrangement, and in
addition when the topology changes (e.g., because of hub
disappointment), the way of a packet sent by a source may not
be known not BS. For this situation, a provenance
accumulation procedure is fundamental, which recovers
provenance from the got iBF and consequently the BS takes in
the information way from a source hub. A short time later,
after getting a packet, it is adequate for the BS to check its
learning of provenance with that encoded in the packet.
C. Provenance Confirmation:
Input : Received packets with grouping seq and ibf. Set of
hash capacities H, Data way P =< nl1 , ..., n 1, ..., n p >0
BFc 0/Initialize Bloom Filter
for every n i P
do
vidi = generateVID (n i, seq)
embed vid i into BFc utilizing hash capacities as a part of H
endfor
in the event that (BFc = ibf ) then
return genuine/Provenance is confirmed
endif
return
D. Detecting Packet Discard attacks
We expand the protected provenance encoding plan to
identify packet drop assaults and to distinguish vindictive
node(s). We expect the connections on the way show normal
www.erpublication.org
 International Journal of Engineering and Technical Research (IJETR)
ISSN: 2321-0869 (O) 2454-4698 (P), Volume-5, Issue-2, June 2016
packet misfortune what's more, a few ill-disposed hubs may
exist on the way. For effortlessness, we consider just direct
information stream ways additionally, we don't address the
issue of recuperation once a vindictive hub is distinguished.
Existing systems that are orthogonal to our recognition plan
can be utilized, which may start multipath steering or
construct a spread tree around the compromised hubs.
Algorithm:

Reform/ Receive packets d[j]

If found
Generate Vertex ID
Pseq is last seen packet sequence
If(node==source) then
Initialize BF
Perform encoding
End if
Else
Generate vertex ID with pre-specified seqpid
If(node==source) Fig 3
Initialize BF
Perform encoding
End if
Else
Encode vertex into BF
End

IV. EXPERIMENTAL RESULTS

Here it is executed and tried the proposed strategies using the

TinyOS test system All outcomes are found the middle value
of more than 100 runs. First, we take a gander at how powerful
the protected provenance encoding plan is in identifying
provenance fabrication. Next, we explore the accuracy of the
proposed strategy for identifying packet misfortune At long
last, we measure the vitality utilization overhead of securing
provenance. Thinks about SSP, MP and our provenance
mechanism terms of bytes required to transmit provenance.
The provenance length in SSP and MP increments straightly
with the way length. For our plan, we observationally
determine the BF size which guarantees no disentangling Fig 4
blunder. Despite the fact that the BF size increments with the
normal number of elements to be embedded, the expanding V. CONCLUSION
rate is not straight. We see that notwithstanding for a 14-jump We tended to the issue of safely transmitting provenance for
way, a 30 byte BF is adequate for provenance interpreting sensor organizes, and proposed an efficient provenance
with no error. We likewise measure the vitality utilization for encoding and interpreting plan taking into account Bloom
both the basic provenance plan and the amplified plan for filters transmission. The plan guarantees classification,
packet drop location, while fluctuating bounce checks. For uprightness and freshness of provenance. We extended the
packet drop attacks, we set the malicious connection loss rate plan to fuse information provenance authoritative, and to
as 0.03. Note that, current sensors use ZigBee detail for high incorporate arrangement data that backings recognition of
level communication conventions which permits up to 104 packet misfortune assaults. Exploratory and expository
bytes as data payload. Thus, SSP and MP can be utilized to assessment results demonstrate that the proposed plan is
implant provenance (in data packets) for most extreme 2 and compelling, and adaptable. In future work, we plan to
14nodes, individually. Figure 3 compares SSP, MP and our actualize a genuine framework model of our protected
provenance mechanism in terms of bytes required to transmit. provenance conspire, and to enhance the exactness of packet
Figure 4 shows energy consumption over 1000 packet misfortune location, particularly on account of different back
transmission. to back malignant sensor hubs.

57 www.erpublication.org
 An Efficient Technique to Find out Origin Fraudulence and Packet Discard Attacks in Sensor Network

REFERENCES

[1]SalminSultana,GabrielGhinita, Member, IEEE, Elisa Bertino, Fellow,

IEEE,and Mohamed Shehab, Member, IEEE 2015
[2] I. Foster, J. Vockler, M. Wilde, and Y. Zhao, Chimera: A virtualdata
system for representing, querying, and automating data
derivation,inProc. of the Conf. on Scientific and Statistical
DatabaseManagement, 2002, pp. 3746.
[3] K. Muniswamy-Reddy, D. Holland, U. Braun, and M.
Seltzer,Provenance-aware storage systems, in Proc. of the USENIX
AnnualTechnical Conf., 2006, pp. 44.
[4] Y. Simmhan, B. Plale, and D. Gannon, A survey of data provenance in
e-science, SIGMOD Record, vol. 34, pp. 3136, 2005.
[5] W. Zhou, Q. Fei, A. Narayan, A. Haeberlen, B. Loo, and M. Sherr,
Secure network provenance, in Proc. of ACM SOSP, 2011, pp.
295310.
[6] W. Zhou, M. Sherr, T. Tao, X. Li, B. Loo, and Y. Mao, Efficient
querying and maintenance of network provenance at internet-scale, in
Proc. of ACM SIGMOD, 2010, pp. 615626.
[7] R. Hasan, R. Sion, and M. Winslett, The case of the fake picasso:
Preventing history forgery with secure provenance, in Proc. of FAST,
2009, pp. 114.
[8] A. Syalim, T. Nishide, and K. Sakurai, Preserving integrity and
confidentiality of a directed acyclic graph model of provenance, in
Proc. of the Working Conf. on Data and Applications Security and
Privacy, 2010, pp. 311318.
[9] N. Vijayakumar and B. Plale, Towards low overhead provenance
tracking in near real-time stream filtering, in Proc. of the Intl. Conf. on
Provenance and Annotation of Data (IPAW), 2006, pp. 4654.
[10] S. Chong, C. Skalka, and J. A. Vaughan, Self-identifying sensor data,
in Proc. of IPSN, 2010, pp. 8293

Shreevalli P, received her Bachelors degree in Computer Applications

from Bangalore University, India and she is currently pursuing MCA in
VTU, India. Her current research areas include networking and Data Mining.

Mohan Kumar H P, obtained MCA,MSC Tech and PhD from University of

Mysore India in 1998,2009 and 2015 respectively. He is working as a
professor in department of MCA, PES College of Engineering, Mandya,
Karnataka, India. His areas of interest are biometric, video analysis,
networking and Data Mining.

58 www.erpublication.org