Trust Mechanisms and Reputation Systems
Most of the approaches for ad hoc networks assume that the nodes readily and honestly follow the protocol. Unfortunately, this assumption does not always hold in reality. Misbehaving in ad hoc networks can take place at different levels of the system architecture: On the communication level, nodes c...
Saved in:
| Published in | Algorithms for Sensor and Ad Hoc Networks Vol. 4621; pp. 325 - 336 |
|---|---|
| Main Author | |
| Format | Book Chapter |
| Language | English |
| Published |
Germany
Springer Berlin / Heidelberg
2007
Springer Berlin Heidelberg |
| Series | Lecture Notes in Computer Science |
| Subjects | |
| Online Access | Get full text |
| ISBN | 354074990X 9783540749905 |
| ISSN | 0302-9743 1611-3349 |
| DOI | 10.1007/978-3-540-74991-2_17 |
Cover
| Summary: | Most of the approaches for ad hoc networks assume that the nodes readily and honestly follow the protocol. Unfortunately, this assumption does not always hold in reality. Misbehaving in ad hoc networks can take place at different levels of the system architecture:
On the communication level, nodes can refuse to forward messages of others in order to save bandwidth and energy. Many misbehaving nodes would lead to a low reliability of the system. But such nodes can be detected, because every node can eavesdrop the network traffic of adjacent nodes ([279], ’Watchdog’). Most of the research on reputation and trust models in ad hoc networks focus on that issue.In contrast, misbehavior on the application level covers spoof query results and valueless services from nodes that would be able to provide high-quality ones. It is challenging to automatically detect this kind of adverse behavior. Typically it is the end-user who recognizes that a service provided by a certain node does not meet its expectations. But it is very important for open ad hoc networks to detect and expel such nodes. Otherwise, the system can become suspicious, and the users can loose their motivation to participate in the system [317]. |
|---|---|
| ISBN: | 354074990X 9783540749905 |
| ISSN: | 0302-9743 1611-3349 |
| DOI: | 10.1007/978-3-540-74991-2_17 |