Centrality prediction based on K-order Markov chain in Mobile Social Networks

Mengni Ruan, Xin Chen, Huan Zhou

科研成果: 期刊稿件文章同行评审

19 引用 (Scopus)

摘要

In this paper, we proposed a centrality prediction method based on K-order Markov chains to solve the problem of centrality prediction in Mobile Social Networks (MSNs). First, we use the information entropy to analyze the past and future regularity of the nodes’ centrality in the real mobility traces, and verify that nodes’ centrality is predictable. Then, using the historical information of the center of the node, the state probability matrix is constructed to predict the future central value of the node. At last, through the analysis of the error between real value and predicted value, we evaluate the performance of the proposed prediction methods. The results show that, when the order number is K = 2, compared with other existing four time-order-based centrality prediction methods, the proposed centrality prediction method based on K-order Markov chain performs much better, not only in the MIT Reality trace, but also in the Infocom 06 traces.

源语言英语
页(从-至)1662-1672
页数11
期刊Peer-to-Peer Networking and Applications
12
6
DOI
出版状态已出版 - 1 11月 2019
已对外发布

指纹

探究 'Centrality prediction based on K-order Markov chain in Mobile Social Networks' 的科研主题。它们共同构成独一无二的指纹。

引用此