A novel randomized dispersive routing mechanism for securing data in wireless senor networks

Wireless Sensor Networks (WSN) are rising as new stage in the IT ecosystem and in rich field of active research involving hardware and system design, distributed algorithms, networking, security and social factors. Security is a term used about the characteristics of integrity, authentication, privacy, anti-playback, and nonrepudiation attacks against wireless sensor networks. Of the various possible security threats encountered in a wireless sensor network (WSN), this research is specifically concerned in fighting against two types of attacks: compromised node (CN) and denial of service (DOS), which generates black holes. General classic multipath routing methods are vulnerable to these attacks, due to their deterministic nature. So once the opponent acquires the routing algorithm, it can figure out the same routes known to the source, making all information sent over these routes vulnerable to attacks. Our work developsmechanisms that generate randomized multipath routes. Under this approach, the paths taken by the “shares” of different packets change over time. So even if the algorithm becomes known to the adversary, the adversary still cannot locate the routes traversed by each packet. Besides arbitrariness, the routes are also highly dispersive and energy efficient. We analytically investigate the security and energy performance of the proposed schemes. Simulations are conducted to verify the validity of our mechanisms.