The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
ROSE: Robustness Strategy for Scale-Free Wireless Sensor Networks
Abstract
Due to the recent proliferation of cyber-attacks, improving the robustness of wireless sensor networks (WSNs), so that they can withstand node failures has become a critical issue. Scale-free WSNs are important, because they tolerate random attacks very well; however, they can be vulnerable to malicious attacks, which particularly target certain important nodes. To address this shortcoming, this paper first presents a new modeling strategy to generate scale-free network topologies, which considers the constraints in WSNs, such as the communication range and the threshold on the maximum node degree. Then, ROSE, a novel robustness enhancing algorithm for scale-free WSNs, is proposed. Given a scale-free topology, ROSE exploits the position and degree information of nodes to rearrange the edges to resemble an onion-like structure, which has been proven to be robust against malicious attacks. Meanwhile, ROSE keeps the degree of each node in the topology unchanged such that the resulting topology remains scale-free. The extensive experimental results verify that our new modeling strategy indeed generates scale-free network topologies for WSNs, and ROSE can significantly improve the robustness of the network topologies generated by our modeling strategy. Moreover, we compare ROSE with two existing robustness enhancing algorithms, showing that ROSE outperforms both.
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
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
An efficient k-means clustering algorithm: analysis and implementation
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1017616 · Cited by 5,660
Cited by
Survey on fog computing: architecture, key technologies, applications and open issues
Hu, P., Dhelim, S., Ning, H., & Qiu, T. (2017) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2017.09.002 · Cited by 877
Self-citationHow Can Heterogeneous Internet of Things Build Our Future: A Survey
Qiu, T., Chen, N., Li, K., Atiquzzaman, M., & Zhao, W. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2803740 · Cited by 444
Self-citationAnalysis on Cascading Reliability of Edge-Assisted Internet of Things
Fu, X., Wang, Y., Yang, Y., & Postolache, O. (2022) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2022.108463 · Cited by 48
Metadata
- Authors
- Qiu, T., Zhao, A., Xia, F., Si, W., & Wu, D. O.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2017-10
- Volume
- 25
- Issue
- 5
- Pages
- 2944-2959
- ISSN
- 1063-6692 (ISSN-L)
- 1558-2566
- OpenAlex
- W2695737732
- Cited by
- 185
- References
- 2
- FWCI
- 19.81
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: ROSE: Robustness Strategy for Scale-Free Wireless Sensor Networks. https://app.cochat.ai/papers/10.1109/tnet.2017.2713530
- The paper
- Qiu, T., Zhao, A., Xia, F., Si, W., & Wu, D. O. (2017). ROSE: Robustness Strategy for Scale-Free Wireless Sensor Networks. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/tnet.2017.2713530
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.