The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Cost-Efficient Strategies for Restraining Rumor Spreading in Mobile Social Networks
Abstract
With the popularity of mobile devices, mobile social networks (MSNs) have become an important platform for information dissemination. However, the spread of rumors in MSNs present a massive social threat. Currently, there are two kinds of methods to address this: blocking rumors at influential users and spreading truth to clarify rumors. However, most existing works either overlook the cost of various methods or only consider different methods individually. This paper proposes a heterogeneous-network-based epidemic model that incorporates the two kinds of methods to describe rumor spreading in MSNs. Moreover, two cost-efficient strategies are designed to restrain rumors. The first strategy is the real-time optimization strategy that minimizes the rumor-restraining cost by optimally combining various rumor-restraining methods such that a rumor can be extinct within an expected time period. The second strategy is the pulse spreading truth and continuous blocking rumor strategy that restrains rumor spreading through spreading truth periodically. The two strategies can restrain rumors in a continuous or periodical manner and guarantee cost efficiency. The experiments toward the Digg2009 data set demonstrate the effectiveness of the proposed model and the efficiency of the two strategies.
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
Error and attack tolerance of complex networksPreprint
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · Cited by 6,467
Ordinary Differential Equations
Hartman, P. E. (2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719222 · Cited by 3,577
Elementary Stability and Bifurcation Theory
Iooss, G., & Joseph, D. D. (1980) · Undergraduate Texts in Mathematics · doi:10.1007/978-1-4684-9336-8 · Cited by 1,298
Efficient Immunization Strategies for Computer Networks and Populations
Cohen, R., Havlin, S., & ben-Avraham, D. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.247901 · Cited by 1,162
Epidemic outbreaks in complex heterogeneous networksPreprint
Moreno, Y., Pastor‐Satorras, R., & Vespignani, A. (2002) · Cited by 823
Epidemic outbreaks in complex heterogeneous networks
Moreno, Y., Pastor-Satorras, R., & Vespignani, A. (2002) · The European Physical Journal B · doi:10.1140/epjb/e20020122 · Cited by 755
DALEY, D. J., & KENDALL, D. G. (1965) · IMA Journal of Applied Mathematics · doi:10.1093/imamat/1.1.42 · Cited by 556
Why rumors spread so quickly in social networks
Doerr, B., Fouz, M., & Friedrich, T. (2012) · Communications of the ACM · doi:10.1145/2184319.2184338 · Cited by 357
Containment of misinformation spread in online social networks
Nguyen, N. P., Yan, G., Thai, M. T., & Eidenbenz, S. (2012) · Proceedings of the 4th Annual ACM Web Science Conference · doi:10.1145/2380718.2380746 · Cited by 239
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
Cai, Z., He, Z., Guan, X., & Li, Y. (2016) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2016.2613521 · Cited by 528
Self-citationA survey on security and privacy issues of blockchain technology
Prashanth Joshi, A., K. S. U., Han, M., & Wang, Y. (2018) · Mathematical Foundations of Computing · doi:10.3934/mfc.2018007 · Cited by 362
“The work of [2] focused on the vulnerabilities of blockchain cloud [56, 7, 20].”
Background
Metadata
- Authors
- He, Z., Cai, Z., Yu, J., Wang, X., Sun, Y., & Li, Y.
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 2017-03
- Volume
- 66
- Issue
- 3
- Pages
- 2789-2800
- ISSN
- 0018-9545 (ISSN-L)
- 1939-9359
- OpenAlex
- W2472664708
- Cited by
- 277
- References
- 20
- FWCI
- 22.48
- 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: Cost-Efficient Strategies for Restraining Rumor Spreading in Mobile Social Networks. https://app.cochat.ai/papers/10.1109/tvt.2016.2585591
- The paper
- He, Z., Cai, Z., Yu, J., Wang, X., Sun, Y., & Li, Y. (2017). Cost-Efficient Strategies for Restraining Rumor Spreading in Mobile Social Networks. IEEE Transactions on Vehicular Technology. https://doi.org/10.1109/tvt.2016.2585591
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.