The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Trust evaluation in ad-hoc networks
Open accessAbstract
An important concept in network security is trust, interpreted as a relation among entities that participate in various protocols. Trust relations are based on evidence related to the previous interactions of entities within a protocol. In this work, we are focusing on the evaluation process of trust evidence in Ad Hoc Networks. Because of the dynamic nature of Ad Hoc Networks, trust evidence may be uncertain and incomplete. Also, no pre-established infrastructure can be assumed. The process is formulated as a path problem on a directed graph, where nodes represent entities, and edges represent trust relations. Using the theory of semirings, we show how two nodes can establish an indirect trust relation without previous direct interaction. The results are robust in the presence of attackers. We give intuitive requirements for any trust evaluation algorithm. The performance of the scheme is evaluated on three topologies.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
Erdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419 · cited 1×
“This could suggest the Sybil attack [8] as an attempt to compromise the system.”
BackgroundThe EigenTrust algorithm for reputation management in P2P networks
Kamvar, S. D., Schlosser, M. T., & Garcia-Molina, H. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775242 · Cited by 3,362
Cited by
Information theoretic framework of trust modeling and evaluation for ad hoc networks
Sun, Y. L., Yu, W., Han, Z., & Liu, K. J. R. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.861389 · Cited by 614
Trust Computations and Trust Dynamics in Mobile Adhoc Networks: A Survey
Govindan, K., & Mohapatra, P. (2012) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.042711.00083 · Cited by 367
Sun, Y. L., Han, Z., Yu, W., & Liu, K. J. R. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.154 · Cited by 348
Trust-based security for wireless ad hoc and sensor networks
Boukerch, A., Xu, L., & EL-Khatib, K. (2007) · Computer Communications · doi:10.1016/j.comcom.2007.04.022 · Cited by 290
Metadata
- Authors
- Theodorakopoulos, G., & Baras, J. S.
- Venue
- Proceedings of the 3rd ACM workshop on Wireless security
- Publisher
- ACM
- Published
- 2004-10
- Pages
- 1-10
- OpenAlex
- W2161166082
- Cited by
- 243
- References
- 4
- FWCI
- 31.59
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.