ISSN 1000-1239 CN 11-1777/TP

Journal of Computer Research and Development ›› 2016, Vol. 53 ›› Issue (6): 1365-1375.doi: 10.7544/issn1000-1239.2016.20148412

Previous Articles     Next Articles

Message Dissemination Based on Interest Matching for Opportunistic Social Networks

Zhang Yushu, Wang Huiqiang, Feng Guangsheng, Lü Hongwu   

  1. (College of Computer Science and Technology, Harbin Engineering University, Harbin 150001)
  • Online:2016-06-01

Abstract: Opportunistic social networks can provide message dissemination service through encounters created by nodes’ movement in intermittently connected or completely disconnected wireless networks, but there are still some shortcomings in message dissemination efficiency and user experience. In order to promote the performance of dissemination system and improve the user experience, an opportunistic social network message dissemination mechanism based on node interest matching is proposed. A kind of opportunistic social networks with hybrid architecture is introduced to avoid problems such as incomplete information of network topology and low computing ability of nodes. Considering the fact that node behaviors and interests can both affect the performance of dissemination, the analytical method designed takes both of them as reference factors, and an improved co-clustering algorithm for data with complex relationship is proposed. In addition, the interest matching rate for nodes is used to show what percentage of buffer is occupied by the useful messages to user, and a novel message dissemination strategy is proposed to raise the rate. Simulation results show that the proposed scheme can both improve the capability of opportunistic social networks in terms of delivery rate, latency and buffer usage, and promote the performance of message dissemination systems in terms of efficiency, coverage rate and interest matching rate.

Key words: opportunistic network, message dissemination, co-clustering, interest matching, congestion control

CLC Number: