The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
SORI: a secure and objective reputation-based incentive scheme for ad-hoc networks
Abstract
In an ad-hoc network, intermediate nodes on a communication path are expected to forward packets of other nodes so that the mobile nodes can communicate beyond their wireless transmission range. However, because wireless mobile nodes are usually constrained by limited power and computation resources, a selfish node may be unwilling to spend its resources in forwarding packets which are not of its direct interest, even though it expects other nodes to forward its packets to the destination. It has been shown that the presence of such selfish nodes degrades the overall performance of a non-cooperative ad hoc network. To address this problem, we propose a secure and objective reputation-based incentive (SORI) scheme to encourage packet forwarding and discipline selfish behavior. Different from the existing schemes, under our approach, the reputation of a node is quantified by objective measures, and the propagation of reputation is efficiently secured by a one-way-hash-chain-based authentication scheme. Armed with the reputation-based mechanism, we design a punishment scheme to penalize selfish nodes. The experimental results show that the proposed scheme can successfully identify selfish nodes and punish them accordingly.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Password authentication with insecure communication
Lamport, L. (1981) · Communications of the ACM · doi:10.1145/358790.358797 · Cited by 2,789
Cited by
Future Intelligent and Secure Vehicular Network Toward 6G: Machine-Learning Approaches
Tang, F., Kawamoto, Y., Kato, N., & Liu, J. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2954595 · Cited by 620
Survey on blockchain for Internet of Things
Wang, X., Zha, X., Ni, W., Liu, R. P., Guo, Y. J., Niu, X., & Zheng, K. (2019) · Computer Communications · doi:10.1016/j.comcom.2019.01.006 · Cited by 567
TRM-IoT: A trust management model based on fuzzy reputation for internet of things
Chen, D., Chang, G., Sun, D., Li, J., Jia, J., & Wang, X. (2011) · Computer Science and Information Systems · doi:10.2298/csis110303056c · Cited by 349
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
SMART: A Secure Multilayer Credit-Based Incentive Scheme for Delay-Tolerant Networks
Zhu, H., Lin, X., Lu, R., Fan, Y., & Shen, X. (2009) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2009.2020105 · Cited by 284
Metadata
- Authors
- He, Q., Wu, D., & Khosla, P.
- Venue
- 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733)
- Publisher
- IEEE
- Published
- 2004
- Pages
- 825-830 Vol.2
- ISSN
- 1525-3511 (ISSN-L)
- OpenAlex
- W2099376754
- Cited by
- 409
- References
- 1
- FWCI
- 8.56
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: SORI: a secure and objective reputation-based incentive scheme for ad-hoc networks. https://app.cochat.ai/papers/10.1109/wcnc.2004.1311293
- The paper
- He, Q., Wu, D., & Khosla, P. (2004). SORI: a secure and objective reputation-based incentive scheme for ad-hoc networks. 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733). https://doi.org/10.1109/wcnc.2004.1311293
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.
