期刊文献+

基于社会性的DTN网络路由算法研究 被引量:4

Research of DTN Routing Algorithm Based on Sociality
下载PDF
导出
摘要 针对DTN网络中的消息传输问题,结合概率路由算法PROPHET和社会性路由算法SimBet的基本思想,提出一种DTN网络路由算法——ProSimbet。在选择转发节点时,综合考虑基于历史相遇记录的概率估计和节点的社会性这2个指标,从而降低消息转发次数。实验结果表明,在密集数据集INFOCOM06上,ProSimBet、SimBet、PROPHET和ER这4种路由算法的消息成功转发数目比较接近。在稀疏数据集MIT上,ProSimBet在消息转发次数上比SimBet降低26.1%,在消息成功转发数目上比PROPHET提高7.83%。 Aiming at the problem of message transmission on Delay Tolerant Network(DTN) network, combined with the basic ideas of probability routing algorithm PROPHET and social routing algorithm SimBet, this paper proposes a DTN routing algorithm ProSimBet. When selecting the node to deliver messages, the probability estimated based on the history of meets and the sociality of nodes is considered. On INFOCOM06 dataset, the numbers of messages delivered of the four algorithms that are ProSimBet, SimBet, PROPHET and ER are approximate. On MIT dataset, ProSimbet reduces the messages forwards 26.1% compared with SimBet, and increases the numbers of messages delivered 7.83% to PROPHET.
出处 《计算机工程》 CAS CSCD 2012年第14期96-98,共3页 Computer Engineering
基金 国家自然科学基金资助项目"对象集合动态可变的应对规划研究"(61070084) 吉林省科技发展计划基金资助项目"IPv6中任播安全技术的研究与应用"(201101003)
关键词 DTN网络 PROPHET算法 社会性 相似性 介数中心性 Delay Tolerant Network(DTN) Probabilistic Routing Protocol Using History of Encounters and Transitivity(PROPHET) algorithm sociality similarity betweenness centrality
  • 相关文献

参考文献8

  • 1苏金树,胡乔林,赵宝康,彭伟.容延容断网络路由技术[J].软件学报,2010,21(1):119-132. 被引量:73
  • 2Daly E, Haahr M. Social Network Analysis Disconnected Delay-tolerant MANETs[C]//Proc. International Symposium on Mobile Ad Hoc Computing. Mon.n'eal, Canada: ACM Press, 2007 for Routing in of the 8th ACM Networking and 32-40.
  • 3Vahdat A, Beeker D. Epidemic Routing for Partially-connected Ad Hoc Networks[R]. Duke University, Tech. Rep.: CS-2000-06, 2000.
  • 4Lindgren A, Doria A, Schel6n O. Probabilistic Routing in Intermittently Connected Networks[J]. Mobile Computing and Communications Review, 2003, 7(3): 19-20.
  • 5Newman M E J. A Measure of Betweenness Centrality Based on Random Walks[J]. Social Networks, 2005, 27(5): 39-54.
  • 6Peter V. Marsden Egocentric and Sociocentric Measures of Network Centrality[J]. Social Networks, 2002, 24(4): 407-422.
  • 7Machine Perception and Learning of Complex Social Systems [EB/OL]. (2011-11-15). http://reality.media.mit.edu/.
  • 8Chaintreau A, Pan Hui, Crowcroft J, et al. Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms[J]. IEEE Transactions on Mobile Computing, 2007, 6(6): 606-620.

二级参考文献1

共引文献72

同被引文献33

  • 1KUMAR P, BHARDWA J. Comparative Analysis of Re-active and Proactive Protocol of Mobile Ad Hoc Network [ J]. International Journal on Computer Science and En- gineering, 2012, 4 (07) : 1281-1288.
  • 2HUANG K B. Spatial Interference Cancellation f-or Mul- tiantenna Mobile ad hoc Networks[ J]. IEEE Transactions on Information Theory, 2012, 58 (03) : 1660 - 1676 .
  • 3DALY E. Social Network Analysis for Routing in Discon- nected Delay Tolerant MANETs [ C ]// Proc. of the 8th ACM International Symposium on Mobile Ad Hoc Networ- king and Computing. Montreal, Canada: ACM Press, 2010:32-40.
  • 4YUE K. A Social Interest Indicator Based Mobility Model for Ad Hoc Network [ C ]//The 2nd International Confer-ence on Emerging Technologies for Information Systems, Computing, and Management. America: Springer, 2013: 919-920.
  • 5MARSDEN P V. Egocentric and Sociocentric Measures of Network Centrality [ J ]. Social Networks, 2010,24 (04) : 407 -422.
  • 6WANG Bo, HUANG Chuan-he, YANG Wen-zhong, et al. Trust opportunistic routing protocol in multi-hop wireless networks~ C ] Jf 2010 IEEE International Conference on Wireless Communications, Networking and Information Security. Beijing: IEEE, 2010: 563-567.
  • 7GROSSGLAUSER M, TSE D. Mobility increases the capacity of ad-hoc wireless networks [ C ] ff Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Anchorage: IEEE, 2001 (3) : 1360-1369.
  • 8RAMANATHAN R, HANSEN R, BASU P, et al. Prioritized epidemic routing for opportunistic networks [ C //Proceedings of the 1st International MobiSys Workshop on Mobile Opportunistic Networking. New York: ACM, 2007 : 62-66.
  • 9LINDGREN A, DORIA A, SCHELI~N O. Probabilistic routing in intermittently connected networks [ J ]. ACM SIGMOBILE Mobile Computing and Communications Review, 2003, 7(3): 19-20.
  • 10DALY E, HAAHR M. Social network analysis for routing in disconnected delay-toleTant MANETs[ C ] //P~oceedings of the 8th ACM International Sysposium on Mobile Ad hoc Network and Computing. Montreal: ACM, 2007: 32-40.

引证文献4

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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