计算机科学 ›› 2016, Vol. 43 ›› Issue (2): 124-128.doi: 10.11896/j.issn.1002-137X.2016.02.028

• 网络与通信 • 上一篇    下一篇

一种基于可变半衰期的机会网络社团兴趣值更新策略

严禹道,刘林峰   

  1. 南京邮电大学计算机学院 南京210023江苏省无线传感网高技术研究重点实验室 南京210003,南京邮电大学计算机学院 南京210023江苏省无线传感网高技术研究重点实验室 南京210003
  • 出版日期:2018-12-01 发布日期:2018-12-01
  • 基金资助:
    本文受国家自然科学基金(61373139,7,61300239,1),江苏省自然科学基金(BK2012833,BK20130877,BK20141429),中国博士后科学基金(2014M560379,5T80484),江苏省科技支撑计划(社会发展)(BE2013666)资助

Update Strategy of Communities Information Based on Variable Half-lifes in Opportunistic Networks

YAN Yu-dao and LIU Lin-feng   

  • Online:2018-12-01 Published:2018-12-01

摘要: 为了掌握节点移动的历史信息,提出了MDIR (Mass-group Detected by Interest-value )算法。该算法引入了社团的概念,将节点的移动规律与其它节点的关系进行关联。理论上,在社会网络中节点的移动可以归结为在不同社团中移动的过程。因此在该算法中,消息更倾向于向包含目标节点的社团转发。此外,考虑到社会关系的动态性,算法还引入兴趣值概念来更新网络拓扑中的社团结构。实验测试数据表明,在不同的节点密集度和网络资源有限的情况下,相较于Epidemic、BDCR以及SREP算法,MDIR算法可通过计算效用值进行路由转发来产生较低的转发能耗以及稳定的送达率。

关键词: 机会路由算法,社会网络,社团结构,兴趣值

Abstract: Due to the incomplete use of historical information of nodes’ movements,to introduce the concept of group,every single person can be put into the connect of the community.Theoretically,the movement of nodes can be abstrac-ted as movement from one group to another.We proposed a new method mass-group detected with interest value (MDIR) to compute the utility value in opportunistic routing in social network.With the concept of interest value,dynamic communities can be detected precisely.Experiments indicate that in different intensiveness,MDIR performes better stability and efficiency compared with Epidemic,BDCR and SREP.

Key words: Opportunistic networks routing,Social networks,Community structure,Interest value

[1] Kevin Fall.A delay-tolerant network architecture for challenged internets[C]∥Proceedings of the 2003 conference on Applications,technologies,architectures,and protocols for computer communications(SIGCOMM’03).New York,NY,USA:ACM,2003:27-34
[2] Xiong Yong-ping,Sun Li-min,Niu Jian-wei.Opportunistic Net-work[J].Journal of Software,2009(1):124-137(in Chinese) 熊永平,孙利民,牛建伟.机会网络[J].软件学报,2009(1):124-137
[3] Lindgren A,Doria A,Schelén O.Probabilistic Routing in Intermittently Connected Networks[M]∥Service Assurance with Partial and Intermittent Resources.Springer Berlin Heidelberg,2004:239-254
[4] Guo Z,Peng Z,Wang B,et al.Adaptive routing in underwater delay tolerant sensor networks[C]∥2011 6th International ICST Conference on Communications and Networking in China (CHINACOM).IEEE,2011:1044-1051
[5] Xie X,Zhang Y,Dai C,et al.Social Relationship Enhanced Pre-dicable Routing in Opportunistic Network[C]∥2011 Seventh International Conference on Mobile Ad-hoc and Sensor Networks (MSN).2011:268-275
[6] Andrea L,Santo F.Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities[J].Physical Review E Statistical Nonlinear & Soft Matter Physics,2009,0(1Pt2):145-148
[7] Riedy J,Bader D A,Meyerhenke H.Scalable Multi-threadedCommunity Detection in Social Networks[C]∥2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW).IEEE,2012:1619-1628
[8] Kim J K,Kim H K,Oh H Y,et al.A group recommendation system for online communities [J].International Journal of Information Management,2010,30(3):212-219
[9] Yuan Shuang-gui,Yang Wei-fan,Xu Yan-bing.The study ofhalf-life theory from experimental data[J].Science Technology and Engineering,2004,4(3):179-180(in Chinese) 袁双贵,杨维凡,徐岩冰.从实验数据看计算半衰期的理论[J].科学技术与工程,2004,4(3):179-180
[10] Zhang Ke-jia.Outlier nodes detection in Sensor Networks [D].Harbin:Harbin Institute of Technology,2007(in Chinese) 张可佳.传感器网络中离群点的检测[D].哈尔滨:哈尔滨工业大学,2007
[11] Xie Zhou,Wang Xian-fan.A fast algorithm for detecting local community structure in complex networks [J].Computer Simulation,2007,4 (11):82-85
[12] Kernen A,Ott J,Krkkinen T.The ONE simulator for DTN protocol evaluation[C]∥The 2nd International Conference on Si-mulation Tools and Techniques.Rome,Italy,2009:1-10
[13] Oh S.An advanced taxi movement model in the working day movement for delay-tolerant networks[J].Cluster Computing,2014,17(3):751-756
[14] Gewali L,Roman V.Generalization of Shortest Path Map[C]∥2010 Seventh International Conference on Information Techno-logy:New Generations (ITNG).IEEE,2010:296-300
[15] Rosvall M,Bergstrom C T.Maps of random walks on complex networks reveal community structure[C]∥Proceedings of the National Academy of Sciences of the United States of America.2008:1119-1123

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!