The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks
Abstract
Mobile ad hoc networking has been an active research area for several years. How to stimulate cooperation among selfish mobile nodes, however, is not well addressed yet. In this paper, we propose Sprite, a simple, cheat-proof, credit-based system for stimulating cooperation among selfish nodes in mobile ad hoc networks. Our system provides incentive for mobile nodes to cooperate and report actions honestly. Compared with previous approaches, our system does not require any tamper-proof hardware at any node. Furthermore, we present a formal model of our system and prove its properties. Evaluations of a prototype implementation show that the overhead of our system is small. Simulations and analysis show that mobile nodes can cooperate and forward each other's messages, unless the resource of each node is extremely low.
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
(1994) · Cited by 5,513
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
The MD5 Message-Digest Algorithm
Rivest (1992) · Medical Entomology and Zoology · Cited by 2,853
Zhou, L., & Haas, Z. J. (1999) · IEEE Network · doi:10.1109/65.806983 · Cited by 2,333
Perkins, C. E. (2008) · Cited by 1,889
Roughgarden, T., & Tardos, É. (2002) · Journal of the ACM · doi:10.1145/506147.506153 · Cited by 1,608
Performance analysis of the CONFIDANT protocol
Buchegger, S., & Le Boudec, J.-Y. (2002) · Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing · doi:10.1145/513800.513828 · Cited by 1,495
A secure routing protocol for ad hoc networks
Sanzgiri, K., Dahill, B., Levine, B. N., Shields, C., & Belding-Royer, E. M. (2003) · 10th IEEE International Conference on Network Protocols, 2002. Proceedings. · doi:10.1109/icnp.2002.1181388 · Cited by 1,410
Nisan, N., & Ronen, A. (2001) · Games and Economic Behavior · doi:10.1006/game.1999.0790 · Cited by 1,331
Algorithms, games, and the internet
Papadimitriou, C. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380883 · Cited by 1,085
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
Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2005) · Wireless Networks · doi:10.1007/s11276-004-4744-y · Cited by 1,033
Buchegger, S., & Boudec, J. L. (2002) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 1,026
Ad hoc mobile wireless networks : protocols and systems
Toh, C.-K. (2002) · International Linear Collider · Cited by 1,022
(1996) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/b102605 · Cited by 873
The quest for security in mobile ad hoc networks
Hubaux, J., Buttyán, L., & Capkun, S. (2001) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1145/501436.501437 · Cited by 730
Enforcing service availability in mobile ad-hoc WANs
Buttyán, L., & Hubaux, J. (2000) · doi:10.5555/514151.514164 · Cited by 565
The quest for security in mobile ad hoc networks
Hubaux, J.-P., Buttyán, L., & Capkun, S. (2001) · Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing - MobiHoc '01 · doi:10.1145/501416.501437 · Cited by 453
Sharing the Cost of Multicast Transmissions
Feigenbaum, J., Papadimitriou, C. H., & Shenker, S. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2001.1754 · Cited by 404
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-securing ad hoc wireless networks
Luo, H., Zerfos, P., Kong, J., Lu, S., & Zhang, L. (2003) · Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications · doi:10.1109/iscc.2002.1021731 · Cited by 358
Toward self-organized mobile ad hoc networks: the terminodes project
Hubaux, J.-P., Gross, T., Le Boudec, J.-Y., & Vetterli, M. (2001) · IEEE Communications Magazine · doi:10.1109/35.894385 · Cited by 301
Enforcing service availability in mobile ad-hoc WANs
Buttyan, L., & Hubaux, J.-P. (2002) · 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444) · doi:10.1109/mobhoc.2000.869216 · Cited by 278
Computing the mobility of grain boundaries
Janssens, K. G. F., Olmsted, D., Holm, E. A., Foiles, S. M., Plimpton, S. J., & Derlet, P. M. (2006) · Nature Materials · doi:10.1038/nmat1559 · Cited by 271
TCP congestion control with a misbehaving receiver
Savage, S., Cardwell, N., Wetherall, D., & Anderson, T. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/505696.505704 · Cited by 228
A BGP-based mechanism for lowest-cost routing
Feigenbaum, J., Papadimitriou, C. H., Sami, R., & Shenker, S. J. (2002) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/571825.571856 · Cited by 218
Energy efficient communications in ad hoc networks using directional antennas
Spyropoulos, A., & Raghavendra, C. S. (2003) · Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) · doi:10.1109/infcom.2002.1019263 · Cited by 173
Nisan, N. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49116-3_1 · Cited by 109
Reputation propagation and agreement in mobile ad-hoc networks
Liu, Y., & Yang, Y. (2004) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc.2003.1200610 · Cited by 105
Self-citation
Cited by
Vehicular Fog Computing: A Viewpoint of Vehicles as the Infrastructures
Hou, X., Li, Y., Chen, M., Wu, D., Jin, D., & Chen, S. (2016) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2016.2532863 · Cited by 930
Blockchain for Secure and Efficient Data Sharing in Vehicular Edge Computing and Networks
Kang, J., Yu, R., Huang, X., Wu, M., Maharjan, S., Xie, S., & Zhang, Y. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2875542 · Cited by 798
DeepChain: Auditable and Privacy-Preserving Deep Learning with Blockchain-based Incentive
Weng, J., Weng, J., Zhang, J., Li, M., Zhang, Y., & Luo, W. (2019) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2019.2952332 · Cited by 610
Sensor network security: a survey
Chen, X., Makki, K., Yen, K., & Pissinou, N. (2009) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2009.090205 · Cited by 599
An Acknowledgment-Based Approach for the Detection of Routing Misbehavior in MANETs
Liu, K., Deng, J., Varshney, P. K., & Balakrishnan, K. (2007) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2007.1036 · Cited by 472
Metadata
- Authors
- Zhong, S., Chen, J., & Yang, Y. R.
- Venue
- IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
- Publisher
- IEEE
- Published
- 2004-03-01
- Volume
- 3
- Pages
- 1987-1997
- OpenAlex
- W2122426592
- Cited by
- 1,219
- References
- 29
- FWCI
- 48.06
- 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
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.