Using Reputation Systems and Non-Deterministic Routing to Secure Wireless Sensor Networks

Abstract

Security in wireless sensor networks is difficult to achieve because of the resource limitations of the sensor nodes. We propose a trust-based decision framework for wireless sensor networks coupled with a non-deterministic routing protocol. Both provide a mechanism to effectively detect and confine common attacks, and, unlike previous approaches, allow bad reputation feedback to the network. This approach has been extensively simulated, obtaining good results, even for unrealistically complex attack scenarios.

Trust Mechanisms to Secure Routing in Wireless Sensor Networks: Current State of the Research and Open Research Issues

“…(viii) Statistical Method-Based Method. Although certain method is not proposed in [38], authors refer to using localization information and route analysis for messages coming from the same area. Specifically, authors refer to use of statistical process of network data to detect wormholes.…”

“…(i) Greyhole/selective forwarding [15][16][17][18][19][20][21][22][23][24][25][26][27][28][29][30][31][32][33][34] (ii) Wormhole [35][36][37][38][39][40][41][42][43] (iii) Sinkhole [26,[42][43][44][45][46][47][48][49][50] (iv) Sybil attacks [51][52][53][54][55][56][57][58][59] Since we did not find a significant number of articles for other attacks, we overview articles only for the abovementioned attacks.…”

“…(i) Packet forwarding behavior and estimated sign of wormhole attack [35] (ii) Bandwidth requirement of the particular route and data rate of the transceiver at node [36] (iii) Previous reputation value and level of inconsistencies in routing paths [37] (iv) Spatial and temporal changes in routing path [38] (v) Packet forwarding time [39] (vi) Packet forwarding behavior and HELLO packet received time [40] (vii) Packet forwarding behavior and route length [41] (viii) Packet forwarding behavior and packet integrity [42] Although trust estimation equation is central to proposed scheme some of the schemes do not consider it [35,38,42]. Proposed trust estimation equations are diverse.…”

“…A contribution to the value of the end-to-end reputation from any individual node is logarithmic which makes the reputation algorithm towards the use of previously explored nodes wherever possible. Reputation (trust) level of node in [38] is estimated based on the previous reputation value and level of inconsistencies in the node link of routing path. If the previous reputation is above the threshold and the node starts misbehaving, its reputation will decrease rapidly.…”

Improving security in WMNs with reputation systems and self-organizing maps

“…However, a vast amount of techniques have been developed for WSNs, most of them based on trust and reputation, offering a high degree of security. The main contribution of this article consists in showing how these approaches can also be applied to WMNs, in particular the approach described in Moya et al (2009).…”