Fault tolerance in collaborative sensor networks for target detection
The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Abstract
Collaboration in sensor networks must be fault-tolerant due to the harsh environmental conditions in which such networks can be deployed. We focus on finding algorithms for collaborative target detection that are efficient in terms of communication cost, precision, accuracy, and number of faulty sensors tolerable in the network. Two algorithms, namely, value fusion and decision fusion, are identified first. When comparing their performance and communication overhead, decision fusion is found to become superior to value fusion as the ratio of faulty sensors to fault free sensors increases. As robust data fusion requires agreement among nodes in the network, an analysis of fully distributed and hierarchical agreement is also presented. The impact of hierarchical agreement on communication cost and system failure probability is evaluated and a method for determining the number of tolerable faults is identified.
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
Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002) · IEEE Communications Magazine · doi:10.1109/mcom.2002.1024422 · Cited by 13,644
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Empirical formula for propagation loss in land mobile radio services
Hata, M. (1980) · IEEE Transactions on Vehicular Technology · doi:10.1109/t-vt.1980.23859 · Cited by 2,789
Probability and Random Processes
(2004) · Elsevier eBooks · doi:10.1016/b978-0-12-172651-5.x5000-3 · Cited by 2,535
Reaching Agreement in the Presence of Faults
Pease, M., Shostak, R., & Lamport, L. (1980) · Journal of the ACM · doi:10.1145/322186.322188 · Cited by 2,359 · cited 1×
“There is a t-Byzantine resilient synchronous protocol without authentication which solves the generals problem if and only if t=N 1 = 3 [21].”
BackgroundStatistical signal processing : detection, estimation, and time series analysis
Scharf, L. L., & Demeure, C. J. (1991) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 2,158
Distributed Detection and Data Fusion
Varshney, P. K. (1997) · Springer eBooks · doi:10.1007/978-1-4612-1904-0 · Cited by 1,788 · cited 3×
“The Neyman-Pearson criterion can be used to find optimum local and global decision rules that minimize the global probability of miss P M assuming that the global probability of false alarm P F is below a given bound (cid:1) [27].”
BackgroundMethodInfluentialMathematical Techniques in Multisensor Data Fusion
Hall, D. L. (1992) · Cited by 1,356
Distributed detection with multiple sensors I. Fundamentals
Viswanathan, R., & Varshney, P. K. (1997) · Proceedings of the IEEE · doi:10.1109/5.554208 · Cited by 1,066 · cited 1×
“Figure 3 illustrates the sensor network parallel topology w here sensors measure a signal produced by a phenomenon [ 28 ].”
BackgroundDistributed detection with multiple sensors I. Advanced topics
Blum, R. S., Kassam, S. A., & Poor, H. V. (1997) · Proceedings of the IEEE · doi:10.1109/5.554209 · Cited by 727 · cited 1×
“ples being the sign detector and the Wilcoxon detector [ 2 , 12].”
Method
Cited by
A Survey of Fault Management in Wireless Sensor Networks
Paradis, L., & Han, Q. (2007) · Journal of Network and Systems Management · doi:10.1007/s10922-007-9062-0 · Cited by 385
On the Optimal Robot Routing Problem in Wireless Sensor Networks
Yuan, B., Orlowska, M., & Sadiq, S. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.1062 · Cited by 270
Localized Outlying and Boundary Data Detection in Sensor Networks
Wu, W., Cheng, X., Ding, M., Xing, K., Liu, F., & Deng, P. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.1067 · Cited by 245
Dependable Structural Health Monitoring Using Wireless Sensor Networks
Bhuiyan, M. Z. A., Wang, G., Wu, J., Cao, J., Liu, X., & Wang, T. (2017) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2015.2469655 · Cited by 210
“Although dependability support by fault detection and tolerance problem in SHM looks similar to the problem of making binary “0/1” detection decisions or value fusions [4], [15], [16], it is fundamentally different from them.”
BackgroundInfluentialDistributed Detection in the Presence of Byzantine Attacks
Marano, S., Matta, V., & Tong, L. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2007335 · Cited by 186
“While there is a vast literature on secure networking for general ad hoc and sensor networks, see, e.g., [7] and references therein, reported work on distributed detection and data fusion in the presence of Byzantine sensors is still limited, see [8]–[10].”
BackgroundSparse target counting and localization in sensor networks based on compressive sensing
Zhang, B., Cheng, X., Zhang, N., Cui, Y., Li, Y., & Liang, Q. (2011) · 2011 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2011.5935041 · Cited by 169
“Then the following target energy decay model [6], [24] can be adopted, which states that the signal energy at location j for a target at location i is roughly approximated by:”
Metadata
- Authors
- Clouqueur, T., Saluja, K. K., & Ramanathan, P.
- Venue
- IEEE Transactions on Computers
- Published
- 2004-03
- Volume
- 53
- Issue
- 3
- Pages
- 320-333
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2160597340
- Cited by
- 252
- References
- 22
- FWCI
- 20.82
- 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.