Catching Packet
Droppers and Modifiers in Wireless Sensor Networks
ABSTRACT:
Packet dropping and modification are
common attacks that can be launched by an adversary to disrupt communication in
wireless multihop sensor networks. Many schemes have been proposed to mitigate
or tolerate such attacks, but very few can effectively and efficiently identify
the intruders. To address this problem, we propose a simple yet effective
scheme, which can identify misbehaving forwarders that drop or modify packets.
Extensive analysis and simulations have been conducted to verify the effectiveness
and efficiency of the scheme.
EXISTING
SYSTEM
In existing system a sensor network is
often deployed in an unattended and hostile environment to perform the
monitoring and data collection tasks. When it is deployed in such an
environment, it lacks physical protection and is subject to node compromise. After
compromising one or multiple sensor nodes, an adversary may launch various
attacks to disrupt the in-network communication. Among these attacks, two
common ones are dropping packets and
modifying packets, i.e.,
compromised nodes drop or modify the packets that they are supposed to forward.
DRAWBACK
IN EXISTING SYSTEM
Ø Packet
is forwarded along multiple redundant paths.
Ø Identifying
packet droppers are very low.
PROPOSED
SYSTEM
We propose a simple yet effective
scheme to identify misbehaving forwarders that drop or modify packets. Each
packet is encrypted and padded so as to hide the source of the packet. The
packet mark, a small number of extra bits, is added in each packet such that
the sink can recover the source of the packet and then figure out the dropping
ratio associated with every sensor node. The routing tree structure dynamically
changes in each round so that behaviors of sensor nodes can be observed in a large
variety of scenarios. Finally, most of the bad nodes can be identified by our
heuristic ranking algorithms with small false positive.
ADVANTAGES
IN PROPOSED SYSTEM
Ø Being
effective in identifying both packet droppers and modifiers.
Ø Low
communication and energy overheads.
Ø Being
compatible with existing false packet filtering schemes.
SCOPE OF THE PROJECT:
Our proposed scheme has the following features: (i)
being effective in identifying both packet droppers and modifiers, (ii) low
communication and energy overheads, and (iii) being compatible with existing
false packet filtering schemes; that is, it can be deployed together with the
false packet filtering schemes, and therefore it can not only identify
intruders but also filter modified packets immediately after the modification
is detected.
MODULES:
v Network
Creation Module
v DAG
Establishment
v Packet
Sending and Forwarding
v Packet
Receiving at the Sink
v Identifying
Most Likely Bad Nodes from Suspiciously Bad Nodes
MODULES DESCRIPTION:
Network
Creation Module
We consider a typical deployment of sensor networks,
where a large number of sensor nodes are randomly deployed in a two dimensional
area. Each sensor node generates sensory data periodically and all these nodes collaborate
to forward packets containing the data toward a sink. The sink is located
within the network. We assume all sensor nodes and the sink are loosely time
synchronized
DAG
Establishment
In the initialization phase, sensor nodes form a topology
which is a directed acyclic graph (DAG). A routing tree is extracted from the
DAG. Data reports follow the routing tree structure. All sensor nodes form a
DAG and extract a routing tree from the DAG. The sink knows the DAG and the
routing tree, and shares a unique key with each node. When a node wants to send
out a packet, it attaches to the packet a sequence number, encrypts the packet
only with the key shared with the sink, and then forwards the packet to its parent
on the routing tree. When an innocent intermediate node receives a packet, it attaches
a few bits to the packet to mark the forwarding path of the packet, encrypts
the packet, and then forwards the packet to its parent. On the contrary, a
misbehaving intermediate node may drop a packet it receives. On receiving a
packet, the sink decrypts it, and thus finds out the original sender and the
packet sequence number. The sink tracks the sequence numbers of received
packets for every node, and for every certain time interval, which we call a
round, it calculates the packet dropping ratio for every node. Based on the
dropping ratio and the knowledge of the topology, the sink identifies packet
droppers based on rules we derive.
Packet
Sending and Forwarding
In each round, data are transferred through the routing
tree to the sink. Each packet sender/ forwarder adds a small number of extra
bits to the packet and also encrypts the packet. When one round finishes, based
on the extra bits carried in the received packets, the sink runs a node
categorization algorithm to identify nodes that must be bad (i.e., packet
droppers or modifiers) and nodes that are suspiciously bad (i.e., suspected to
be packet droppers and modifiers).
Packet
Receiving at the Sink
The routing tree is reshaped every round. As a certain
number of rounds have passed, the sink will have collected information about
node behaviors in different routing topologies. The information includes which
nodes are bad for sure, which nodes are suspiciously bad, and the nodes’
topological relationship. To further identify bad nodes from the potentially
large number of suspiciously bad nodes, the sink runs heuristic ranking
algorithms.
Identifying
Most Likely Bad Nodes from Suspiciously Bad Nodes
We rank the suspiciously bad nodes based
on their probabilities of being bad, and identify part of them as most likely
bad nodes. Specifically, after a round ends, the sink calculates the dropping
ratio of each node, and runs the node categorization algorithm
SYSTEM REQUIREMENTS:
HARDWARE REQUIREMENTS:
•
System : Pentium IV 2.4 GHz.
•
Hard Disk :
40 GB.
•
Floppy Drive : 1.44 Mb.
•
Monitor : 15 VGA Colour.
•
Mouse :
Logitech.
•
Ram : 512 Mb.
SOFTWARE REQUIREMENTS:
•
Operating
system : Windows XP.
•
Coding
Language
: C#.NET
REFERENCE:
Chuang Wang, Taiming Feng, Jinsook Kim,
Guiling Wang, Member, IEEE, and Wensheng Zhang, Member, IEEE, “Catching Packet
Droppers and Modifiers in Wireless Sensor Networks”, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 23, NO. 5,
MAY 2012.
