The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Performance analysis of the CONFIDANT protocol
Open accessAbstract
Mobile ad-hoc networking works properly only if the participating nodes cooperate in routing and forwarding. However,it may be advantageous for individual nodes not to cooperate. We propose a protocol, called CONFIDANT, for making misbehavior unattractive; it is based on selective altruism and utilitarianism. It aims at detecting and isolating misbehaving nodes, thus making it unattractive to deny cooperation. Trust relationships and routing decisions are based on experienced, observed, or reported routing and forwarding behavior of other nodes. The detailed implementation of CONFIDANT in this paper assumes that the network layer is based on the Dynamic Source Routing (DSR) protocol. We present a performance analysis of DSR fortified by CONFIDANT and compare it to regular defenseless DSR. It shows that a network with CONFIDANT and up to 60% of misbehaving nodes behaves almost as well as a benign network, in sharp contrast to a defenseless network. All simulations have been implemented and performed in GloMoSim.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Mitigating routing misbehavior in mobile ad hoc networks
Marti, S., Giuli, T. J., Lai, K., & Baker, M. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345955 · Cited by 3,415
Zhou, L., & Haas, Z. J. (1999) · IEEE Network · doi:10.1109/65.806983 · Cited by 2,333
Resnick, P., Kuwabara, K., Zeckhauser, R., & Friedman, E. (2000) · Communications of the ACM · doi:10.1145/355112.355122 · Cited by 2,190
Decentralized Trust Management
Blaze, M., Feigenbaum, J., & Lacy, J. (1996) · Cited by 1,870
GloMoSim: a library for parallel simulation of large-scale wireless networks
Zeng, X., Bagrodia, R. L., & Gerla, M. (1998) · doi:10.1145/278008.278027 · Cited by 1,318
Secrets and lies: digital security in a networked world
(2001) · Choice Reviews Online · doi:10.5860/choice.38-3941 · Cited by 1,159
Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks
Buttyán, L., & Hubaux, J.-P. (2003) · Mobile Networks and Applications · doi:10.1023/a:1025146013151 · Cited by 1,068
Enforcing service availability in mobile ad-hoc WANs
Buttyán, L., & Hubaux, J. (2000) · doi:10.5555/514151.514164 · Cited by 565
Security-aware ad hoc routing for wireless networks
Yi, S., Naldurg, P., & Kravets, R. H. (2001) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1145/501449.501464 · Cited by 464
Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks
Buchegger, S., & Le Boudec, J.-Y. (2003) · Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing · doi:10.1109/empdp.2002.994321 · Cited by 401
Self-citationSecuring distance-vector routing protocols
Smith, B. R., Murthy, S., & Garcia-Luna-Aceves, J. J. (2002) · doi:10.1109/ndss.1997.579225 · Cited by 150
Cited by
Mobile ad hoc networking: imperatives and challenges
Chlamtac, I., Conti, M., & Liu, J. J.-N. (2003) · Ad Hoc Networks · doi:10.1016/s1570-8705(03)00013-1 · Cited by 1,349
Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks
Zhong, S., Chen, J., & Yang, Y. R. (2004) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1209220 · Cited by 1,219
Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks
Buttyán, L., & Hubaux, J.-P. (2003) · Mobile Networks and Applications · doi:10.1023/a:1025146013151 · Cited by 1,068
A Survey of Intrusion Detection Systems in Wireless Sensor Networks
Butun, I., Morgera, S. D., & Sankar, R. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.050113.00191 · Cited by 833
Reputation-based framework for high integrity sensor networks
Ganeriwal, S., Balzano, L. K., & Srivastava, M. B. (2008) · ACM Transactions on Sensor Networks · doi:10.1145/1362542.1362546 · Cited by 808
Metadata
- Authors
- Buchegger, S., & Le Boudec, J.-Y.
- Venue
- Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
- Publisher
- ACM
- Published
- 2002-06-09
- Pages
- 226-236
- OpenAlex
- W2115373791
- Cited by
- 1,495
- References
- 12
- FWCI
- 29.47
- 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.