Probabilistic routing algorithm based on node congestion in DTN
一种考虑节点拥塞情况的DTN概率路由算法*

The delay tolerant network is a new network system structure. The probabilistic routing algorithm calculates and updates encounter probability based on encounter frequency of history, and determines whether to forward messages according to the encounter probability. When the buffer of the node is restricted by the size, the networks that use the probabilistic routing would more easily have node congestion, influence the transmission of the messages. In order to reduce the influence of the congestion on the PROPHET, this paper proposed PROPHET-NC (probabilistic routing algorithm based on node congestion), which combined encounter probability with the node congestion situation to estimate delivery probability of messages, lessened the influence on network performance caused by the congestion, enhanced the delivery probability, reduced the time that messages stay in the buffer. The simulation results show that comparing to the PROPHET, in PROPHET-NC the delivery probability of message is obviously increased higher and the average latency is decreased.