The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
SMART: A Secure Multilayer Credit-Based Incentive Scheme for Delay-Tolerant Networks
Abstract
Delay-tolerant networks (DTNs) provide a promising solution to support wide-ranging applications in the regions where end-to-end network connectivity is not available. In DTNs, the intermediate nodes on a communication path are expected to store, carry, and forward the in-transit messages (or bundles) in an opportunistic way, which is called opportunistic data forwarding. Such a forwarding method depends on the hypothesis that each individual node is ready to forward packets for others. This assumption, however, might easily be violated due to the existence of selfish or even malicious nodes, which may be unwilling to waste their precious wireless resources to serve as bundle relays. To address this problem, we propose a secure multilayer credit-based incentive scheme to stimulate bundle forwarding cooperation among DTN nodes. The proposed scheme can be implemented in a fully distributed manner to thwart various attacks without relying on any tamperproof hardware. In addition, we introduce several efficiency optimization techniques to improve the overall efficiency by exploiting the unique characteristics of DTNs. Extensive simulations demonstrate the efficacy and efficiency of the proposed scheme.
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
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_13 · Cited by 7,060
Epidemic routing for partially-connected ad hoc networks
Vahdat, A. M. (2000) · Cited by 4,133
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
Probabilistic routing in intermittently connected networks
Lindgren, A., Doria, A., & Schelén, O. (2003) · ACM SIGMOBILE Mobile Computing and Communications Review · doi:10.1145/961268.961272 · Cited by 2,288
Routing in a delay tolerant network
Jain, S., Fall, K., & Patra, R. K. (2004) · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) · doi:10.1145/1015467.1015484 · Cited by 1,779
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
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0314-9 · Cited by 1,467
Protocols for Public Key Cryptosystems
Merkle, R. C. (1980) · 1980 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1980.10006 · Cited by 1,418 · cited 1×
“The Merkle tree [33] (also called the binary hash tree) is a complete binary tree equipped with a function hash and an assignment Ω, which maps a set of nodes to a set of fixedsize strings.”
BackgroundSprite: 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
Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case
Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.897962 · Cited by 1,108
Buchegger, S., & Boudec, J. L. (2002) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 1,026
An Identity-Based Signature from Gap Diffie-Hellman Groups
Choon, J. C., & Hee Cheon, J. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36288-6_2 · Cited by 917
Bubble rap: social-based forwarding in delay tolerant networks
Hui, P., Crowcroft, J., & Yoneki, E. (2008) · Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing · doi:10.1145/1374618.1374652 · Cited by 814
Cui, J.-H., Kong, J., Gerla, M., & Zhou, S. (2006) · IEEE Network · doi:10.1109/mnet.2006.1637927 · Cited by 783
ECPP: Efficient Conditional Privacy Preservation Protocol for Secure Vehicular Communications
Lu, R., Lin, X., Zhu, H., Ho, P.-H., & Shen, X. (2008) · IEEE INFOCOM 2008 - The 27th Conference on Computer Communications · doi:10.1109/infocom.2008.179 · Cited by 724
Self-citationEfficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case
Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.897964 · Cited by 645
Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms
Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R., & Scott, J. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.172 · Cited by 584
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks
Zhao, J., & Cao, G. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.298 · Cited by 486
SORI: a secure and objective reputation-based incentive scheme for ad-hoc networks
He, Q., Wu, D., & Khosla, P. (2004) · 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733) · doi:10.1109/wcnc.2004.1311293 · Cited by 409
Security in vehicular ad hoc networks
Lin, X., Lu, R., Zhang, C., Zhu, H., Ho, P.-H., & Shen, X. (2008) · IEEE Communications Magazine · doi:10.1109/mcom.2008.4481346 · Cited by 342
Self-citationNash equilibria of packet forwarding strategies in wireless ad hoc networks
Felegyhazi, M., Hubaux, J.-P., & Buttyan, L. (2006) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2006.68 · Cited by 321
Secure incentives for commercial ad dissemination in vehicular networks
Lee, S.-B., Pan, G., Park, J., Gerla, M., & Lu, S. (2007) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1145/1288107.1288128 · Cited by 149
Anonymity and security in delay tolerant networks
Kate, A., Zaverucha, G., & Hengartner, U. (2007) · Security and Privacy in Communication Networks · doi:10.1109/seccom.2007.4550373 · Cited by 148
A secure incentive protocol for mobile ad hoc networks
Zhang, Y., Lou, W., Liu, W., & Fang, Y. M. (2006) · Wireless Networks · doi:10.1007/s11276-006-6220-3 · Cited by 127
Practical security for disconnected nodes
Seth, A., & Keshav, S. (2005) · IEEE Workshop on Secure Network Protocols (NPSec) · doi:10.1109/npsec.2005.1532050 · Cited by 110
A Fine-Grained Reputation System for Reliable Service Selection in Peer-to-Peer Networks
Zhang, Y., & Fang, Y. M. (2007) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2007.1043 · Cited by 106
Zhong, S., Li, L. E., Liu, Y. G., & Yang, Y. R. (2006) · Wireless Networks · doi:10.1007/s11276-006-9855-1 · Cited by 100
Security in service-oriented vehicular networks
Zhu, H., Lu, R., Shen, X., & Lin, X. (2009) · IEEE Wireless Communications · doi:10.1109/mwc.2009.5281251 · Cited by 99
Self-citationSLAB: A secure localized authentication and billing scheme for wireless mesh networks
Zhu, H., Lin, X., Lu, R., Ho, P., & Shen, X. (2008) · IEEE Transactions on Wireless Communications · doi:10.1109/t-wc.2008.07418 · Cited by 80
Self-citation
Cited by
Security and Privacy for Cloud-Based IoT: Challenges
Zhou, J., Cao, Z., Dong, X., & Vasilakos, A. V. (2017) · IEEE Communications Magazine · doi:10.1109/mcom.2017.1600363cm · Cited by 652
A Survey of Social-Based Routing in Delay Tolerant Networks: Positive and Negative Social Effects
Zhu, Y., Xu, B., Shi, X., & Wang, Y. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2012.032612.00004 · Cited by 295
The Security of Big Data in Fog-Enabled IoT Applications Including Blockchain: A Survey
Tariq, N., Asim, M., Al-Obeidat, F., Zubair Farooqi, M., Baker, T., Hammoudeh, M., & Ghafir, I. (2019) · Sensors · doi:10.3390/s19081788 · Cited by 268
Metadata
- Authors
- Zhu, H., Lin, X., Lu, R., Fan, Y., & Shen, X.
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 2009-10
- Volume
- 58
- Issue
- 8
- Pages
- 4628-4639
- ISSN
- 0018-9545 (ISSN-L)
- 1939-9359
- OpenAlex
- W2162960057
- Cited by
- 284
- References
- 29
- FWCI
- 23.08
- Type
- journal article
- 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.