A Risk-Aware Reputation-Based Trust Management in Wireless Sensor Networks

Abstract

Wireless sensor networks (WSNs) are susceptible to many security threats and are specifically prone to physical node capture in which the adversary can easily launch the so-called insider attacks such as node compromise, bypassing the traditional security mechanisms based on cryptography primitives. So, the compromised nodes can be modified to misbehave and disrupt the entire network and can successfully perform the authentication process with their neighbors, which have no way to distinguish fraudulent nodes from trustworthy ones. Trust and reputation systems have been recently suggested as a powerful tools and an attractive complement to cryptography-based schemes in securing WSNs. They provide ability to detect and isolate both faulty and malicious nodes. Considerable research has been done on modeling and managing trust and reputation. However, trust topic issue in WSNs remains an open and challenging field. In this paper, we propose a Risk-aware Reputation-based Trust (RaRTrust) model for WSNs. Our novel framework uses both reputation and risk to evaluate trustworthiness of a sensor node. Risk evaluation is used to deal with the dramatic spoiling of nodes, which makes RaRTrust robust to on-off attack and differ from other trust models based only on reputation. This paper contributes to model the risk as opinion of short-term trustworthiness combining with traditional reputation evaluation to derive trustworthiness in WSNs.

Trust‐based secure routing and the prevention of vampire attack in wireless ad hoc sensor network

“…The graphical representation for the average delay is given in Figure . Here, the proposed KID‐ SASR protocol is compared with the existing protocols EDTM, TERP, RaRTrust, and AF‐TNS under 2 to 10 malicious nodes. From the analysis, EDTM has the highest delay of 24ms for 10 malicious nodes and our proposed KID‐SASR algorithm has the lowest delay of 4ms for 10 malicious nodes.…”

Methods of Secure Routing Protocol in Wireless Sensor Networks

“…Reputation Based (RB) security scheme has been developed by author [23] [24]. The developed technique has the capability to diagnose and separate malicious and faulty nodes.…”

A Dynamic Programming Model for Internal Attack Detection in Wireless Sensor Networks

“…Since the utilities are written in the standard form of dynamic programming, we can optimize the detection rate dynamically with a planning horizon of length . If = 0, then 0 is chosen to solve the problem formalized by (9)- (12). In period = 1, the system updates knowledge on information set and uses (9)- (12) to optimize anew over the next planning periods.…”

“…Thus, the focus of the study is about internal attack such as detection, revocation, and tolerance of the compromised nodes and replicated nodes that have been physically captured. Normally, there are three ways to detect internal attacks: analyzing the attack behavior [5][6][7][8], detecting the compromised nodes [9][10][11][12][13], and verifying replica attack [14][15][16][17].…”