Research on the Improved Probabilistic Routing Scheme in Delay Tolerant Networks
Han Zui-jia · Scientific and Technological Management of Land and Resources · 2015
History-based routing protocols in delay tolerant networks use coarse-grained encounter information to make messages forwarding decisions.However,the coarse-grained information cant give precise expression of the contact patterns between nodes in the network,thereby leading to inaccurate forwarding decisions.To solve this problem,aprobabilistic routing scheme based on fine-grained contact characterization named FG-PRICN was presented to count information.A greedy forwarding scheme was designed by combining the advantages of contact duration-based forwarding and quota-based routing.Each node in FG-PRICN uses a slotted sliding window mechanism to maintain the information of historical contact,by which new contact information can be quickly incorporated and outdated history data can be easily removed.The granularity of collected history data can be controlled by adjusting the size of the sliding window,and thus reflects the contact patterns.The performance of FG-PRICN was evaluated through extensive simulations,and results show that,compared with existing schemes,FG-PRICN can significantly enhance message delivery rate with low communication overhead.