2010
DOI: 10.4304/jnw.5.7.815-822
|View full text |Cite
|
Sign up to set email alerts
|

Bayesian Fusion Algorithm for Inferring Trust in Wireless Sensor Networks

Abstract: Abstract-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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
28
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 34 publications
(28 citation statements)
references
References 14 publications
0
28
0
Order By: Relevance
“…Momani et al [24] introduce a new algorithm of trust formation in wireless sensor networks based on the QoS to be fulfilled by the network's nodes. They use three main sources to compute trust, namely direct observations (past experiences), recommendations from the surrounding nodes and fixed dispositional trust in nodes.…”
Section: Previous Attempts To Use Computational Trust and Reputation mentioning
confidence: 99%
See 1 more Smart Citation
“…Momani et al [24] introduce a new algorithm of trust formation in wireless sensor networks based on the QoS to be fulfilled by the network's nodes. They use three main sources to compute trust, namely direct observations (past experiences), recommendations from the surrounding nodes and fixed dispositional trust in nodes.…”
Section: Previous Attempts To Use Computational Trust and Reputation mentioning
confidence: 99%
“…First, we modeled and implemented an adaptive dispositional trust metric [27] where we don't use the dispositional trust level as a constant value as in Momani et al [24] mentioned above, but as a value that can change over the time depending on the surrounding environment. Then, we have integrated trust management and cooperation incentives with our "trust transfer" trust metric [18], which has been proven to protect against Sybil attacks [17].…”
Section: Previous Attempts To Use Computational Trust and Reputation mentioning
confidence: 99%
“…In their model, the behavior of each WISP is characterized by a reputation record, which is generated and signed by a trusted Central Authority (CA). Momani et al [17] introduce a new algorithm of trust formation in wireless sensor networks based on the QoS to be fulfilled by the network's nodes. They use three main sources to compute trust, namely direct observations (past experiences), recommendations from the surrounding nodes and fixed dispositional trust in nodes.…”
Section: Previous Attempts To Use Computational Trust In Hotspotsmentioning
confidence: 99%
“…We have also advanced computational trust management for hotspots in the other FP7 ULOOP project. First, we modeled and implemented an adaptive dispositional trust metric [19] where we don't use the dispositional trust level as a constant value as in Momani et al [17] mentioned above, but as a value that can change over the time depending on the surrounding environment. Then, we have integrated trust management and cooperation incentives with our "trust transfer" trust metric [11], which has been proven to protect against Sybil attacks [10].…”
Section: Previous Attempts To Use Computational Trust In Hotspotsmentioning
confidence: 99%
“…Bayesian methodology, in which trust calculation is based on nodes' history behavior records, enriches the comprehension of trust in a probabilistic view [24]. Entropy is used to evaluate the randomness in a signal or event [11].…”
Section: Related Workmentioning
confidence: 99%