.NET Project On Secure Data Collection in Wireless Sensor Networks Using Randomized Dispersive Routes


Compromised node and denial of service are two key attacks in wireless sensor networks (WSNs). In this project, we study routing components that circumvent (bypass) block holes formed by these attacks. We contend that current multi-path routing approaches are vulnerable against such attacks, for the most part, because of their deterministic nature. So once the 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 project, we develop mechanisms that generate randomized multi-path 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 a low energy cost. Extensive simulations are conducted to verify the validity of our mechanisms.

Leave a Reply

Your email address will not be published. Required fields are marked *