计算机科学 ›› 2016, Vol. 43 ›› Issue (Z6): 295-300.doi: 10.11896/j.issn.1002-137X.2016.6A.071
贾建鑫,刘广钟,徐明
JIA Jian-xin, LIU Guang-zhong and XU Ming
摘要： 针对提高传递命中率、减少网络传输延时和网络开销,提出了基于时空和社会性的概率路由算法,称之为 GTSP(Geographical area AND Time Combine Social And Probability)。该算法首先根据节点之间经常以大概率相遇的时间段和地理区域确定每个节点以及节点之间在特定时间段和地理区域上的相遇概率较大的几个节点组成的表和共同朋友节点表；然后节点根据GTSP算法进行移动和转发数据包,从而避免了节点在错误的时间段和地理区域内的移动。仿真结果表明,与Prophet路由算法、SprayAndWait路由算法以及SimBet路由算法相比,所提路由算法在平均传输时延、传递命中率、网络开销方面取得了较大的改善。
| [1] Jain S,Fall K R,Patra R K.Routing in a delay tolerant network[C]∥Proc.SIGCOMM.2004:145-158 [2] Vahdat A,Becker D.Epidemic routing for partially-connected ad hoc networks[R].Duke University,Durham,NC,USA,2000 [3] Lindgren A,Doria A,Scheln O.Probabilistic routing in intermittently connected networks[J].Mobile Comput.Commun,Rev,2003,7(3):19-20 [4] Costa P,Mascolo C,Musolesi M,et al.Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks[J].IEEE J.Sel.Areas Commun,2008,6(5):748-760 [5] Jones E,Li L,Schmidtke J,et al.Practical Routing in Delay-To-lerant Networks[J].IEEE Transactions on Mobile Computing,2007,6(8):943-959 [6] Spyropoulos T,Psounis K,Cauligi S,et al.Efficient routing in intermittently connected mobile networks:themultiple-copy case[J].IEEE Transactions on Networking,2008,16(1) :77-90 [7] Fall K.Delay-tolerant network architecture for challenged internets[C]∥Proceedings of the 2003 Conference on Applications,Technologies,Architectures,and Protocols for Computer Communications.ACM,2003:27-34 [8] Daly E M,Haahr M.Social network analysis for routing in disconnected delay-tolerant manets[C]∥Proceedings of the 8th ACM International Symposium on Mobile Ad hoc Networking and Computing.ACM,2007:32-40 [9] 陈元甲.DTN路由算法的研究与改进[D].长沙:中南大学,2010 |
| No related articles found! |
|
||
首页