移动社交网中基于兴趣社区的消息传输方案

doi:10.11896/j.issn.1002-137X.2018.06.018

摘要/Abstract

摘要： 节点对路由消息的存储-携带-转发是移动社交网中的一种短距离通讯方式,传输性能是影响用户交互体验的关键因素,如果用户能够根据彼此间的兴趣或社区来进行消息传输,则可提高传输性能。目前,针对移动社交网中的短距离通讯,已有的研究主要是基于兴趣或者基于社区的传输方式。为了使用户得到更好的交互体验,将用户兴趣与社区相结合,提出基于兴趣社区的消息传输方案InComT(Interest Community based Transmission)。对移动社交网中单个节点的兴趣进行度量,根据得出的节点兴趣值进行社区划分,从而确定社区整体的兴趣值,并根据兴趣值来选择中继社区和中继节点,实现消息的传输。仿真结果表明,该策略在传输负载率和平均延时较低的情况下能够拥有较高的传输成功率。

关键词: 社区, 兴趣, 移动社交网

Abstract: The storage-carrying-forwarding of node for route messages is a short-distance communication way in the mobile social networks,and the transmission performance is the key factor that affects user interaction experience.If users can transmit the message according to the interest or the formation of the community,the transmission perfor-mance can be improved.For the short-distance communication in the mobile social network,the existing researches are mainly either interest-based or community-based transmission.In order to make users have a better interactive expe-rience,this paper proposed InComT(Interest-Community-based Transmission) by combining user interest with community.The interest value of a single node in the mobile social networks was measured,the community was divided accor-ding to the its interest value to determine the whole community interest value and then the relay community and the relay node were selected by the interest value to realize the transmission of message.The simulation results show that the strategy can possess higher transmission success rate in the case of low transmission overhead and low average delay.

Key words: Community, Interest, Mobile social networks

中图分类号:

TP309

侯林清, 蔡英, 范艳芳, 夏红科. 移动社交网中基于兴趣社区的消息传输方案[J]. 计算机科学, 2018, 45(6): 105-110. https://doi.org/10.11896/j.issn.1002-137X.2018.06.018

HOU Lin-qing, CAI Ying, FAN Yan-fang, XIA Hong-ke. Interest Community Based Message Transmission Scheme in Mobile Social Networks[J]. Computer Science, 2018, 45(6): 105-110. https://doi.org/10.11896/j.issn.1002-137X.2018.06.018

参考文献

[1]Index,Cisco Visual Networking.Global Mobile Data Traffic Forecast Update 2015-2020 White Paper[OL].https://www.cisco.com/go/offices.
[2]HU X,CHU T H S,LEUNG V C M,et al.A survey on mobile social networks:Applications,platforms,system architectures,and future research directions [J].IEEE Communications Surveys & Tutorials,2015:1557-1581.
[3]VASTARDIS N,YANG K.Mobile social networks:Architectures,Social properties,and Key Research Challenges[J].IEEE Communications Surveys & Tutorials,2013,15(3):1355-1371.
[4]ZHU Y,XU B,SHI X,et al.A survey of social based routing in delay tolerant networks:Positive and negative social effects[J].IEEE Communications Surveys & Tutorials,2013,15(1):387-401.
[5]NEWMAN M E J.Fast algorithm for detecting community structure in networks[J].Physical Review E,2003,69(6 Pt 2):066133.
[6]HUI P,YONEKI E,CHAN S Y,et al.Distributed community detection in delay tolerant networks[C]//Workshops -2nd ACM International Workshop on Mobility in the Evolving Internet Architecture.2007:1-8.
[7]NGUYEN N P,DINH T N,TOKALA S,et al.Over-lapping communities in dynamic networks:their detection and mobile applications[C]//Proceedings of the 17th Annual International Conference on Mobile Computing and Networking.ACM,2011:85-96.
[8]FORTUNATO S,CASTELLANO C.Community structure in graphs [M].New York:Springer,2012.
[9]MACROPOL K,SINGH A.Scalable discovery of best clusters on largegraphs[C]//Proc.VLDB Endow..2010:693-702.
[10]XIE J R,SZYMANSKI B K,LIU X M.Slpa:Uncovering overlapping communities in social networks via a speaker-listenerinteraction dynamic process[C]//Data Mining Workshops (ICDMW).IEEE 11th International Conference,2011:344-349.
[11]WILLIAMS M J,WHITAKER R M,ALLEN S M.Decentralised detection of periodic encounter communities in opportu-nistic networks[C]//Ad Hoc Networks.2012:1544-1556.
[12]CHEN Q,WU T T,FANG M.Detecting local community structures in complex networks based on local degree central nodes[J].Physica A Statistical Mechanics and Its Applications,2013,392(3):529-537.
[13]RHOUMA D,ROMDHANE L B.An efficient algorithm for community mining with overlap in social networks[J].Expert Systems with Applications,2014,41(9):4309-4321.
[14]WEI K,LIANG X,XU K.A survey of social-aware routing protocols in delay tolerant networks:applications,taxonomy and design-related issues[J].IEEE Communications Surveys & Tutorials,2014,16(1):556-578.
[15]ZHANG X,NEGLIA G,KUROSE J,et al.Performance modeling of epidemic routing[J].Computer Networks,2007, 51(10):2867-2891.
[16]LINDGREN A,DORIA A,SCHELEN O.Probabilistic routing in intermittently connected networks [M]//Service assurance with partial and intermittent resources.2004:239-254.
[17]SPYROPOULOS T,PSOUNIS K,RAGHAVENDRA C S. Spray and wait:an efficient routing scheme for inter- mittently connected mobile networks [C]//Proceedings of the ACM SIGCOMM Workshop.2005:252-259.
[18]DALY E M,HAAHR M.Social network analysis for routing in disconnected delay-tolerant manets [C]//Proceedings of the 8th ACM International Symposium on Mobile Ad hoc Networking and Computing.ACM,2007:32-40.
[19]HUI P,CROWCROFT J,YONEKI E.Bubble Rap:Social-based Forwarding in Delay Tolerant Networks[C]//ACM MobiHoc.2008.
[20]GAO W,LI Q,ZHAO B,et al.Multicasting in delay tolerant networks:a social network perspective [C]//Tenth ACM International Symposium on Mobile Ad hoc Networking and Computing.ACM,2009:299-308.
[21]IOANNIDIS S,CHAINTREAU A,MASSOULIÉ L.Optimal and scalable distribution of content updates over a mobile social network[C]//INFOCOM.2009:1422-1430.
[22]MOGHADAM A,SCHULZRINNE H.Interest-aware content distribution protocol for mobile disruption-tolerant networks[C]//IEEE International Symposium.2009:1-7.
[23]MTIBAA A,MAY M,DIOT C,et al.Peoplerank:Social opportunistic forwarding[C]//Infocom Proceedings IEEE.2010:1-5.
[24]HUI P,CROWCROFT J,YONEKI E.Bubble-rap:Social-based forwarding in delay-tolerant networks [J].IEEE Transactions on Mobile Computing,2011,10(11):1576-1589.
[25]GAO W,CAO G.User-centric data dissemination in disruption tolerant networks [C]//INFOCOM IEEE.2011:3119-3127.
[26]LIN K C J,CHEN C W,CHOU C F.Preference aware content dissemination in opportunistic mobile social networks[C]//INFOCOM Proceedings IEEE.2012:1960-1968.
[27]WU J,WANG Y.Social feature-based multi-path routing in delay tolerant networks[C]//INFOCOM Proceedings IEEE.2012:1368-1376.
[28]XU Y,CHEN X.Social-similarity-based multicast algorithm inimpromptu mobile social networks[C]//Global Communications Conference (GLOBECOM).IEEE,2014:346-351.
[29]DIDWANIA A,NARMAWALA Z.A comparative study of various community detection algorithms in the mobile social network[C]//Engineering Nui- CONE 5th Nirma University International Conference.IEEE,2015:1-6.
[30]MAO Z,JIANG Y,MIN G,et al.Mobile social networks:Design requirements,architecture,and state-of-the-art technology [J].Computer Communications,2016,100:1-19.

相关文章 15

[1]	郑文萍, 刘美麟, 杨贵. 一种基于节点稳定性和邻域相似性的社区发现算法 Community Detection Algorithm Based on Node Stability and Neighbor Similarity 计算机科学, 2022, 49(9): 83-91. https://doi.org/10.11896/jsjkx.220400146
[2]	朴勇, 朱锶源, 李阳. 融合用户和区位资源特征的混合房源推荐方法 Hybrid Housing Resource Recommendation Based on Combined User and Location Characteristics 计算机科学, 2022, 49(6A): 733-737. https://doi.org/10.11896/jsjkx.210800062
[3]	何亦琛, 毛宜军, 谢贤芬, 古万荣. 基于点割集图分割的矩阵变换与分解的推荐算法 Matrix Transformation and Factorization Based on Graph Partitioning by Vertex Separator for Recommendation 计算机科学, 2022, 49(6A): 272-279. https://doi.org/10.11896/jsjkx.210600159
[4]	洪志理, 赖俊, 曹雷, 陈希亮, 徐志雄. 基于遗憾探索的竞争网络强化学习智能推荐方法研究 Study on Intelligent Recommendation Method of Dueling Network Reinforcement Learning Based on Regret Exploration 计算机科学, 2022, 49(6): 149-157. https://doi.org/10.11896/jsjkx.210600226
[5]	王本钰, 顾益军, 彭舒凡, 郑棣文. 融合动态距离和随机竞争学习的社区发现算法 Community Detection Algorithm Based on Dynamic Distance and Stochastic Competitive Learning 计算机科学, 2022, 49(5): 170-178. https://doi.org/10.11896/jsjkx.210300206
[6]	唐春阳, 肖玉芝, 赵海兴, 冶忠林, 张娜. 面向双层网络的EWCC社区发现算法 EWCC Community Discovery Algorithm for Two-Layer Network 计算机科学, 2022, 49(4): 49-55. https://doi.org/10.11896/jsjkx.210800275
[7]	左园林, 龚月姣, 陈伟能. 成本受限条件下的社交网络影响最大化方法 Budget-aware Influence Maximization in Social Networks 计算机科学, 2022, 49(4): 100-109. https://doi.org/10.11896/jsjkx.210300228
[8]	杨旭华, 王磊, 叶蕾, 张端, 周艳波, 龙海霞. 基于节点相似性和网络嵌入的复杂网络社区发现算法 Complex Network Community Detection Algorithm Based on Node Similarity and Network Embedding 计算机科学, 2022, 49(3): 121-128. https://doi.org/10.11896/jsjkx.210200009
[9]	蒲实, 赵卫东. 一种面向动态科研网络的社区检测算法 Community Detection Algorithm for Dynamic Academic Network 计算机科学, 2022, 49(1): 89-94. https://doi.org/10.11896/jsjkx.210100023
[10]	陈晋鹏, 胡哈蕾, 张帆, 曹源, 孙鹏飞. 融合时间特性和用户偏好的卷积序列化推荐 Convolutional Sequential Recommendation with Temporal Feature and User Preference 计算机科学, 2022, 49(1): 115-120. https://doi.org/10.11896/jsjkx.201200192
[11]	温啸林, 李长林, 张馨艺, 刘尚松, 朱敏. 基于DPoS共识机制的区块链社区演化的可视分析方法 Visual Analysis Method of Blockchain Community Evolution Based on DPoS Consensus Mechanism 计算机科学, 2022, 49(1): 328-335. https://doi.org/10.11896/jsjkx.201200118
[12]	雷羽潇, 段玉聪. 面向跨模态隐私保护的AI治理法律技术化框架 AI Governance Oriented Legal to Technology Bridging Framework for Cross-modal Privacy Protection 计算机科学, 2021, 48(9): 9-20. https://doi.org/10.11896/jsjkx.201000011
[13]	王营丽, 姜聪聪, 冯小年, 钱铁云. 时间感知的兴趣点推荐方法 Time Aware Point-of-interest Recommendation 计算机科学, 2021, 48(9): 43-49. https://doi.org/10.11896/jsjkx.210400130
[14]	陈湘涛, 赵美杰, 杨梅. 基于子图结构的局部社区发现算法 Overlapping Community Detection Algorithm Based on Subgraph Structure 计算机科学, 2021, 48(9): 244-250. https://doi.org/10.11896/jsjkx.201100010
[15]	武建新, 张志鸿. 融合用户评分与显隐兴趣相似度的协同过滤推荐算法 Collaborative Filtering Recommendation Algorithm Based on User Rating and Similarity of Explicit and Implicit Interest 计算机科学, 2021, 48(5): 147-154. https://doi.org/10.11896/jsjkx.200300072

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed