@Article{cmc.2020.010010,
AUTHOR = {Jingjian Chen, Gang Xu, Fengqi Wei, Liqiang He},
TITLE = {Prophet_TD Routing Algorithm Based on Historical Throughput  and Encounter Duration},
JOURNAL = {Computers, Materials \& Continua},
VOLUME = {64},
YEAR = {2020},
NUMBER = {3},
PAGES = {1845--1858},
URL = {http://www.techscience.com/cmc/v64n3/39462},
ISSN = {1546-2226},
ABSTRACT = {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.},
DOI = {10.32604/cmc.2020.010010}
}