计算机科学 ›› 2015, Vol. 42 ›› Issue (10): 113-116.

• 网络与通信 • 上一篇    下一篇

一种基于区域划分的DTN路由算法

韩进,石 进,任勇军   

  1. 南京信息工程大学江苏省网络监控工程中心 南京210044;南京信息工程大学计算机与软件学院 南京210044,南京大学信息管理学院 南京210046,南京信息工程大学江苏省网络监控工程中心 南京210044;南京信息工程大学计算机与软件学院 南京210044
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受江苏高校优势学科建设工程资助

DTN Routing Algorithm Based on Region Segmentation

HAN Jin, SHI Jin and REN Yong-jun   

  • Online:2018-11-14 Published:2018-11-14

摘要: 在DTN网络组成的无向图中,随机运动节点的运动范围会在一段时间内局限在某个连通度高的区域,因此在该时间段内节点应优先处理目标接收节点 与其同区域的消息,而其离开该区域时,应优先交互接收节点在其它区域的消息。由此,提出基于区域划分的DTN路由算法。该算法使用随机实验的方法实现对DTN网络无向图的区域划分,并以节点自身所在区域及消息接收节点所在区域作为消息中转的依据实现DTN消息的路由。实验结果表明,该算法与PRoPHET、Epidemic、SAW相比,能达到较高的消息传输率,并有效降低消息副本的传输与复制。

关键词: DTN路由,区域划分,区域位置判断

Abstract: The randomly moving DTN nodes are often trapped for a period in highly connectivity regions of a undirected graph,which consists of DTN’s paths.So in the period,the messages whose receiver is in the same region with its sender in current local region should be exchanged first.Meanwhile,the messages whose receiver is in different regions with its sender nodes in current local region should be exchanged first when the nodes are leaving the message sender’s current local region.According to this strategy,a new DTN routing algorithm was presented in this paper.In the algorithm,a undirected graph is segmented into regions by random experiment method,and DTN’s messages are routed according to a node’s currently local region and the currently local region of receivers of messages.The results of experiments show that compared to PRoPHET,Epidemic,SAW,the algorithm can get relatively high message delivery successful rate and effectively reduce message copies transit times.

Key words: DTN routing,Region segmentation,Region location judgment

[1] Ali A,Panda M,et al.Improving the transport performance in delay tolerant networks by random linear network coding and global acknowledgments[J].Ad hoc Networks,2013,1(8):2567-2587
[2] Su Jin-shu,Hu Qiao-lin,Zhao Bao-kang,et al.Routing Techniques on Delay/Disruption Tolerant Networks[J].Journal of Software,2010,1(1):119-132
[3] Doria L A,et al.Probabilistic routing in intermittently connected networks[J].ACM SIGMOBILE Mobile Computing and Communications Review,2003,7(3):19-20
[4] Burgess J,Gallagher B,et al.MaxProp:Routing for VehicleBased Disruption Tolerant Networks[C]∥INFOCOM.2006:1-11
[5] Shi K.Semi-Probabilistic Routing in Intermittently ConnectedMobile Ad Hoc Networks[J].J.Inf.Sci.Eng.,2010,26(5):1677-1693
[6] Soares V N G J,Rodrigues J J P C,Farahmand F.GeoSpray:A geographic routing protocol for vehicular delay-tolerant networks[J].Information Fusion,2014,15:102-113
[7] Kernen A,Ott J,Krkkinen T.The ONE simulator for DTN protocol evaluation[C]∥Proceedings of the 2nd International Conference on Simulation Tools and Techniques.ICST (Institute for Computer Sciences,Social-Informatics and Telecommunications Engineering),2009:55
[8] Sun Jian-zhi,Liu Nai-rui,Zhang Ying-xin,et al.Performance Analysis of Typical Routing Algorithm in Opportunistic Network[J].Computer Engineering,2011,37(16):86-89

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!