登录 | 注册 | 充值 | 退出 | 公司首页 | 繁体中文 | 满意度调查
综合馆
基于节点运动预测的社会性DTN高效路由
  • 摘要

    延迟容忍网络是一种缺乏持续连接的新型网络体系结构,采用存储-携带-转发的路由方式进行消息的转发.考虑到节点的特性及运动模式,基于分簇、社会网络的路由协议已成为近年来的一个研究热点.该文分析现有基于分簇、社会网络的路由算法的缺陷及社会网络的特点,提出了一种新型的混合路由算法CS-DTN (Clustering & Social Delay Tolerant Network):预测节点间的相遇概率并据此对节点进行分簇,簇内根据节点间相遇概率限定消息的副本数量,将消息以二分喷射的方式转发到更可能到达目的节点的中继节点;簇间对节点进行运动预测并结合节点的特性将消息不断地转发到更接近目的节点的中继节点.不同于已有的基于分簇、社会网络的路由算法,CS-DTN从多个角度结合了节点自身及节点间的特性,更考虑了对节点的运动预测,降低了由不必要的消息转发带来的资源浪费,同时也能更高效地将消息投递到目的节点.仿真结果表明CS-DTN较为明显地提升了消息的成功投递率并降低了消息的平均端到端延迟,在缓存足够的前提下,CS-DTN可以实现高达95%的投递率,而在资源有限的情况下也能获得80%以上的投递率.

  • 作者

    张振京  金志刚  舒炎泰  ZHANG Zhen-Jing  JIN Zhi-Gang  SHU Yan-Tai 

  • 作者单位

    天津大学计算机科学与技术系 天津300072/天津大学通信工程系 天津300072

  • 刊期

    2013年3期 ISTIC EI PKU

  • 关键词

    延迟容忍网络  路由  分簇  社会网络  投递率 

参考文献
  • [1] Grossglauser M.;Tse D.N.C.. Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Transactions on Networking: A Joint Publication of the IEEE Communications Soceity, the IEEE Computer Society, and the ACM with Its Special Interest Group on Data Communication, 2002,4
  • [2] Dang, H.;Wu, H.. Clustering and cluster-based routing protocol for delay-tolerant mobile networks. IEEE transactions on wireless communications, 2010,6
  • [3] Pan Hui;Crowcroft J;Yoneki E. Bubble Rap:Social-based forwarding in delay tolerant networks. 香港, 2008
  • [4] Erramilli V;Crovella M;Chaintreau A;Diot C. Delegation forwarding. 香港, 2008
  • [5] Nelson S C;Bakht M;Kravets R. Encounter-based routing in DTNs. Rio de Janeiro,Brazil, 2009
  • [6] Jahanbakhsh K;Shoja G C;King V. Social-Greedy:A sociallybased greedy routing algorithm for delay tolerant networks. Pisa,Italy, 2010
  • [7] Hossmann T;Spyropoulos T;Legendre F. Know thy neighbor:Towards optimal mapping of contacts to social graphs for DTN routing. San Deigo,USA, 2010
  • [8] Ramanathan R;Hansen R;Basu P;Rosales-Hain R Krishnan R. Prioritized epidemic routing for opportunistic networks. San Juan,USA, 2007
  • [9] Spyropoulos T;Psounis K;Raghavendra C. Spray and wait:An efficient routing scheme for intermittently connected mobile networks. Philadelphia USA, 2005
  • [10] Spyropoulos T;Psounis K;Raghavendra C. Single-copy routing in intermittently connected mobile networks. Santa Clara,California,USA, 2004
  • [11] Lindgren A;Doria A;Schelen O. Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 2003,03
  • [12] Ahmed S;Kanhere S. Cluster-based forwarding in delay tolerant public transport networks. Dublin,Ireland, 2007
  • [13] Whitbeck J;Conan V. HYMAD:Hybrid DTN-MANET routing for dense and highly dynamic wireless networks. Computer Communications, 2010,13
  • [14] Vahdat A;Becker D. Epidemic routing for partially-connected ad hoc networks[Technical Report:CS-200006]. Durham NC,USA:Duke University, 2000
  • [15] Daly E;Haahr M. Social network analysis for routing in disconnected delay-tolerant MANETs. Montreal,Canada, 2007
查看更多︾
相似文献 查看更多>>
52.55.186.225