期刊文献+

基于辐射扩散的机会网络社区构建算法

Community Construction Algorithm Based on Radiation Propagation in Opportunistic Networks
原文传递
导出
摘要 针对在计算分布式k社团成员间的介数中心性时需要获取所有最短路径问题,基于核心节点辐射量计算和扩散模型,提出了基于辐射扩散的机会网络社区构建算法.该算法主要利用节点之间的辐射关系来表示节点的介数中心性,并以这种辐射关系为基础建立以一确定节点为核心的辐射社区,由于节点可以定期接收到核心节点的辐射量,避免了节点间最短路径的计算过程.当消息转发进入目标节点的辐射社区后,即可沿着最优的方向转发至目标节点,从而获取较高的辐射社区内部消息转发效率.实验结果表明,当社区结构相对稳定时,在保证一定消息转发成功率情况下,可以取得低于Epidemic的消息转发延迟. To avoid the problem which need to get all the shortest path when computing the betweenness centrality of nodes in k-Community,the radiation propagation community construction algorithm was proposed,based on the radiation calculation and diffusion model of the core node.The betweenness centrality of nodes obtained by calculation radiation between nodes,and the community around a core node was constructed based on it.Because node could receive the radiation of the core nodes periodically,the process of calculating the shortest path between nodes was avoided.The packet can be forwarded to the destination node along the shortest path,after entering the destination node’s radiation propagation community,thus gaining high packet forwarding efficiency.A set of simulation results show that the proposed community construction algorithm can obtain lower message forwarding delay than Epidemic on certain message forwarding success rate when community structure is relatively stable.
出处 《河南大学学报(自然科学版)》 CAS 2016年第5期562-566,共5页 Journal of Henan University:Natural Science
基金 国家自然科学基金项目(61272544)
关键词 机会网络 辐射模型 辐射社区 分组转发 opportunistic networks radiation model radiation community packet forwarding
  • 相关文献

参考文献9

  • 1HUI P,CHAINTREAU A,et al.Pocket switched networks and human mobility in conference environments[C]//Proc of the 2005ACM SIG-COMM Workshop on Delay-tolerant Networking,2005:244-251.
  • 2MCNAMARA L,MASCOLO C,CAPRA L.Media sharing based on collocation prediction in urban transport[C]//Proceedings of the 14th ACM International Conference on Mobile Computing and Networking,San Francisco,California,USA,2008:58-69.
  • 3HUI P,CROWCROFT J,YONEKI E.Bubble Rap:social-based forwarding in delay tolerant networks[J].IEEE Transactions on Mobile Computing,2010,10(11):1576-1589.
  • 4GAO W,CAO G H,TOM L P,et al.On exploiting transient social contact patterns for data forwarding in delay-tolerant networks[J].IEEE Transactions on Mobile Computing,2013,12(1):151-164.
  • 5FREEMAN L C.Centrality in social networks conceptual clarification[J].Social Networks,1979,1(3):215-239.
  • 6VAHDAT A,BECKER D.Epidemic routing for partially connected ad hoc networks[R].Duke University,2000.
  • 7王恩,杨永健,赵卫丹,刘林璐.容迟网络中基于节点间亲密度的分组路由方法[J].通信学报,2014,35(12):70-77. 被引量:4
  • 8KERANEN A,OTT J,KARKKAINEN T.The ONE simulator for DTN protocol evaluation[C]//Proceedings of the 2nd International Conference on simulation Tools and Techniques.Rome,Italy,2009.
  • 9EAGLE N,PENTLAND A.Reality mining:sensing complex social systems[J].Personal and Ubiquitous Computing,2006,10(4):255-268.

二级参考文献20

  • 1FALL K. A delay-tolerant network architecture for challenged Internets[A]. Proc of the ACM SIGCOMM[C]. 2003.27-34.
  • 2BURLEIGH S, HOOKE A, TORGERSON L, et aJ. Delay tolerant networking: an approach to interplanetary intemet[J]. IEEE Communications Magazine, 2003.41(6):128-136.
  • 3AKYILDIZ I F, SU W, SANKARASUBRAMANIAM Y, et al. A survey on sensor networks[J]. IEEE Communications Magazine, 2002, 40(8): 102-114.
  • 4JONES E, WARD P. Routing strategies for delay-tolerant networks[A]. Proc of International Conference on Wireless Communications and Mobile Computing[C].2006.
  • 5JAIN S, FALL K, PATRA R. Routing in delay tolerant network[A]. Proc ofSIGCOMM[C]. New York: ACM Press, 2004.145-157.
  • 6VAHDAT A, BECKER D. Epidemic routing for partially connected ad hoc networks[R]. Duke University, 2000.
  • 7TANG L, ZHENG Q, LIU J, et aJ. SMART: A selective controlled-flooding routing for delay tolerant networks[A]. Fourth International Conference on IEEE Broadband Communications, Networks and Systems[C]. 2007.356-365.
  • 8SOYROPOULOS T, PSOUNIS K, RAGHA VENDRA C S. Spray and wait: an efficient routing scheme for intermittently connected mobile networks[A]. Proc of the ACM SIGCOMM Workshop on Delay- Tolerant Networking[C]. 2005.252-259.
  • 9SU J, CHIN A, POPIVANOVA A, et aJ. User mobility for opportunistic ad-hoc networking[A]. Proc of the 6th IEEE Workshop on Mobile Computing System and Applications[C]. 2004.41-50.
  • 10ZENG Z P,WANG J Y,ZHOU L Z, et aJ. Coherent closed quasi-clique discovery from large dense graph databases[A]. Proc of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '06[C]. 2006. 797-802.

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部