期刊文献+

一种新的效用冗余混合DTN路由算法 被引量:5

Novel Utility and Redundancy Hybrid DTN Routing Algorithm
下载PDF
导出
摘要 针对容迟网络(DTN)的高延迟、间歇性连接和资源受限等特点,提出一种新的效用冗余混合DTN路由算法NHRA。根据节点的相遇频率和连通时长等信息估算消息转发效用,指定消息在网络中的最大拷贝数,根据消息转发效用结合基于二叉树的方法来分配消息拷贝任务,实现消息的多路径并行传输,在提高传输性能的同时,有效地控制了网络开销。仿真实验结果表明,与现有相关算法相比,该算法可获得更高的消息传达率,并且花费的通信开销更低。 Aiming at the characteristics of the delay tolerant networking, a novel hybrid Delay Tolerant Network(DTN) routing algorithm based on the combination of utility and redundancy is proposed. The utility of message forwarding is estimated according to value of the encounter frequency and connectivity duration, and the maximum number of copies of the message is designated in source node. The forwarding task of the message copies is assigned to the node based on the method of binary tree according to the utility of message forwarding, thus the multi-path parallel transmission can be realized for message. Simulation results show that the proposed routing algorithm can achieve higher rate of message delivering than the relative existing algorithm, and reduce communication cost significantly.
出处 《计算机工程》 CAS CSCD 北大核心 2011年第4期90-92,共3页 Computer Engineering
基金 广西师范大学博士科研启动基金资助项目
关键词 容迟网络 路由算法 转发效用 Delay Tolerant Network(DTN) routing algorithm forwarding utility
  • 相关文献

参考文献5

  • 1熊永平,孙利民,牛建伟,刘燕.机会网络[J].软件学报,2009,20(1):124-137. 被引量:324
  • 2Becker V D. Epidemic Routing for Partially Connected Ad Hoc Networks[R]. Durham, USA: Department of Computer Science, Duke University, Technique Report: CS-2000-06, 2000.
  • 3Spyropoulos T, Psounis K, Raghavendra C S. Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks[C]//Proc. of the 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking. Philadelphia, USA: ACM Press, 2005: 252-259.
  • 4Lindgren A, Doria A, Schelen O. Probabilistic Routing in Intermittently Connected Networks[J]. ACM SIGMOBILE Mobile Computing and Communications Review, 2003, 7(3): 19-20.
  • 5Homepage of Opportunistic Network Environment[EB/OL]. (2009-10-20). http://www.netlab.tkk.fi/tutkimus/dtn/theone/Version1.3.0.

二级参考文献67

  • 1Hull B, Bychkovsky V, Zhang Y, Chen K, Goraczko M, Miu A, Shih E, Balakrishnan H, Madden S. CarTel: A distributed mobile sensor computing system. In: Proc. of the 4th Int'l Conf. on Embedded Networked Sensor Systems. Boulder: ACM, 2006. 125-138.
  • 2Pan H, Chaintreau A, Scott J, Gass R, Crowcroft J, Diot C. Pocket switched networks and human mobility in conference environments. In: Proc. of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia: ACM. 2005. 244-251.
  • 3Juang P, Oki H, Wang Y, Martonosi M, Peh LS, Rubenstein D. Energy-Efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet. In: Proc. of the 10th Int'l Conf. on Architectural Support for Programming Languages and Operating Systems. New York: ACM, 2002.96-107. DO1=http://doi.acm.org/10.1145/605397.605408
  • 4Pelusi L, Passarella A, Conti M. Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. Communications Magazine, 2006,44(11): 134-141.
  • 5Conti M, Giordano S. Multihop ad hoe networking: The reality. Communications Magazine, 2007,45(4):88-95.
  • 6Fall K. A delay-tolerant network architecture for challenged Internets. In: Proc. of the 2003 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications. Karlsruhe: ACM, 2003.27-34.
  • 7Akyildiz IF, Akan B, Chert C, Fang J, Su W. InterPlaNetary Intemet: State-of-the-Art and research challenges. Computer Networks, 2003,43(2):75-112.
  • 8Gupta P, Kumar P. The capacity of wireless networks. IEEE Trans. on Information Theory, 2000,46(2):388-404.
  • 9Grossglauser M, Tse DNC. Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans. on Networking, 2002, 10(4):477-486.
  • 10Small T, Haas ZJ. The shared wireless infostation model: A new ad hoc networking paradigm (or where there is a whale, there is a way). In: Proc. of the 4th ACM Int'l Symp. on Mobile Ad Hoc Networking. Annapolis: ACM, 2003. 233-244.

共引文献323

同被引文献39

  • 1Nelson S C, Bakht M, Kravets R, et al. Encounter: Based routing in DTNs [C]. Rio de Janeiro: INFOCOM IEEE, 2009: 846-854.
  • 2Thompson N, Kravets R. Poster abstract: Understanding and controlling congestion in delay tolerant networks [J]. ACM SIGMOBILE Mobile Computing and Communications Review, 2009, 13 (3) : 42-45.
  • 3Daly E, Mads Haahr. Social network analysis for information flow in disconnected delay-tolerant MANETs [J]. IEEE Trans, 2009, 8 (5): 606-621.
  • 4Pujol J, Toledo A, Rodriguez P. Fair routing in delay tolerant networks [C]. Rio de Janeiro:INFOCOM IEEE, 2009: 837-845.
  • 5Eyuphan Bulut, Boleslaw K Zymanski. Friendship based routing in delay tolerant mobile social networks [C]. Miami:Globecom, 2010: 6-10.
  • 6PU Tournoux, Leguay J. The accordion phenomenon: Analysis characterization and impact on DTN routing[C]. Rio de Janeiro: INFOCOMIEEE, 2009: 1116-1124.
  • 7Seligman M, Fall K, Mundur P. Storage routing for DTN congestion control[J]. Wireless Communications and Mobile Computing, 2007, 7 (10): 1183-1196.
  • 8Milena Radenkovic, Andrew Grundy. Congestion aware forwarding in delay tolerant and social opportunistic networks [C]. Bardonecchia:Wireless On-Demand Network Systems and Services Eighth International Conference, 2011:60 67.
  • 9周旋,王忠,朱庆.Ad Hoc网络中拓扑结构对路由协议性能的影响[J].信息与电子工程,2007,5(5):377-381. 被引量:1
  • 10Vahdat A,Becker D.Epidemic routing for partially connected ad hoc networks. Technical Report CS-2000-06 . 2000

引证文献5

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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