期刊文献+

基于连接质量和节点相关度的机会网络路由 被引量:1

Opportunistic network routing based on link quality and nodes similarity
下载PDF
导出
摘要 提出利用连接质量估计节点间消息成功转发的概率,并证明了节点间相关度越高,消息转发率越高。在此基础上,提出基于连接质量和节点相关度的机会网络路由机制。路由计算节点转发效用值时,综合了连接质量和节点相关度;消息转发时,不断向相对于目的节点转发效用值高的节点转发消息。仿真结果表明,与传统路由相比,在消息送达率相同的前提下,该路由消息延迟更小、消耗的总能量更少。 A new concept called link quality is used to estimate the delivery probability between nodes. It is also proved that the higher the node similarity is, the higher the messages forwarding rate becomes. And then, the opportunistic network routing based on Link Quality and Nodes Similarity(LQ-NS) is proposed, and the message delivery utility is calculated with LQ-NS. The messages are continually forwarded to the nodes with higher utility relative to the destination nodes. Simulation results show that the LQ-NS routing has significantly reduced the message delay and total energy consumption compared to traditional Epidemic and Probabilistic Routing Protocol using History of Encounters and Transitivity(PRoPHET).
出处 《太赫兹科学与电子信息学报》 2014年第1期62-66,共5页 Journal of Terahertz Science and Electronic Information Technology
关键词 机会网络 连接质量 节点相关度 转发效用 opportunistic network link quality nodes similarity forwarding utility
  • 相关文献

参考文献10

二级参考文献37

  • 1Becker 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.
  • 2Spyropoulos 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.
  • 3Lindgren A, Doria A, Schelen O. Probabilistic Routing in Intermittently Connected Networks[J]. ACM SIGMOBILE Mobile Computing and Communications Review, 2003, 7(3): 19-20.
  • 4Homepage of Opportunistic Network Environment[EB/OL]. (2009-10-20). http://www.netlab.tkk.fi/tutkimus/dtn/theone/Version1.3.0.
  • 5Fall K. A delay tolerant network architecture for challenged Internets [C] //Proc of SIGCOMM'03. New York: ACM, 2003: 27-34.
  • 6Vahdat, A, Becker D. Epidemic routing for partially connected ad hoc networks, CS-2000-06 [R]. Durham, NC: Department of Computer Science, Duke University, 2000.
  • 7Spyropoulos T, Psounis K, Raghavendra C S. Spray and wait: An efficient routing scheme for intermittently connected mobile Networks [C] //Proc of SIGCOMM'05. New York: ACM, 2005:22-26.
  • 8Lindgren A, Doria A, Schelèn O. Probabilistic routing in intermittently connected networks [J], Mobile Computing and Communications Review, 2003, 7(3): 19-20.
  • 9Jain S, Fall K, Patra R. Routing in a delay tolerant network [C]//Proc of SIGCOMM'04. New York: ACM, 2004: 145- 158.
  • 10Blum J, Eskandarian A, Hoffman L J. Performance characteristics of inter-vehicle ad hoe networks [C] //Proc of the 6th IEEE Int Conf on Intelligent Transportation Systems. Piscataway, NJ: IEEE, 2003:114-119.

共引文献21

同被引文献14

引证文献1

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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