Secure Probabilistic Routing in Wireless Sensor Networks
In this paper, the authors propose a provably secure routing protocol for Wireless Sensor Networks (WSNs) based on random walks using tabu lists. Many approaches have been developed in the literature to solve security problems of routing protocols for WSNs. But most of them are not resilient against attacks from compromised nodes because they only use cryptographic solutions. In their paper, they design a new secure routing protocol to improve this resiliency using realistic assumptions such as asynchronous communication. They propose a probabilistic approach that allows one to save energy and to avoid malicious nodes with a detection system of safe paths using tabu lists, acknowledgments and trust counters.