期刊文献+

Prophet_TD Routing Algorithm Based on Historical Throughput and Encounter Duration 被引量:1

下载PDF
导出
摘要 Opportunistic networks are self-organizing networks that do not require a complete path between the source node and the destination node as it uses encounter opportunities brought by nodes movement to achieve network communication.Opportunistic networks routing algorithms are numerous and can be roughly divided into four categories based on different forwarding strategies.The Prophet routing algorithm is an important routing algorithm in opportunistic networks.It forwards messages based on the encounter probability between nodes,and has good innovation significance and optimization potential.However,the Prophet routing algorithm does not consider the impact of the historical throughput of the node on message transmission,nor does it consider the impact of the encounter duration between nodes on message transmission.Therefore,to improve the transmission efficiency of opportunistic networks,this paper based on the Prophet routing algorithm,fuses the impact of the historical throughput of the node and the encounter duration between nodes on message transmission at the same time,and proposes the Prophet_TD routing algorithm based on the historical throughput and the encounter duration.This paper uses the Opportunistic Networks Environment v1.6.0(the ONE v1.6.0)as the simulation platform,controls the change of running time and the number of nodes respectively,conducts simulation experiments on the Prophet_TD routing algorithm.The simulation results show that compared to the traditional Prophet routing algorithm,on the whole,the Prophet_TD routing algorithm has a higher message delivery rate and a lower network overhead rate,and its average latency is also lower when node density is large.
出处 《Computers, Materials & Continua》 SCIE EI 2020年第9期1845-1858,共14页 计算机、材料和连续体(英文)
基金 The authors wish to thank the Natural Science Foundation of China under Grant Nos.61841109,61662054 Natural Science Foundation of Inner Mongolia under Grand No.2019MS06031.
  • 相关文献

参考文献5

二级参考文献53

  • 1EAGLE N, PENTLAND A. Reality mining: sensing compLex social systems[J]. Personal Ubiquitous Computing,2006,10(4):255-268.
  • 2Community resource for archiving wireless data at dartmouth [EB/OL]. (2010- 03). http://crawdad. cs. dartmouth, edu/.
  • 3Diot. Haggle project[ DB/OL]. (2004). http ://www. haggleproject. org.
  • 4CHOFFNES D R, BUSTAMANTE F E. An integrated mobility and traffic model for vehicular wireless networks [ C ]//Proc of the 2nd ACM International Workshop on Vehicular Ad hoc Networks. New York : ACM Press ,2005.
  • 5JOHNSON D B, MALTZ D A. Dynamic source routing in Ad hoc wireless networks[M]. [ S. l. ] :Kluwer Academic Press, 1996.
  • 6Le BOUDEC J Y L, VOJNOVIC M. Perfect simulation and stationarity of a class of mobility models [ C ]//Proc of the 24th anual Joint Conference on IEEE Computer and Communications Socitices. 2005 : 2743- 2754.
  • 7KURKOWSKI S, CAMP T, MUSHELL N, et al. A visualization and analysis tool for NS-2 wireless simulations [ C ]//Proc of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems. 2005:503-506.
  • 8JANERT P K. Gnuplot in action-understanding data with graphs [M]. [S. l. ]: Manning Press,2009.
  • 9KERANEN A, OTT J, KXRKKAINEN T. The ONE simulator for DTN protocol evaluation [ C ]//Proc of the 2nd International Conference on Simulation Tools and Techniques. 2009.
  • 10TKK/COMNET. Project page of the ONE simulator [ EB/OL ]. (2008). http://www. netlab, tkk. fi/tutkimus/dtn/theone.

共引文献39

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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