LDTS: A Lightweight and Dependable Trust System for Clustered Wireless Sensor Networks
The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Abstract
The resource efficiency and dependability of a trust system are the most fundamental requirements for any wireless sensor network (WSN). However, existing trust systems developed for WSNs are incapable of satisfying these requirements because of their high overhead and low dependability. In this work, we proposed a lightweight and dependable trust system (LDTS) for WSNs, which employ clustering algorithms. First, a lightweight trust decision-making scheme is proposed based on the nodes' identities (roles) in the clustered WSNs, which is suitable for such WSNs because it facilitates energy-saving. Due to canceling feedback between cluster members (CMs) or between cluster heads (CHs), this approach can significantly improve system efficiency while reducing the effect of malicious nodes. More importantly, considering that CHs take on large amounts of data forwarding and communication tasks, a dependability-enhanced trust evaluating approach is defined for cooperations between CHs. This approach can effectively reduce networking consumption while malicious, selfish, and faulty CHs. Moreover, a self-adaptive weighted method is defined for trust aggregation at CH level. This approach surpasses the limitations of traditional weighting methods for trust factors, in which weights are assigned subjectively. Theory as well as simulation results shows that LDTS demands less memory and communication overhead compared with the current typical trust systems for WSNs.
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
An application-specific protocol architecture for wireless microsensor networks
Heinzelman, W. B., Chandrakasan, A. P., & Balakrishnan, H. (2002) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2002.804190 · Cited by 10,565 · cited 3×
“I. INTRODUCTION F OR cluster wireless sensor networks (WSNs) such asLEACH [1], EEHC [2], EC [3], and HEED [4], clustering algorithms can effectively improve network scalability and throughput.”
BackgroundMethodHEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks
Younis, O., & Fahmy, S. (2004) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2004.41 · Cited by 5,025 · cited 4×
“I. INTRODUCTION F OR cluster wireless sensor networks (WSNs) such asLEACH [1], EEHC [2], EC [3], and HEED [4], clustering algorithms can effectively improve network scalability and throughput.”
BackgroundMethodInfluentialSPINS: Security Protocols for Sensor Networks
Perrig, A., Szewczyk, R., Tygar, J. D., Wen, V., & Culler, D. E. (2002) · Wireless Networks · doi:10.1023/a:1016598314198 · Cited by 2,264
TinySec: a link layer security architecture for wireless sensor networks
Karlof, C., Sastry, N., & Wagner, D. (2004) · Proceedings of the 2nd international conference on Embedded networked sensor systems · doi:10.1145/1031495.1031515 · Cited by 1,612
LEAP: efficient security mechanisms for large-scale distributed sensor networks
Zhu, S., Setia, S., & Jajodia, S. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948120 · Cited by 1,117
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
Fundamentals of Wireless Sensor Networks: Theory and Practice
Dargie, W., & Poellabauer, C. (2010) · Cited by 806
Fundamentals of Wireless Sensor Networks: Theory and Practice
Dargie, W., & Poellabauer, C. (2010) · Wiley eBooks · doi:10.1002/9780470666388 · Cited by 747 · cited 1×
“However, to uniquely identify nodes and to perform communication in such environments, a class-based addressing scheme [22] is used, in which a node is identified by a triplet”
MethodPowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing
Zhou, R., & Hwang, K. (2007) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2007.1021 · Cited by 728
Information theoretic framework of trust modeling and evaluation for ad hoc networks
Sun, Y. L., Yu, W., Han, Z., & Liu, K. J. R. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.861389 · Cited by 614
Reputation-based framework for high integrity sensor networks
Ganeriwal, S., & Srivastava, M. B. (2004) · Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks · doi:10.1145/1029102.1029115 · Cited by 583 · cited 1×
“A number of studies have proposed such systems for WSNs [5], [10]–[12], [19], [21].”
BackgroundFiltering Out Unfair Ratings in Bayesian Reputation Systems
Whitby, A., Jøsang, A., & Indulska, J. (2004) · Cited by 570
On trust models and trust evaluation metrics for ad hoc networks
Theodorakopoulos, G., & Baras, J. S. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.861390 · Cited by 511 · cited 1×
“, [15]–[18]) or an integer between 0 and 100 (e.”
BackgroundZhu, S., Setia, S. K., & Jajodia, S. (2003) · doi:10.1145/948117.948120 · Cited by 480
Bao, F., Chen, I.-R., Chang, M., & Cho, J.-H. (2012) · IEEE Transactions on Network and Service Management · doi:10.1109/tcomm.2012.031912.110179 · Cited by 450
Group-Based Trust Management Scheme for Clustered Wireless Sensor Networks
Shaikh, R. A., Jameel, H., d'Auriol, B. J., Lee, H., Lee, S., & Song, Y.-J. (2009) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2008.258 · Cited by 340 · cited 10×
“Although presenting the trust values as a real number or an integer may be insignificant in traditional networks, this issue is of critical importance for WSNs because of limited memory as well as transmission and reception power [8].”
BackgroundMethodInfluentialA Survey of Trust and Reputation Management Systems in Wireless Communications
Yu, H., Shen, Z., Miao, C., Leung, C., & Niyato, D. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2059690 · Cited by 297 · cited 1×
“A trust system should be lightweight to serve a large number of resource-constrained nodes in terms of accuracy, convergence speed, and additional overhead [7], [8], [10].”
BackgroundTrust-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 · cited 5×
“Based on an integrated comparison, a number of innovative works have been developed for clusteredWSNs, such as GTMS [8], TCHEM [13], HTMP [9], ATRM [20].”
BackgroundMethodInfluentialDefense of trust management vulnerabilities in distributed networks
Sun, Y. L., Han, Z., & Liu, K. J. R. (2008) · IEEE Communications Magazine · doi:10.1109/mcom.2008.4473092 · Cited by 282
A Framework for Trust-based Cluster Head Election in Wireless Sensor Networks
Crosby, G. V., Pissinou, N., & Gadze, J. D. (2006) · doi:10.1109/dssns.2006.1 · Cited by 147 · cited 7×
“We assume that all nodes have unique identities, which is similar to the assumptions of [8], [9], and [13].”
BackgroundMethodInfluentialAnalysis of ratings on trust inference in open environments
Liang, Z., & Shi, W. (2007) · Performance Evaluation · doi:10.1016/j.peva.2007.04.001 · Cited by 122 · cited 5×
“Inspired by [28], [29], we use an enhanced beta probability density function to compute for BS-to-CH feedback trust:”
BackgroundMethodInfluentialA multi-dimensional trust evaluation model for large-scale P2P computing
Li, X., Zhou, F., & Yang, X. (2011) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2011.01.007 · Cited by 86 · cited 1×
“How to avoid the effect of individual favoritism on the weight allocation of trust sources is a key task of trust management [23], [24], [28].”
BackgroundSelf-citationRezgui, A., & Eltoweissy, M. (2009) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2008.94 · Cited by 26
TRECON: A Trust-Based Economic Framework for Efficient Internet Routing
Liang, Z., & Shi, W. (2009) · IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans · doi:10.1109/tsmca.2009.2030730 · Cited by 15 · cited 1×
“, [15]–[18]) or an integer between 0 and 100 (e.”
Background
Cited by
Trust-based recommendation systems in Internet of Things: a systematic literature review
Mohammadi, V., Rahmani, A. M., Darwesh, A. M., & Sahafi, A. (2019) · Human-centric Computing and Information Sciences · doi:10.1186/s13673-019-0183-8 · Cited by 185
“Although experimental simulation depicted the scheme’s prosperity in keeping low data energy loss, whilst not negatively undermining delivery ratio and coverage, but no direct comparison with chosen trust schemes; lightweight and dependable trust system [63] and lightweight group-based trust management [64] revealed t…”
BackgroundRani, R., Kumar, S., & Dohare, U. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2917763 · Cited by 65
“A lightweight and dependable trust system for clustered WSNs (LDTS) has been proposed while focusing on the reduction of the communication overhead [31].”
Background
Metadata
- Authors
- Li, X., Zhou, F., & Du, J.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2013-06
- Volume
- 8
- Issue
- 6
- Pages
- 924-935
- ISSN
- 1556-6013 (ISSN-L)
- 1556-6021
- OpenAlex
- W1997023312
- Cited by
- 222
- References
- 24
- FWCI
- 28.64
- 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.