Learning Automata Based Caching for Efficient Data Access in Delay Tolerant Networks

Algorithm 3

The updating process.

Require: Each node updates the action probability vector and eliminates obsolete votes.

Ensure: Each node updates the action probability vector and construct a new caching node set.

procedure UPDATING PROCESS

   Update node information and eliminate obsolete information

  Eliminate the obsolete vote weight values from

  Eliminate the obsolete node information from

  Eliminate the obsolete from

   Determine the caching nodes set using the learning automata

  if then          determine the reward and penalty parameter

  else

  end if

  if and then         determine the reinforcement signal

  else

  end if

  if then                   Reward

  else if then                  Penalty

  end if

  if then        Determine the caching node

  else

  end if

end procedure