Table of Content

Open Access iconOpen Access



Prophet_TD Routing Algorithm Based on Historical Throughput and Encounter Duration

Jingjian Chen1, Gang Xu1, *, Fengqi Wei1, Liqiang He2

1 College of Computer Science, Inner Mongolia University, Huhehot, 010000, China.
2 Geomechanica Inc., Toronto, M5H 2Y2, Canada.

* Corresponding Author: Gang Xu. Email: email.

Computers, Materials & Continua 2020, 64(3), 1845-1858.


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.


Cite This Article

J. Chen, G. Xu, F. Wei and L. He, "Prophet_td routing algorithm based on historical throughput and encounter duration," Computers, Materials & Continua, vol. 64, no.3, pp. 1845–1858, 2020.

cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 2060


  • 1382


  • 0


Share Link