期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

移动社交网络中基于影响力的数据转发算法 被引量：2

Data forwarding algorithm based on impact in mobile social networks
下载PDF
导出
摘要 在移动社交网络中,人们通过携带无线设备在近距离范围内彼此传递信息,从而达到信息的传播。由于移动社交网络中一般不存在端到端的连接,使得数据转发算法成为一个重要问题。文章从社区和节点的社会属性角度,利用社区和节点的影响力,提出了一种基于影响力的数据转发算法(data forwarding algorithm based on impact,DFAI)。在该算法中,携带数据包的节点只有在遇到影响力达到一定要求的节点时,才拷贝数据包给相遇节点。仿真试验结果显示,与经典的Epidemic和Label算法相比,DFAI可以明显降低网络开销,同时接近Epidemic算法达到的最大传递率。 Mobile social users can communicate by physical interact with each other via mobile device in mobile social networks. In view of the intermittent and uncertain network connectivity in the mobile social network, the data forwarding algorithm becomes important. From the social perspective of community and node, a data forwarding algorithm based on impact（DFAI） is proposed in this paper. In DFAI, the node with the packet only copies to the encounter node whose impact meets certain requirement. The simulation results show that the proposed algorithm can reduce network overhead obviously compared with Epidemic algorithm and Label algorithm, and its maximum delivery ratio is close to that obtained by Epidemic algorithm.
作者 刘艳萍 王青山 王琦 付沙沙 任丽丽
机构地区 合肥工业大学数学学院
出处 《合肥工业大学学报（自然科学版）》 CAS CSCD 北大核心 2015年第2期195-198,共4页 Journal of Hefei University of Technology：Natural Science
基金 安徽省自然科学基金资助项目(1208085MF89 1308085MF87) 教育部留学回国人员科研基金资助项目(2013JYLH0280) 高等学校博士学科点专项科研基金资助项目(2013111120018)
关键词 移动社交网络 影响力 转发 延迟 mobile social network impact forwarding delay
分类号 TP301.6 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献10

  • 1Balasubramanian A, Levine B N, Venkataramani A. DTN routing as a resource allocation problem[C]//Proceedings of SIGCOMM 2007, Kyoto, 2007 : 373- 384.
  • 2柏亚平,王青山,孙雪莲.DTN网络中一种基于区域的缓存区管理策略[J].合肥工业大学学报（自然科学版）,2013,36(9):1063-1067. 被引量：2
  • 3Ioannidis S, Chaintreau A, Massoulie L. Optimal and scal able distribution of content updates over a mobile social net- work[C]//Proceedings of INFOCOM 2009, IEEE, Rio de Janeiro,2009:1422- 1430.
  • 4Vahdat A, Becker D. Epidemic routing for partially con- nected ad hoc networks[R]. San Diego:University of Cali- fornia, San Diego, 2000.
  • 5Spyropoulos T, Psounis K, Raghavendra C S. Spray and wait:an efficient routing scheme for intermittently connect- ed rrLobile networks [C]//Proceedings of the 2005 ACM SIGCOMM Workshop. New York: ACM Press, 2005: 252 259.
  • 6Spyropoulos T, Psounis K, Raghavendra C S. Spray and fo- cus: efficient mobility-assisted routing for heterogeneous and correlated mobility[C]//Proceedings of Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops. White Plains: IEEE Press, 2007= 79-85.
  • 7Erramilli V, Crovella M, Chaintreau A, et al. Delegation forwarding[C]//Proceedings of MobiHoc' 08. New York: ACM Press, 2008: 251-260.
  • 8Pan Hui, Crowcroft J. How Small labels create big im- provements[C]//Proceedings of Fifth Annual IEEE Inter- national Conference on Pervasive Computing and Communi- cations Workshops. White Plains: IEEE Press, 2007: 65-70.
  • 9Pan Hui, Crowcroft J, Yoneki E. Bubble rap: social-based forwarding in delay-tolerant networks[J]. IEEE Transac- tions on Mobile Computing. 2011,10(11) :1576 -1589.
  • 10Fan Jialu, Chen Jiming, Du Yuan,et al. DelQue: a social- ly-aware delegation query scheme in delay tolerant net- works[J]. IEEE Transactions on Vehicular Technology, 2011,60(5) : 2181 -2193.

二级参考文献12

  • 1Fall K. A delay-tolerant network architecture for chal-lenged Internets [C]//SIGCOMMJ 03 Proceedings of the2003 conference. New York: ACM Press, 2003:27—34.
  • 2Nichols R A,Hammons A R. DTN-based free-space opticaland directional RF networks [C]//Military Communica-tions Conference. San Diego, CA,2008:1 — 6.
  • 3Vahdat A, Vahdat D. Epidemic routing for partially con-nected ad hoc networks[R]. San Diego: University of Cali-fornia* 2000.
  • 4Lindgren A,Doria A, Schelen O. Probabilistic routing inintermittently connected networks[J]. ACM SIGMOBILEMobile Computing and Communications Review, 2003,7(3):19-20.
  • 5Spyropoulos T, Psounis K,Raghavendra C S. Spray andWait: an efficient routing scheme for intermittently con-nected mobile networks[C]//Proceedings of ACM SIG-COMM Workshop on Delaytolerant Networking. Philadel-phia :ACM Press .2005 : 252 — 259.
  • 6Liu Yao,Wang Jianxin,Zhang Shigeng, et al. A buffermanagement scheme based on message transmission statusin delay tolerant networks [C]//Gobal Telecommunica-tions Conference(GLOBECOM 2011). New Jersey: IEEEPress * 2011 : 1 — 5.
  • 7Zhang Xiaolan, Neglia G, Kurose J, et al. Performancemodeling of epidemic routing[J]. The International Journalof Computer and Telecommunications Networking, 2006,51:2867—2891.
  • 8Krifa A, Baraka C, Spyropoulos T. Optimal buffer man-agement policies for delay tolerant networks[C]//5th An-nual IEEE Communications Society Conference, SECONf08,San Francisco,CA,2008:260—268.
  • 9Lindgren A, Phanse S. Evaluation of queuing policies andforwarding strategies for routing in intermittently connect-ed networks [C]//Proc of IEEE COMSWARE, NewDelhi,2006:l —10.
  • 10Li Yun,Cheng Xinjian, Liu Qilie,et al. A novel conges-tion control strategy in delay tolerant networks[C]//Fu-ture Networks. 2010. ICFN10. Second International Con-ference. New Jersey: IEEE Press,2010:233 — 237.

共引文献1

同被引文献1

引证文献2

二级引证文献2

合肥工业大学学报（自然科学版）
2015年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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