Probabilistic Routing Based on Two-Hop Information in Delay/Disruption Tolerant Networks

Algorithm 1

The message transmission when node with a message for the destination encounters node .

for  nodes and   do

 Drop the message with an expired lifetime;

 Exchange history information of contacts;

 Update delivery predictability according to (1)–(3);

 Calculate and according to (5);

end

if    then

 Node continue to carry the message;

end

else

 Node replicates the message and forwards it to node ;

 Node check its buffer space;

 if its buffer being full with the received message then

  Drop a message in its buffer according to FIFO queue;

 end

 Node carry the message;

end