通信学报 ›› 2019, Vol. 40 ›› Issue (9): 86-94.doi: 10.11959/j.issn.1000-436x.2019177

• 学术论文 • 上一篇    下一篇

机会社交网络中基于时变兴趣社区的查询消息路由算法

毕俊蕾1,李致远2,3   

  1. 1 江苏大学信息化中心,江苏 镇江212013
    2 江苏大学计算机科学与通信工程学院,江苏 镇江 212013
    3 江苏大学新一代信息技术产业研究院,江苏 镇江 212013
  • 修回日期:2019-06-28 出版日期:2019-09-25 发布日期:2019-09-28
  • 作者简介:毕俊蕾(1981- ),女,河南南阳人,博士,江苏大学讲师,主要研究方向为移动社交网络、机会网络路由算法。|李致远(1981- ),男,河南开封人,博士,江苏大学副教授、硕士生导师,主要研究方向为移动社交网络、物联网和软件定义网络及其安全机制。
  • 基金资助:
    江苏省自然科学基金资助项目(BK20170558);中国博士后科学基金资助项目(2015M570469)

Time-variant interest community based query message routing algorithm in opportunity social network

Junlei BI1,Zhiyuan LI2,3   

  1. 1 Information Center,Jiangsu University,Zhenjiang 212013,China
    2 School of Computer Science and Telecommunication Engineering,Jiangsu University,Zhenjiang 212013,China
    3 New-Generation Information Technology Industry Institute,Jiangsu University,Zhenjiang 212013,China
  • Revised:2019-06-28 Online:2019-09-25 Published:2019-09-28
  • Supported by:
    The Natural Science Foundation of Jiangsu Province(BK20170558);China Postdoctoral Science Foundation of China(2015M570469)

摘要:

针对机会社交网络环境下资源查询成功率低的问题,提出一种基于时变兴趣社区的查询消息路由算法。首先,分析了2个重要的移动社交网络数据集,发现了用户节点行为在时间和空间上的关联性和规律性;然后,基于用户行为在时空上的关联和规律性,构建了时变兴趣社区;最后,在时变兴趣社区的基础上,设计新的查询消息路由算法。理论分析结果表明,所提算法时间复杂度是O(nlog n);仿真实验结果表明,所提算法在查询成功率、平均查询时延、查询跳数及系统开销方面均优于与同类型算法。

关键词: 机会社交网络, 查询路由, 移动社交数据分析, 时变兴趣社区

Abstract:

To solve the problem that the successful rate of resource query is low in opportunity social network,a query message routing algorithm based on time-variant interest community was proposed.Two well-known mobile social datasets were firstly analyzed,and then the temporal and spatial correlations of users were found.The time-variant interest communities based on temporal and spatial correlations of users were constructed.Next,a dynamic query routing on the constructed time-variant interest communities was proposed.Theoretical analysis shows that the proposed routing can run in O (nlog n) time.The comparisons between the proposed routing and state-of-the-art message delivery algorithms show that the proposed routing can keep high query success rate,reduce the average query latency and the hop count of a query and maintain low system overhead.

Key words: opportunistic social network, query routing, mobile social data analysis, time-variant interest community

中图分类号: