NOVATEUR PUBLICATIONS

International Journal of Research Publications in Engineering and Technology [IJRPET]

ISSN: 2454-7875
VOLUME 3, ISSUE 7, July-2017
PACKET DROP ATTACK DETECTION AND PRIVACY MANAGEMENT FOR
CONFIDENTIAL MULTIHOP COMMUNICATION IN WIRELESS NETWORK
MR.MATHAPATI RAJSHEKHAR
ME. Student, Dept. Of Comp. Engg. Flora Institute Of Technology, Pune, Maharashtra, India,
[email protected]

ASST. PROF. JOSHI SHWETA

Asst. Prof. Dept. Of Comp. Engg. Flora Institute of Technology, Pune, Maharashtra, India, [email protected]

ABSTRACT: necessary to plot a light-weight source resolution that

Sensor networks are becoming additional doesn't introduce important overhead. What is more,
and additional widespread in varied application sensors typically operate in associate degree untrusted
domains, like cyber physical infrastructure systems, atmosphere, wherever they'll be subject to attacks.
environmental looking, power grids, etc. information Hence, it's necessary to handle security needs like
area unit created at Associate in nursing outsized confidentiality, integrity and freshness of source. Our
sort of device node sources and processed in- goal is to style a source encryption and decipherment
network at intermediate hops on their due to a base mechanism that satisfies such security and performance
station that performs decision-making. The range of wants. We have a tendency to propose a source
data sources creates the need to assure the attribute encryption strategy whereby every node on the trail of
of data, such entirely trustworthy data is taken an information packet firmly embeds source information
under consideration among the decision among a Bloom filter that is transmitted together with
methodology. Information is associate in nursing the information. Upon receiving the information, the
economical methodology to assess info attribute, bottom station extracts and verifies the source.
since it summarizes the history of possession and Data source is a good methodology to assess
thus the actions performed on the data. We tend to knowledge trustiness, since it summarizes the history of
tend to tend to propose a really distinctive Truthful possession and therefore the actions performed on the
Detection of Packet Dropping Attacks in Wireless information. Recent analysis highlighted the key
spontaneous Networks to firmly transmit device contribution of source in systems wherever the
info. The planned technique depends on in packet employment of unreliable knowledge might cause
Bloom filters to inscribe the information. We tend to ruinous failures e.g. SCADA systems for essential
productive mechanisms for information verification infrastructure. Though source modeling, collection, and
and reconstruction at very cheap station. To boot, we querying are investigated extensively for workflows and
tend to expand the protected info theme with utility curated databases, source in device networks has not
to observe packet drop organized by malicious info been properly self-addressed. During this paper, we have
exploit nodes. We tend to tend to tend to assess the a tendency to investigate the matter of secure and
planned system each analytically and through an economical source transmission and process for device
experiment, so the outcomes demonstrate the networks.
adequacy and potency of the Truthful Detection of
Packet Dropping Attacks in Wireless spontaneous
Networks in detection packet forgery and d-dos
attacks.
KEYWORDS: Attack-tolerant, Sensor Network, Bloom
Filter, WSN, MAC.

I. INTRODUCTION:
In a multi-hop device network, knowledge source
permits the bottom station to trace the supply and
forwarding path of a personal knowledge packet since its
generation. Source should be recorded for every
knowledge packet; however vital challenges arise as a II. LITERATURE REVIEW:
result of the tight storage, energy and information 2.1 PAPER NAME: Secure Data Aggregation in Wireless
measure constraints of the device nodes. Therefore, it's Sensor Networks

117 | P a g e
 NOVATEUR PUBLICATIONS
International Journal of Research Publications in Engineering and Technology [IJRPET]
ISSN: 2454-7875
VOLUME 3, ISSUE 7, July-2017
AUTHORS: Sankardas Roy, Mauro Conti, Sanjeev Setia, possible stability region can still be achieved by a large
and Sushil Jajodia. class of control algorithms.
DESCRIPTION: The paper discuss the security issues of
in-network aggregation algorithms to compute III. DEVELOPED SYSTEM:
aggregates such as establish Count and Sum also We're designing an information encoding and
discussed how a cooperated node can corrupt the decoding mechanism that satisfies security and
aggregate estimation of the base station, keeping our performance needs. We advise a knowledge encoding
effort on the ring-based hierarchical aggregation strategy whereby each node on the way of your data
algorithms. To address this problem, obtainable a packet securely embeds data information inside a Bloom
lightweight confirmation algorithm which would enable filter (BF) that is transmitted combined with the data.
the base station (BS) to confirm whether the computed Upon receiving the packet, the BS extracts and verifies
aggregate was valid. the info information. In addition we devise an extension
cord of the data encoding scheme which allows the BS to
2.2 PAPER NAME: Resource allocation and cross-layer identify if the packet drop attack was staged by the
control in wireless networks malicious node.
AUTHORS: Georgiadis, Leonidas, Michael J. Neely, and We use only fast message authentication code (MAC)
Leandros Tassiulas. systems and Bloom filters that occur to be fixed-size data
DESCRIPTION: In this paper author presents abstract structures that compactly represent provenance. Bloom
models that capture the cross-layer interaction from the filters make efficient using of bandwidth, and they yield
physical to move layer in wireless network architectures low error rates utilized. We frame the problem of secure
as well as cellular, ad-hoc and device networks likewise data transmission in sensor networks, & find obtainable
as hybrid wireless-wire line. the challenges specific to this context. We propose an in-
packet Bloom filter (iBF) data -encoding scheme.
2.3 PAPER NAME: A Lightweight Secure Scheme for
Detecting Provenance Forgery and Packet Drop Attacks 3.1 ADVANTAGES OF DEVELOPED SYSTEM:
in Wireless Sensor Networks. 1. To achieve confidentiality, one needs to encode
AUTHORS: Salmin Sultana, Gabriel Ghinita, Elisa Bertino, blocks of information across multiple packets.
Fellow, and Mohamed Shehab. Developed a novel adaptive end-to-end encoding
DESCRIPTION: A mischievous adversary may familiarize scheme, that takes certain observations from the
further nodes in the network or cooperation existing network and chooses the appropriate code rate to
ones. Therefore, assuring high information maintain confidentiality for each block of data.
trustworthiness is crucial for right decision-making. 2. The system can efficiently detect the actual packet
Planned a novel lightweight system to strongly transmit loss in the wireless network.
provenance for sensor files. 3. In secure confidetional wireless communications
between Multihop networks.
2.4 PAPER NAME: In-packet Bloom filters: Design and
networking applications IV. SYSTEM ARCHITETURE:
AUTHORS: Christian E. Rothenberg, Carlos A. B. M.,
Maur´ıcio F. Magalhaesa, F´abio L. V., A. Wiesmaierc.
DESCRIPTION: This paper explores an exciting front in
the Bloom filter research space, namely the special
category of small Bloom filters carried in packet headers.
Using iBFs is a promising approach for networking
application designers choosing to move application state
to the packets themselves. At the expense of some false
positives, fixed-size iBFs are amenable to hardware and
present a way for new networking applications.

2.5 PAPER NAME: On the connection-level stability

Of congestion controlled communication networks
AUTHORS: Lin, Xiaojun, Ness B. Shroff, and R. Srikant.
DESCRIPTION: In this paper, this time-scale separation
assumption is removed and it is shown that the largest Figure 4.1 System Architecture of Developed System

118 | P a g e
 NOVATEUR PUBLICATIONS
International Journal of Research Publications in Engineering and Technology [IJRPET]
ISSN: 2454-7875
VOLUME 3, ISSUE 7, July-2017
4.1 WORKING OF DEVELOPED SYSTEM: side also. So by comparing hash values at both the sides,
1. Source node sends messages toward the destination integrity of data is verified.
node.
2. Message devides in number of packets and encoded. V. MATHEMATICAL MODEL:
3. At intermediate node packet receives packets, it can Let W be the whole system which consists:
change or drop packets by various any hackers. W= {IP, PRO, OP}
Intermediate node can change destination address. IP is the input of system.
If it changes address, then it can trace by IP tracing. IP= {BS, G, N, L, K, H, d, ID, V, E, S, BF}.
4. At destination node when it receives packets then Where,
decoding of message is happen. 1. Let BS is the Base Station which collects data
from network.
4.2 SYSTEM FEATURES: 2. Let G is the graph , G(N,L)
1. PRIVACY MANAGEMENT: Where, N is the set of nodes.
In this project, privacy management is achieved N = {ni|, 1 ≤ i ≤ |N|} is the set of nodes,
by introducing the bloom filter mechanism, the system And L is the set of links, containing an element
will assign the unique sequence to each package when it li,jfor each pair of nodes niand njthat are communicating
sending from sender. After reaching that packets at directly with each other.
destination side the destination node will applies the 3. K is set of symmetric cryptographic key
bloom filter mechanism to verify the packets. 4. H is a set of hash functions
H = {h1, h2, ...,hk} .
2. PARALLEL COMPUTING: 5. E is edge setconsists of directed edges that
This developed system will come under parallel connect sensor nodes.
computing because the sender node will send the 6. d is the set of data packets,
message to destination node but at the backend system Let G is acyclic graph G (V,E) where each vertex v ∈
will encode that message data i.e. dividing into multiple V is attributed to a specific node HOST(v) = n and
packets and assigning the sequence number to that represents the data record (i.e. nodeID) for that node.
message which is required to filter and detect the packet Each vertex in the graph is uniquely identified by a
drop attack. And also system will continuously send vertex ID (VID) which is generated by the host node
status report to sender about packet drop. using cryptographic hash functions.

3. DISTRIBUTED DATABASE: PROCEDURE:

When sender is sending the message to Let S is a set of items
destination, then at the back end system will divide that
data into multiple packages (we are considering 3) i.e. S = {s1, s2, ...,sn}
message is divided into 3 different packages while
sending and each intermediate node in the network will We use an array of m bits with k independent hash
receive the message in 3 different packages. functions h1, h2, ...,hk.
The output of each hash function hi maps an item
4. INTRUSION DETECTION: suniformly to the range [0, m-1], i.e., an index in am-bit
In intrusion detection, we are detecting the array.
packet drops attacks and IP tracing. Packet drop attack Let BF is the Bloom Filer, can be represented as {b0, . . . ,
means the intermediate node or mediator node or bm−1}.
attacker node will drop the while forwarding to next Initially all m bits are set to 0.
node and IP tracing means when attacker changes the To insert an element s ∈ S into a BF, s is hashed with all
destination IP address of node then system will trace the k hash functions producing the values hi(s) (1 ≤ i ≤
that actual destination IP and forward the message to k).
that IP address. The bits corresponding to these values are then set to 1
in the bit array.
5. VERIFY DATA INTEGRITY: To query the membership of an item s` within S, the bits
Data integrity is maintained by MD5. If intruder at indices hi(s`) (1 ≤ i ≤ k) are checked. If any of them is
changes the packet data, with the help of MD5 we can 0, then certainly s` not within S. Otherwise, if all of the
detect any changes in data. By using MD5 hash value is bits are set to 1, s`∈ S with high probability.
generated at sender or source side and at the receiver

119 | P a g e
 NOVATEUR PUBLICATIONS
International Journal of Research Publications in Engineering and Technology [IJRPET]
ISSN: 2454-7875
VOLUME 3, ISSUE 7, July-2017
There exists a possibility of error which arises due to
hashing collision that makes the elements in S
collectively causing indices hi(s`) being set to 1 even if s`
not within S. This is called a false positive.

VI. RESULT ANALYSIS:

6. 1 COMPARISON WITH EXISTING SYSTEM:

Existing System Developed System

P 50 85

Q 55 79

R 75 55 Figure 4.3 Final Result with Graph

VII. CONCLUSION AND FUTURE SCOPE:

In this paper, we considered the problem of packet
drop attack detection in wireless multi-hop networks
where sources have confidential information to be
transmitted to their corresponding destinations with the
help of intermediate nodes where there is no trust over
the intermediate nodes. All intermediate nodes are
considered as internal eavesdroppers from which the
confidential information needs to be protected. To
provide confidentiality in such setting, developed
encoding and decoding the message over blocks of
information which are transmitted over different path of
Figure 4.2 Comparisons with Existing System
communication. Later on work, we want to implement a
real system prototype individual’s secure scheme, and
Where, P – Confidentiality, Q – Performance,
also to increase the accuracy of packet loss detection,
R – Delay Rate
especially in the matter of multiple consecutive
malicious sensor nodes.
6.2 INPUT:
Here, Whole System taken many more attribute
REFERENCES:
for the input purpose but here author mainly focuses on
1) Sultana, Salmin, et al. "A lightweight secure scheme
the Time and performance of system. Considering few
for detecting provenance forgery and packet
attributes like detection accuracy, confidentiality and
dropattacks in wireless sensor networks." IEEE
time predicted analytical results of developed system
Transactions on dependable and secure
with respect to existing system.
computing 12.3 (2015): 256-269.
2) Roy, Sankardas, et al. "Secure data aggregation in
RESULT:
wireless sensor networks." IEEE Transactions on
Existing System Developed System
Information Forensics and Security 7.3 (2012):
A 3 10 1040-1052.
3) Rothenberg, Christian Esteve, et al. "In-packet Bloom
B 6 10
filters: Design and networking applications."
C 8 4 Computer Networks 55.6 (2011): 1364-1378.
4) Lim, Hyo-Sang, Yang-Sae Moon, and Elisa Bertino.
"Provenance-based trustworthiness assessment in
Where,
sensor networks." Proceedings of the Seventh
A = Detection Accuracy.
International Workshop on Data Management for
B = Confidentiality.
Sensor Networks.ACM, 2010.
C = Time.
5) B. Awerbuch, R. Curtmola, D. Holmer, C. Nita-Rotaru,
and H. Rubens, “ODSBR: An on-demand secure

120 | P a g e
 NOVATEUR PUBLICATIONS
International Journal of Research Publications in Engineering and Technology [IJRPET]
ISSN: 2454-7875
VOLUME 3, ISSUE 7, July-2017
byzantine resilient routing protocol for wireless ad
hoc networks,” ACM Trans. Inf. Syst. Secur., vol. 10,
no. 4, pp. 11–35, 2008.
6) K. Balakrishnan, J. Deng, and P. K. Varshney,
“TWOACK: Preventing selfishness in mobile ad hoc
networks,” in Proc. IEEE Wireless Commun. Netw.
Conf., 2005, pp. 2137–2142.
7) R. Rao and G. Kesidis, “Detecting malicious packet
dropping using statistically regular traffic patterns in
multihop wireless networks that are not bandwidth
limited,” in Proc. IEEE GLOBECOM Conf., 2003, pp.
2957–2961.
8) Lin, Xiaojun, Ness B. Shroff, and R. Srikant. "On the
connection-level stability of congestion-controlled
communication networks." IEEE Transactions on
Information Theory 54.5 (2008): 2317-2338.
9) Georgiadis, Leonidas, Michael J. Neely, and Leandros
Tassiulas. "Resource allocation and cross-layer
control in wireless networks." Foundations and
Trends® in Networking 1.1 (2006): 1-144.

121 | P a g e