Random Routing Algorithms for Wireless Sensor Networks
Compromised node and denial of service are two key attacks in Wireless Sensor Networks (WSNs). In this paper, the authors present data delivery mechanisms that can with high probability circumvent black holes formed by these attacks. They observe that the classic multipath routing approaches are vulnerable to such attacks, mainly due to their deterministic nature. So once the adversary acquires the routing algorithm, it can compute the same routes known to the source, hence, making all information sent over these routes vulnerable to it s at tacks. Bes ides randomness, the generated routes are also highly dispersive and energy efficient, making them quite capable of circumventing black holes. In this paper three routing algorithms are presented with simulation results.