1.

Dynamic Routing for reducing the compromised node attacks

In this paper, we develop mechanisms that generate randomized multipath routes.
Under our design, the routes taken by the shares of different packets change over
time. So even if the routing algorithm becomes known to the adversary, the adversary
still cannot pinpoint the routes traversed by each packet. Besides randomness, the
routes generated by our mechanisms are also highly dispersive and energy-efficient,
making them quite capable of bypassing black holes at low energy cost.
Existing System:

Sometimes we have get compromised node attacks and block hole attacks. Severe CN
and DOS attacks can disrupt normal data delivery between nodes and the sink, or even
partition the topology. A conventional cryptography-based security method cannot alone
provide satisfactory solutions to these problems. This is because, by definition, once a
node is compromised, the adversary can always acquire the encryption/decryption keys
of that node, and thus can intercept any information passed through it. At the same
time, an adversary can always perform certain form of DOS attack (e.g., jamming) even
if it does not have any knowledge of the crypto-system used in the WSN. In existing
system Packet loss occurred during packet transmission, so this is low efficiency in
existing system.
Proposed System:

Proposed system overcome the following problems like Packet loss occurred during
packet transmission, low efficiency by using Dynamic Routing Algorithm in proposed
system.
We propose a randomized multi-path routing algorithm that can overcome the above
problems. Instead of selecting paths from a pre-computed set of routes, this algorithm
computes multiple paths in a randomized way each time an information packet needs to
be sent, such that the set of routes taken by various shares of different packets keep
changing over time.
SYSTEM ARCHITECTURE:

















Modules:
1. Sender
2. Randomized multi path delivery
3. Receiver

MODULES:
1. Sender
Sender is a small and simple application that connects to a port through protocol and then
sends text strings to destination. To access the server we want IP address and port. It is act
as a client. We have lot of clients in our network. Each and every client wants to know port
number of the receiver and IP address of the receiver. Here we know the details about
which file we send it including file size, modified time, file property and etc.one more
options is there assigning nodes. We can send multiple files at a time. We get
acknowledgement from receiver if sending file are reached or not.

2. Randomized multi path delivery
Consider the delivery of a packet with the destination at a node. In order to minimize
the probability that packets are eavesdropped over a specific link, a randomization process
for packet deliveries is adopted. In this process, the previous next hop for the source node
Update Router
Status

Receiver
Acknowledgment
Forward Packet Choose Routers
Compare time delay

Read Router Status Message





Multi path
router

Server
is identified. Then, the process randomly picks up a neighboring node excluding already
selected hop as the next hop for the current packet transmission. The exclusion of previous
selected hop for the next hop selection avoids transmitting two consecutive packets in the
same link, and the randomized pickup prevents attackers from easily predicting routing
paths for the coming transmitted packets.
The number of entries in the history record for packet deliveries to destination nodes. In
order to efficiently look up the history record for a destination node, we maintain the history
record for each node in a hash table. Before the current packet is sent to its destination
node, we must randomly pick up a neighboring node excluding the used node for the
previous packet.
3. Receiver
Receiver receives the incoming packets from sender via router. Here want to access that
source IP address, destination IP address, source port, destination port. It is act as a
receiver. Receiving frame receive the files from the clients. Here we have only one option
receiving frame. All sender packets are received here. We can calculate the time delay of
the incoming packets. And the time delay value display in client or server module.
Software Requirements:

Operating System : Windows XP
Front End : Java Swing
Programming tool : net beans
Networking Tool : Sockets
Protocol : TCP
Packets Transferring : I/O Concepts, Threads

Hardware Requirements:


Processor : Intel Pentium IV
Cache Memory : 1MB
HDD : 40 GB
RAM : 512 MB
Processor Speed : 600 MHz
Display Type : VGA
Mouse : Logitech
Monitor : 15 Samsung Color Monitor