The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Transactions papers a routing-driven Elliptic Curve Cryptography based key management scheme for Heterogeneous Sensor Networks
Abstract
Previous research on sensor network security mainly considers homogeneous sensor networks, where all sensor nodes have the same capabilities. Research has shown that homogeneous ad hoc networks have poor performance and scalability. The many-to-one traffic pattern dominates in sensor networks, and hence a sensor may only communicate with a small portion of its neighbors. Key management is a fundamental security operation. Most existing key management schemes try to establish shared keys for all pairs of neighbor sensors, no matter whether these nodes communicate with each other or not, and this causes large overhead. In this paper, we adopt a Heterogeneous Sensor Network (HSN) model for better performance and security. We propose a novel routing-driven key management scheme, which only establishes shared keys for neighbor sensors that communicate with each other. We utilize Elliptic Curve Cryptography in the design of an efficient key management scheme for sensor nodes. The performance evaluation and security analysis show that our key management scheme can provide better security with significant reductions on communication overhead, storage space and energy consumption than other key management schemes.
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
The capacity of wireless networks
Gupta, P., & Kumar, P. R. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825799 · Cited by 8,292
GPSR: greedy perimeter stateless routing for wireless networks
Karp, B., & Kung, H. T. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345953 · Cited by 7,050
Koblitz, N. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866109-5 · Cited by 5,634
A key-management scheme for distributed sensor networks
Eschenauer, L., & Gligor, V. D. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586117 · Cited by 3,541
Random key predistribution schemes for sensor networks
Chan, H., Perrig, A., & Song, D. (2004) · Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) · doi:10.1109/secpri.2003.1199337 · Cited by 2,826
Elliptic Curves in Cryptography
Blake, I. F., Seroussi, G., & Smart, N. P. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9781107360211 · Cited by 1,828
Next century challenges: mobile networking for “Smart Dust”
Kahn, J. M., Katz, R. H., & Pister, K. S. J. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313558 · Cited by 1,660
A key-management scheme for distributed sensor networks
Eschenauer, L., & Gligor, V. D. (2002) · Proceedings of the 9th ACM conference on Computer and communications security - CCS '02 · doi:10.1145/586115.586117 · Cited by 1,442
Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs
Gura, N., Patel, A., Wander, A., Eberle, H., & Shantz, S. C. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28632-5_9 · Cited by 1,212
A Course in Number Theory and Cryptography
Koblitz, N. (1987) · Graduate Texts in Mathematics · doi:10.1007/978-1-4684-0310-7 · Cited by 839
A Course in Number Theory and Cryptography
Koblitz, N. (1994) · Graduate Texts in Mathematics · doi:10.1007/978-1-4419-8592-7 · Cited by 576
Exploiting heterogeneity in sensor networks
Yarvis, M., Kushafnagar, N., Singh, H., Rangarajan, A., Lin, Y., & Singh, S. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498318 · Cited by 491
SeRLoc: secure range-independent localization for wireless sensor networks
Lazos, L., & Poovendran, R. (2004) · Proceedings of the 3rd ACM workshop on Wireless security · doi:10.1145/1023646.1023650 · Cited by 423
Maintaining Differentiated Coverage in Heterogeneous Sensor Networks
Du, X., & Lin, F. (2005) · EURASIP Journal on Wireless Communications and Networking · doi:10.1155/wcn.2005.565 · Cited by 125
Self-citation
Cited by
Shafiq, M., Tian, Z., Bashir, A. K., Du, X., & Guizani, M. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3002255 · Cited by 541
Self-citationA Survey on Access Control in the Age of Internet of Things
Qiu, J., Tian, Z., Du, C., Zuo, Q., Su, S., & Fang, B. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2969326 · Cited by 458
Shen, M., Tang, X., Zhu, L., Du, X., & Guizani, M. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2901840 · Cited by 443
Self-citationVehicular Fog Computing: Enabling Real-Time Traffic Management for Smart Cities
Ning, Z., Huang, J., & Wang, X. (2019) · IEEE Wireless Communications · doi:10.1109/mwc.2019.1700441 · Cited by 425
Guan, Z., Si, G., Zhang, X., Wu, L., Guizani, N., Du, X., & Ma, Y. (2018) · IEEE Communications Magazine · doi:10.1109/mcom.2018.1700401 · Cited by 367
Self-citation
Metadata
- Authors
- Du, X., Guizani, M., Xiao, Y., & Chen, H.-H.
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2009-03
- Volume
- 8
- Issue
- 3
- Pages
- 1223-1229
- ISSN
- 1536-1276 (ISSN-L)
- OpenAlex
- W2114337635
- Cited by
- 380
- References
- 14
- FWCI
- 16.55
- 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.