Abstract
Mobile Opportunistic Networks (MONs) are effective solutions to uphold communications in the situations where traditional communication networks are unavailable. In MONs, messages can be disseminated among mobile nodes in an epidemic and delay-tolerant manner. However, MONs can be abused to disseminate misinformation causing undesirable effects in the general public, such as panic and misunderstanding. To deal with this issue, we first propose a formal model to formulate the process of misinformation propagation in MONs, considering human psychological behaviors. Secondly, we explore a general framework to describe the random node mobility, and derive a new contact rate between nodes, which is closely related to mobility properties of nodes. Thirdly, we propose a novel approach based on vaccination and treatment strategies for inhibiting misinformation propagation in human MONs. Moreover, a novel pulse control model of misinformation propagation is developed. Finally, through the derivation and stability analysis of a misinformation-free period solution of the proposed model, we obtain a threshold upon which misinformation dies out in a human MON. The extensive simulation results validate our theoretical analysis.






















Similar content being viewed by others
References
Wang Y, Chuah MC, Chen Y (2014) Incentive based data sharing in delay tolerant mobile networks. IEEE Trans Wirel Commun 13(1):370–381
Conti M, Giordano S (2014) Mobile ad hoc networking: milestones, challenges, and new research directions. IEEE Commun Mag 52(1):85–96
Chen K, Shen H, Zhang H (2014) Leveraging social networks for P2P content-based file sharing in disconnected MANETs. IEEE Trans Mobile Comput 13(2):235–249
Teng J, Zhang B, Li X, Bai X, Xuan D (2014) E-shadow: lubricating social interaction using mobile phones. IEEE Trans Comput 63(6):1422–1433
Chandrima C, Ananya B, Siuli R (2014) An observer-based distributed scheme for selfish-node detection in a post-disaster communication environment using delay tolerant network. In: Proceedings IEEE int’l conf. applications and innovations in mobile computing (AIMoC’14), pp 151–156
Wu J, Wang Y (2014) Hypercube-based multipath social feature routing in human contact networks. IEEE Trans Comput 63(2):383–396
Kumar KK, Geethakumari G (2013) Information diffusion model for spread of misinformation in online social networks. In: Proceedings IEEE int’l conf. advances in computing, communications and informatics (ICACCI’13), pp 1172–1177
Zhou L, Zhang D (2007) An ontology-supported misinformation model: toward a digital misinformation library. IEEE Trans Syst Man Cybern A 37(5):804–813
Basso J (1997) How public relations professionals are managing the potential for sabotage, rumors, and misinformation disseminated via the internet by computer hackers. IEEE Trans Prof Commun 40(1):28–33
Ma CYT, Yau DKY, Lou X, Rao NSV (2013) Markov game analysis for attack-defense of power networks under possible misinformation. IEEE Trans Power Syst 28(2):1676–1686
He Z, Cai Z, Wang X (2015) Modeling propagation dynamics and optimal countermeasures of the social network rumors The 35th IEEE international conference on distributed computing systems (ICDCS)
Wang X, He Z, Zhao X, Chuang L, Pan Y, Cai Z (2013) Reaction-Diffusion modeling of malware propagation in mobile wireless sensor networks. Sci China Inf Sci 56(9):1–18
Wang X, Lin Y, Zhang S, Cai Z A social activity and physical contact based routing algorithm in mobile opportunistic networks for emergency response of sudden disasters. Enterprise Information Systems
Wang X, Zhao Y, Liang Y, Cai Z (2015) A double pulse control strategy for misinformation propagation in human mobile opportunistic networks the 10th international conference on wireless algorithms, systems and applications (WASA), pp 571– 580
Lewandowsky S, Ecker1 UKH, Seifert CM, Schwarz N, Cook J (2012) Misinformation and its correction: continued influence and successful debiasing”. Psychol Sci Publ Int 13(3):106– 131
Trifunovic S, Kurant M, Hummela KA, Legendre F (2014) Preventing spam in opportunistic networks. Comput Commun 41(15):31–42
Nguyen NP, Yan G, Thai MT (2013) Analysis of misinformation containment in online social networks. Comput Netw 57(10):2133–2146
Li Y, Hui P, Jin D, Su L, Zeng L (2014) Optimal distributed malware defense in mobile networks with heterogeneous devices. IEEE Trans Mobile Comput 13(2):377–391
Peng W, Li F, Zou X, Wu J (2014) Behavioral malware detection in delay tolerant networks. IEEE Trans Parall Distr 25(1):53– 63
Liu X, Takeuchi Y, Iwami S (2008) SVIR epidemic models with vaccination strategies. J Theor Biol 253(1):1–11
He Y, Gao S, Xie D (2013) An SIR epidemic model with time-varying pulse control schemes and saturated infectious force. Appl Math Model 37(16):8131–8140
Yang Y (2015) Global stability of VEISV propagation modeling for network worm attack. Appl Math Model 39(2):776–780
Zhu Q, Yang X, Ren J (2012) Modeling and analysis of the spread of computer virus. Commun Nonlinear Sci Numer Simulat 17(12):5117–5124
Gan C, Yang X, Zhu Q, Jin J, He L (2013) The spread of computer virus under the effect of external computers. Nonlinear Dynam 73(3):1615–1620
Gan C, Yang X, Liu W, Zhu Q (2014) A propagation model of computer virus with nonlinear vaccination probability. Commun Nonlinear Sci Numer Simulat 19(1):92–100
Mishra BK, Saini DK (2010) SEIQRS model for the transmission of malicious objects in computer network. Appl Math Model 34(3):710–715
Ahn I, Ohb HC, Park J (2015) Investigation of the C-SEIRA model for controlling malicious code infection in computer networks. Appl Math Model. (online)
Mishra BK, Pandey SK (2014) Dynamic model of worm propagation in computer network. Appl Math Model 38(7):2173– 2179
Feng L, Liao X, Han Q, Li H (2013) Dynamical analysis and control strategies on malware propagation model. Appl Math Model 37(16):8225–8236
Nie L, Tenga Z, Torres A (2012) Dynamic analysis of an SIR epidemic model with state dependent pulse vaccination. Nonlinear Anal RWA 13(4):1621–1629
Yang L, Yang X (2013) The pulse treatment of computer viruses: a modeling study. Comput Netw 76 (2):1379–1393
Li Y, Hui P, Jin D, Sheng C (2015) Delay-tolerant network protocol testing and evaluation. IEEE Commun Mag 53(1):258–266
Bettstetter C, Resta G, Santi P (2003) The node distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Trans Mobile Comput 2(3):257–269
Lakshmikantham V, Bainov DD, Simeonov SP (1989) Theory of impulsive differential equations. World Scientific, Singapore
Acknowledgments
This work is supported by the National Natural Science Foundation of China (Grant Nos. 61373083, 61402273); the Fundamental Research Funds for the Central Universities of China (Grant No. GK201401002); the Program of Shaanxi Science and Technology Innovation Team of China (Grant No. 2014KTC-18); and the Natural Science Basis Research Plan in Shaanxi Province of China under Grant No. 2014JQ8353.
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix A Proof of Theorem 1
We first consider the existence of the misinformation-free solution of system (6), and then prove the globally asymptotically stability of this solution. From the second equation of system (7), considering the fact that the initial value of r(t) in a pulse period (k τ,(k+1)τ] is r(k τ +), we have
From equations (8) and (12), we have
Thus, s((k+1)τ)=1−r(k τ +)e −(η + δ)τ and r((k+1)τ) = r(k τ +)e −(η + δ)τ. Furthermore, s((k+1)τ +)=(1−σ 1)[1−r(k τ +)e −(η + δ)τ] and r((k+1)τ +) = r(k τ +)e −(η + δ)τ + σ 1[1−r(k τ +)e −(η + δ)τ]. Now, let y k = r(k τ +). Then, we have
For equation (14), let y k+1 = y k = y. Then, we have the only fixed point of equation (14) \(\widetilde {y}=\frac {\sigma _{1}}{1-(1-\sigma _{1})e^{-(\eta +\delta )\tau }}\). Thus, there exists the only τ-period solution of system (7) \((\widetilde {s}(t), \widetilde {r}(t))\), where \(\widetilde {r}(t)=\widetilde {y}e^{-(\eta +\delta )(t-k\tau )}, \widetilde {s}(t)=1-\widetilde {r}(t)=1-\widetilde {y}e^{-(\eta +\delta )(t-k\tau )}\), and k τ<t≤(k+1)t. Moreover, the solution \((\widetilde {s}(t), \widetilde {r}(t))\) is globally asymptotically stable [34].
Appendix B Proof of Theorem 2
Proof
We rewrite matrix J as follows:
where
and
□
Matrix W is rewritten as
where \(W_{1} = \left (\begin {array}{cc} {1 - \sigma _{1} } & 0 \\ {\sigma _{1} } & 1 \end {array}\right )\), \(W_{2} = \left (\begin {array}{cc} 1 & 0 \\ 0 & {1 - \sigma _{2} } \end {array}\right )\), and \(B_{2} = \left (\begin {array}{cc} 0 & 0 \\ 0 & {\sigma _{2} } \end {array} \right )\). Obviously, W has four eigenvalues χ 1, χ 2, χ 3, and χ 4. According to the Fluoquet theory [34], the necessary and sufficient conditions that the misinformation-free τ-period solution of system (6) is locally asymptotically stable are |χ 1|<1, |χ 2|<1, |χ 3|<1, and |χ 4|<1. To check the above conditions, we integrate equation (10) in pulse period [0,τ] to obtain \(\Phi (\tau ) = e^{{\int }_{0}^{\tau } {J(t)dt} }\). Then we have
where \(e^{{\int }_{0}^{\tau } {A_{1} dt} } = \left (\begin {array}{cc} {e^{- \delta \tau } } & {\eta \tau e^{- \delta \tau } } \\ 0 & {e^{- (\delta + \eta )\tau } } \end {array}\right )\overset {\Delta }{=} \Phi _{11}\). As a result, we have
Hence, χ 1 and χ 2 are the eigenvalues of W 1Φ11, and χ 3 and χ 4 are the eigenvalues of W 2Φ22. In fact, χ 1 and χ 2 are the solutions of the following equation
where U is a unit matrix. We have
From equation (15), we obtain the following equation
Through solving equation (16), we obtain
where C=(1−σ 1 + σ 1 η τ + e −ητ)2−4(1−σ 1)e −ητ. Obviously, we have |χ 1|<1 and |χ 2|<1. Next, let ψ= max{|χ 3|,|χ 4|}. Then, we say that the misinformation-free τ-period solution of system (6), denoted as \((\widetilde {s}(t),0,0,\widetilde {r}(t))\), is locally asymptotically stable when ψ<1.
Appendix C Proof of Theorem 4
Proof
From the first equation and the fourth equation of system (6), we obtain
Let \(X = W_{2} e^{{\int }_{0}^{\tau } {Zdt} }\), where \(Z = \left (\begin {array}{ll} - \lambda + \theta + \delta & \alpha \mu (\tilde s(t) + \varepsilon _{1} )\\ \lambda & \beta \mu (\tilde s(t) + \varepsilon _{1} ) - \varepsilon - \delta \end {array}\right )\), and ε 1 is a sufficiently small positive number. Obviously, there exist two eigenvalues of matrix X which are χ 5 and χ 6. Let χ= max{|χ 5|,|χ 6|}. From the condition of the locally asymptotically stability of solution \((\widetilde {s}(t),0,0,\widetilde {r}(t))\) to system (6) |ψ|<1, we can find a sufficiently small ε 1 such that χ<1. Now, we construct the following differential pulse system
From Theorem 1, we see that there exists a globally asymptotically stable τ-period solution of system (18), denoted as \((\widetilde {x}(t), \widetilde {y}(t))\), and \((\widetilde {x}(t), \widetilde {y}(t))\rightarrow (\widetilde {s}(t), \widetilde {r}(t))\) when t→∞. Thus, for any ε 1>0, t 1>0 such that \(\widetilde {y}(t)>\widetilde {r}(t)-\varepsilon _{1}\) when t>t 1. According to the comparison theorem of the pulse differential equation, we have
□
For simplicity, we assume that equation (19) holds for any time t. From the second equation of system (6) and equation (4), we have \(\frac {dl(t)}{dt}=\alpha \mu s(t)i(t)-(\lambda +\theta +\delta )l(t)=\alpha \mu (1-l(t)-i(t)-r(t))i(t)-(\lambda +\theta +\delta )l(t) \leq \alpha \mu (1-l(t)-i(t)-\widetilde {r}(t)+\varepsilon _{1})i(t)-(\lambda +\theta +\delta )l(t)\leq \alpha \mu (\widetilde {s}(t)+\varepsilon _{1})i(t)-(\lambda +\theta +\delta )l(t)\). Similarly, from the third equation of system (6), we have \(\frac {di(t)}{dt}\leq \lambda l(t)+\beta \mu (\widetilde {s}(t)+\varepsilon _{1})i(t)-(\varepsilon +\delta )i(t)\). Next, we construct the following system
We can rewrite equation (20) as
Let \(G(t) = \left (\begin {array}{c} u(t) \\v(t) \end {array}\right )\). Then, we can rewrite equation (21) as
Solving equation (22), we have \(G(t) = G(0)e^{{{\int }_{0}^{t}} {Z(t)dt} }\) when 0<t≤τ. Thus, for any time t∈(k τ,(k+1)τ], we have \(G(t) = G(0)X^{k} e^{{\int }_{k\tau }^{t} {Z(t)dt}}\), where k is a non-negative integer. As X<1, we have G(t)→0 when t→∞. This implies that we have (l(t),i(t))→(0,0) when t→∞.
In the following, we prove that \(r(t)\rightarrow \widetilde {r}(t)\) and \(s(t)\rightarrow \widetilde {s}(t)\) as t→∞. We have, for any 0<ε 2<(η + δ)γ μ, t 2>0 such that 0<l(t)<ε 2 and 0<i(t)<ε 2 when t>t 2. Without loss of generality, we assume 0<l(t)<ε 2 and 0<i(t)<ε 2 for any time t>0. Then, we have \(-(\eta +\delta )r(t)<\frac {r(t)}{dt}<\varepsilon \varepsilon _{2}+\theta \varepsilon _{2}-\gamma \mu (1-2\varepsilon _{2}-r(t)) \varepsilon _{2}-\eta r(t)-\delta r(t)=\varepsilon \varepsilon _{2}+\theta \varepsilon _{2}-\gamma \mu (1-2\varepsilon _{2}) \varepsilon _{2}-(\eta +\delta -\gamma \mu \varepsilon _{2})r(t)=(\varepsilon +\theta -\gamma \mu )\varepsilon _{2}+2{\gamma \mu \varepsilon _{2}^{2}}-(\eta +\delta -\gamma \mu \varepsilon _{2})r(t) \triangleq \varepsilon _{3}-(\eta +\delta -\gamma \mu \varepsilon _{2})r(t)\), where \(\varepsilon _{3}=(\varepsilon +\theta -\gamma \mu )\varepsilon _{2}+2{\gamma \mu \varepsilon _{2}^{2}}\). Next, we construct the following system
Obviously, system (23) has a globally asymptotically stable τ-period solution:
where \(\widetilde {z}^{\ast }=\frac {\frac {(1-\sigma _{1})\varepsilon _{3}}{F}(1-e^{-F\tau })+(1-2\varepsilon _{2})\sigma _{1}+\varepsilon _{2}\sigma _{2}} {1-(1-\sigma _{1})e^{-F\tau }}\), and F = η + δ−γ μ ε 2. Thus, for any ε 4>0, there exists a time t 3 such that \(\widetilde {r}^(t)-\varepsilon _{4}<r(t)<\widetilde {z}^(t)+\varepsilon _{4}\) when t>t 3. When ε 2→0 and t→∞, we have \(\widetilde {r}(t)-\varepsilon _{4}<r(t)<\widetilde {r}(t)+\varepsilon _{4}\). Thus, we obtain \(r(t)\rightarrow \widetilde {r}(t)\). Furthermore, \(s(t)\rightarrow \widetilde {s}(t)\) when t→∞. This implies that the misinformation-free τ-period solution of system (6) \((\widetilde {s}(t), 0, 0, \widetilde {r}(t))\) is globally attractive.
As the misinformation-free τ-period solution of system (6) is both locally asymptotically stable and globally attractive, it is globally asymptotically stable.
Rights and permissions
About this article
Cite this article
Wang, X., Lin, Y., Zhao, Y. et al. A novel approach for inhibiting misinformation propagation in human mobile opportunistic networks. Peer-to-Peer Netw. Appl. 10, 377–394 (2017). https://doi.org/10.1007/s12083-016-0438-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12083-016-0438-3