Probabilistic Routing Based on Two-Hop Information in Delay/Disruption Tolerant Networks
Figure 1
Comparison of different routing algorithms for message forwarding in a DTN where and . (a) PRoPHET in [16, 17], where node continues to carry the message. (b) Probabilistic routing based on two-hop neighbors’ information, where node is selected as the forwarder to carry the message.
