DocumentCode
668808
Title
Probability routing algorithm based on historical throughput in DTN network
Author
Hongcheng Huang ; Yiding Mao ; Xi Zhang
Author_Institution
Chongqing Univ. of Posts & Telecommun., Chongqing, China
fYear
2013
fDate
20-22 Nov. 2013
Firstpage
450
Lastpage
453
Abstract
In delay tolerant network, data transfer depends not only on the number of node contacts, each contact is more dependent on their quality, because of this proposed a probability routing algorithm based on historical data throughput. Through evaluated the historical contact time and historical throughput two factors, to calculation forward probability, so that the high quality contact play a leading role of the forward probability. The simulation indicate that the algorithm is compared with the traditional routing can greatly increase the probability of data delivery ratio.
Keywords
delay tolerant networks; network routing; probability; telecommunication network routing; DTN network; data delivery ratio; data transfer; delay tolerant network; forward probability; historical data throughput; node contacts; probability routing algorithm; Attenuation; Delays; Educational institutions; History; Probability; Routing; Throughput; DTN; Probabilistic Routing; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Consumer Electronics, Communications and Networks (CECNet), 2013 3rd International Conference on
Conference_Location
Xianning
Print_ISBN
978-1-4799-2859-0
Type
conf
DOI
10.1109/CECNet.2013.6703366
Filename
6703366
Link To Document