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

毕俊蕾; 李致远

doi:10.11959/j.issn.1000-436x.2019177

您当前的位置：

首页 >

文章列表页 >

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

学术论文 | 更新时间：2024-06-05

- 机会社交网络中基于时变兴趣社区的查询消息路由算法
- Time-variant interest community based query message routing algorithm in opportunity social network
- 通信学报 2019年40卷第9期页码：86-94
- 作者机构：
  
  1. 江苏大学信息化中心，江苏镇江212013
  2. 江苏大学计算机科学与通信工程学院，江苏镇江 212013
  3. 江苏大学新一代信息技术产业研究院，江苏镇江 212013
- 作者简介：
  
  [ "毕俊蕾（1981- ），女，河南南阳人，博士，江苏大学讲师，主要研究方向为移动社交网络、机会网络路由算法。" ]
  [ "李致远（1981- ），男，河南开封人，博士，江苏大学副教授、硕士生导师，主要研究方向为移动社交网络、物联网和软件定义网络及其安全机制。" ]
- 基金信息：
  
  江苏省自然科学基金资助项目(BK20170558);中国博士后科学基金资助项目(2015M570469)
- DOI：10.11959/j.issn.1000-436x.2019177
  中图分类号： TP393
- 网络出版日期：2019-09，
  
  纸质出版日期：2019-09-25
- 稿件说明：
移动端阅览
毕俊蕾, 李致远. 机会社交网络中基于时变兴趣社区的查询消息路由算法[J]. 通信学报, 2019,40(9):86-94.

Junlei BI, Zhiyuan LI. Time-variant interest community based query message routing algorithm in opportunity social network[J]. Journal on communications, 2019, 40(9): 86-94.
毕俊蕾, 李致远. 机会社交网络中基于时变兴趣社区的查询消息路由算法[J]. 通信学报, 2019,40(9):86-94. DOI： 10.11959/j.issn.1000-436x.2019177.

Junlei BI, Zhiyuan LI. Time-variant interest community based query message routing algorithm in opportunity social network[J]. Journal on communications, 2019, 40(9): 86-94. DOI： 10.11959/j.issn.1000-436x.2019177.

摘要

针对机会社交网络环境下资源查询成功率低的问题，提出一种基于时变兴趣社区的查询消息路由算法。首先，分析了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.

关键词

Keywords

references

PIETILÄNEN A K , DIOT C . Dissemination in opportunistic social networks:the role of temporal communities [C ] // The 13th ACM International Symposium on Mobile Ad Hoc Networking and Computing . ACM , 2012 : 165 - 174 .

李超 , 殷丽华 , 耿魁 , 等 . 面向移动社交网络内容分享的位置隐私保护方法 [J ] . 通信学报 , 2016 , 37 ( 11 ): 31 - 41 .

LI C , YIN L H , GENG K , et al . Location privacy preservation Approach towards to content sharing on mobile online social network:survey and perspectives [J ] . Journal on Communications , 2016 , 37 ( 11 ): 31 - 41 .

VAHDAT A , BECKER D . Epidemic routing for partially connected ad Hoc networks:technical report：CS-200006 [R ] . North Carolina:Duke University , 2000 .

SPYROPOULOS T , PSOUNIS K , RAGHAVENDRA C S . Spray and wait:an efficient routing scheme for intermittently connected mobile networks [C ] // The 21th ACM SIGCOMM Workshop on Delay-Tolerant Networking . ACM , 2005 : 252 - 259 .

LINDGREN A , DORIA A , DAVIES E , et al . Probabilistic routing protocol for intermittently connected networks:RFC 6693 [Z ] . IETF Datatracker , 2012 .

DALY E M , HAAHR M . Social network analysis for routing in disconnected delay-tolerant manets [C ] // The 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing . ACM , 2007 : 32 - 40 .

LIU Q , HU C , LI Y , ZHAO W , et al . An interest community routing scheme for opportunistic networks [C ] // The 54th IEEE Globecom Workshops . IEEE , 2013 : 4366 - 4371 .

ZHENG Z J , WANG T Y , SONG L Y , et al . Social-aware multi-file dissemination in device-to-device overlay networks [C ] // The 33rd IEEE International Conference on INFOCOM . IEEE , 2014 : 219 - 220 .

LI Y , LI Q , JIN D P , et al . Contact duration aware evaluation for content dissemination delay in mobile social network [J ] . Wireless Communications ＆ Mobile Computing , 2015 , 15 ( 3 ): 527 - 537 .

MANSILLA A T , ESTEVA J L . Question waves:a multicast query routing algorithm for social search [J ] . Information Sciences , 2013 , 253 ( 1 ): 1 - 25 .

YOU L , LI J B , WEI C J . MPAR:a movement pattern-aware optimal routing for social delay tolerant networks [J ] . Ad Hoc Networks , 2015 , 24 ( 3 ): 228 - 249 .

PAGANI E , VALERIO L , ROSSI G P . Weak social ties improve content delivery in behavior-aware opportunistic networks [J ] . Ad Hoc Networks , 2015 , 25 ( 7 ): 314 - 329 .

LI Y , WU D , XUA J , et al . Spatial-aware interest group queries in location-based social networks [J ] . Data ＆ Knowledge Engineering , 2014 , 92 ( 1 ): 20 - 38 .

FIRDOSE S , LOPES L , MOREIRA W , et al . The copelabs/usense dataset:Crawdad [J ] .(2017-01-27)[2018-12-16 ] .

CIOBANU R I , DOBRE C . The upb/hyccups dataset:Crawdad [J ] .(2016-10-17)[2018-12-16 ] .

徐健锐 , 詹永照 . 基于 Spark 的改进 K-means 快速聚类算法 [J ] . .江苏大学学报 (自然科学版) , 2018 , 39 ( 3 ): 316 - 323 .

U J R , ZHAN Y Z . Improved K-means fast clustering algorithm based on Spark [J ] . Journal of Jiangsu University (Natural Science Ditions) , 2018 , 39 ( 3 ): 316 - 323 .

PEDREGOSA F , VAROQUAUX G , GRAMFORT A , et al . Scikit-learn:machine learning in Python [J ] . Journal of machine learning research , 2011 , 32 ( 1 ): 2825 - 2830 .

浏览量

470

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

暂无数据