Secure Data Collection in Wireless Sensor Networks Using Randomized Dispersive Routes

 

1.ABSTRACT :

                                   Compromised-node and denial-of-service are two key attacks in wireless sensor networks (WSNs). In this project, we study routing mechanisms that circumvent (bypass) black holes formed by these attack. We argue that existing multi-path routing approaches are vulnerable to such attacks, mainly due to their deterministic nature. So once an adversary acquires the routing algorithm, it can compute the same routes known to the source, and hence endanger all information sent over these routes. 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. Extensive simulations are conducted to verify the validity of our mechanisms.

2) EXISTING SYSTEM :

                               Existing randomized multi-path routing algorithms in WSNs have not been designed with security considerations in mind, largely due to their low energy efficiency. existing multi-path routing approaches are vulnerable to such attacks, mainly due to their deterministic nature. So once an adversary acquires the routing  algorithm, it can compute the same routes known to the source, and hence endanger all information sent over these routes. Out of the various possible security threats that may be experienced by a wireless sensor network (WSN), two attacks called the compromised-node (CN)  attack and the denial-of-service(DOS) attack.The CN attack refers to the situation when an adversary physically compromises  a  subset  of nodes to eavesdrop information, whereas in the DOS attack, the adversary interferes with the normal operation of the WSN by actively disrupting, changing, or even destroying the functionality of a subset of nodes in the system.

3.PROPOSED SYSTEM :

                             To diversify routes, an ideal random propagation algorithm propagates information shares as dispersive as possible. Typically, this means propagating the share farther from its source. At the same time, it is highly desirable to have an energy efficient propagation, which calls for limiting the number of randomly propagated hops. The challenge here lies in the random and distributed nature of the propagation: a share may be sent one-hop farther from its source in a given step, but may be sent back closer to the source in the next step, wasting both steps from the security’s point of view. To tackle this issue, some control needs to be imposed on the random propagation process to ensure that in each step the share is more likely to be forwarded outwards from the source. We develop four distributed random propagation mechanisms, which approach this goal in various degrees.

1)   Purely Random Propagation (Baseline Scheme):

2)   Non-repetitive Random Propagation

3)   Directed Random Propagation

4)   Multicast Tree-assisted Random Propagation

4.HARDWARE REQUIREMENTS:

•         System                : Pentium IV 2.4 GHz.

•         Hard Disk            : 40 GB.

•         Floppy Drive       : 1.44 Mb.

•         Monitor                : 15 VGA Colour.

•         Mouse                 : Logitech.

•         Ram                     : 256 Mb.

5.SOFTWARE REQUIREMENTS:

•         Operating System       : - Windows XP Professional.

•         Front End                     : - Asp .Net 2.0.

•         Coding Language       : - Visual C# .Net.