期刊文献+

一种基于节点相似度和活跃度的数据转发算法

Data forwarding algorithm based on similarity and activity of nodes
下载PDF
导出
摘要 文章从节点共同形成的社会属性角度出发,提出了一种基于节点相似度和活跃度的数据转发算法(data forwarding algorithm based on the similarity and activity of nodes,DASA)及节点的相似度和活跃度的概念;在设计数据转发算法时,通过节点的相似度和活跃度来决定是否选择网络节点作为数据转发节点。研究结果表明,与Epidemic算法、Label算法以及Greedy Total算法相比,文中所提算法可降低网络资源的开销,且其传递率优于Label算法的传递率。 In view of social characteristics made by the nodes ,a data forwarding algorithm based on the similarity and activity of nodes(DASA) is proposed .Firstly ,the two dynamic features including the similarity and activity of nodes are put forward .Then ,whether or not a node is chosen as a relay node is determined by the similarity and activity of the encounter nodes .Finally ,the experimental results show that compared with Epidemic algorithm ,Label algorithm and Greedy Total algorithm ,the pro‐posed algorithm can obviously reduce the overhead of the network resources ,and the delivery rate of it is better than that of the Label algorithm .
出处 《合肥工业大学学报(自然科学版)》 CAS CSCD 北大核心 2015年第9期1205-1209,共5页 Journal of Hefei University of Technology:Natural Science
基金 国家自然科学基金资助项目(61401144) 安徽省自然科学基金资助项目(1308085MF87) 教育部留学回国科研基金资助项目(2013JYLH0280) 高等学校博士学科点专项科研基金资助项目(2013111120018) 中央高校基本科研业务费专项基金资助项目(2013HGXJ0233 J2014HGXJ0074)
关键词 移动社交网络 相似度 活跃度 社区 邻居 similarity activity community neighbor
  • 相关文献

参考文献15

  • 1Caini C. Firrincieli R Application of contact graph routingto LEO satellite DTN communications[C]//2012 IEEE In-ternational Conference on Communications (ICC). Ottawa,ON:IEEE Press,2012:3301 -3305.
  • 2Zhang L.Peng L,Zhang Y,et al. Urban bus transport net-work optimization from complex network [C]//2012 Pro-ceedings of International Conference on Modelling, Identifi-cation Control (ICMIC). Wuhan,Hubei,China: IEEEPress,2012:1159 -1164.
  • 3Zhao P,Zhao J, Wang W. Division of mobile social networkbased on user behavior[C]//2013 International Conferenceon Wavelet Analysis and Pattern Recognition (ICWAPR).Tianjin:IEEE Press,2013: 148-152.
  • 4Tauil M,kant L,McAuley A,et al. Capacity estimation andwaveform assignment in military networks[C]//MILXX)M2012, Military Communications Conference. Orlando, FL:IEEE Press,2012: 1 - 6.
  • 5Said H, Guimaraes M, Al Mutawa N, et al. Forensics andwar-driving on unsecured wireless network[C]//2011 In-ternational Conference for Internet Technology and SecuredTransactions (ICITST). Abu Dhabi . IEEE Press,2011:19-24.
  • 6Shen Jian,Moh S,Chung I,et al. Buffer scheme optimizationo. epidemic routing in delay tolerant networks[J]. Journalof Communications and Networks* 2014 . 16 : 656-666.
  • 7Vahdat A.Becker D. Epidemic routing for partially connect-ed ad hoc networks[EB/OL]. (2014-02-05). http://citese-erx. ist. psu. edu/viewdoc/download. doi = 10. 1. 1. 160.5495 &-rep= repl &-type- pdf.
  • 8Ramanathan R,Hansen R’Basu P,et al. Prioritized epidem-ic routing for opportunistic networks[C]//Proceedings ofthe 1st International MobiSys Workshop on Mobile Oppor-tunistic Networking,2007:1 - 5.
  • 9Yin L, Lu H,Cao Y. Probabilistic delay routing for delaytolerant networks [C]//10th International Conference onAdvanced Communication Technology. Gangwon-Do: IEEEPress,2008:191-195.
  • 10Spyropoulos T.Psounis K,Raghavendra C. Efficient rou-ting in intermittently connected mobile networks: the sin-gle-copy case[J]. IEEE/ACM Transactions on Networ-king,2008,16:63-76.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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