GTRSSN: Gaussian trust and reputation system for sensor networks

This paper introduces a new Gaussian trust and reputation system for wireless sensor networks based on sensed continuous events to address security issues and to deal with malicious and unreliable nodes. It is representing a new approach of calculating trust between sensor nodes based on their sensed data and the reported data from surrounding nodes. It is addressing the trust issue from a continuous sensed data which is different from all other approaches which address the issue from communications and binary point of view. © Springer Science+Business Media B.V. 2008

Statistical Mechanics in the Extended Gaussian Ensemble

The extended gaussian ensemble (EGE) is introduced as a generalization of the canonical ensemble. The new ensemble is a further extension of the Gaussian ensemble introduced by J. H. Hetherington [J. Low Temp. Phys. {\bf 66}, 145 (1987)]. The statistical mechanical formalism is derived both from the analysis of the system attached to a finite reservoir and from the Maximum Statistical Entropy Principle. The probability of each microstate depends on two parameters $\beta$ and $\gamma$ which allow to fix, independently, the mean energy of the system and the energy fluctuations respectively. We establish the Legendre transform structure for the generalized thermodynamic potential and propose a stability criterion. We also compare the EGE probability distribution with the $q$-exponential distribution. As an example, an application to a system with few independent spins is presented.Comment: Revtex 4, 8 pages, 8 figure

Bayesian fusion algorithm for inferring trust in wireless sensor networks

This paper introduces a new Bayesian fusion algorithm to combine more than one trust component (data trust and communication trust) to infer the overall trust between nodes. This research work proposes that one trust component is not enough when deciding on whether or not to trust a specific node in a wireless sensor network. This paper discusses and analyses the results from the communication trust component (binary) and the data trust component (continuous) and proves that either component by itself, can mislead the network and eventually cause a total breakdown of the network. As a result of this, new algorithms are needed to combine more than one trust component to infer the overall trust. The proposed algorithm is simple and generic as it allows trust components to be added and deleted easily. Simulation results demonstrate that a node is highly trustworthy provided that both trust components simultaneously confirm its trustworthiness and conversely, a node is highly untrustworthy if its untrustworthiness is asserted by both components. © 2010 ACADEMY PUBLISHER

Can we trust trusted nodes in wireless sensor networks?

In this paper we extend our previously designed trust model in wireless sensor networks to include both; communication trust and data trust. Trust management in wireless sensor networks is predominantly based on routing messages; whether the communication has happened or not (successful and unsuccessful transactions). The uniqueness of sensing data in wireless sensor networks introduces new challenges in calculating trust between nodes (data trust). If the overall trust is based on just the communication trust, it might mislead the network, that is; untrustworthy nodes in terms of sensed data can be classified as trusted nodes due to their communication capabilities. Hence we need to develop new trust models to address the issue of the actual sensed data. Here we are comparing the two trust models and proving that one model by itself is not enough to decide on the trustworthiness of a node, so new techniques are required to combine both data trust and communication trust. ©2008 IEEE

Recursive bayesian approaches for auto calibration in drift aware wireless sensor networks

The purpose for wireless sensor networks is to deploy low cost sensors with sufficient computing and communication capabilities to support networked sensing applications. Even when the sensors are properly calibrated at the time of their deployment, they develop drift in their readings leading to biased sensor measurements. Noting that a physical phenomenon in a certain area follows some spatio-temporal correlation, we assume that the sensors readings in that area are correlated. We also assume that the instantiations of drifts are uncorrelated. Based on these assumptions, and inspired by the resemblance of registration problem in radar target tracking with the bias error problem in wireless sensor networks, we follow a Bayesian framework to solve the Drift/Bias problem in wireless sensor networks. We present two methods for solving the drift problem in a densely deployed sensor network, one for smooth drifts and the other for unsmooth drifts. We also show that both methods successfully detect and correct sensor errors and extend the effective life time of the sensor network

Modelling Trust In Wireless Sensor Networks from the Sensor Reliability Prospective

This paper surveys the state of the art trust-based systems in Wireless Sensor Networks (WSN); it highlights the difference between Mobile ad hoc networks (MANET) and WSN and based on this observed difference (monitoring events and reporting data) a new trust model is introduced, which takes sensor reliability as a component of trust. A new definition of trust is created based on the newly introduced component of trust (sensor data) and an extension of node misbehaviour classification is also presented based on this new component of trust

RBATMWSN: Recursive Bayesian approach to trust management in wireless sensor networks

This paper introduces a new trust model and a reputation system for wireless sensor networks based on a sensed continuous data. It establishes the continuous version of the beta reputation system introduced in [1] and applied to binary events and presents a new Gaussian Reputation System for Sensor Networks (GRSSN) . We introduce a theoretically sound Bayesian probabilistic approach for mixing second-hand information from neighbouring nodes with directly observed information. ©2007 IEEE