Research Article
Learning Automata Based Caching for Efficient Data Access in Delay Tolerant Networks
Algorithm 1
The voting process in the vote-sending node.
| Require: Node makes a contact with node . | | Ensure: Node determines vote values and the vote-receiving node | | procedure VOTING PROCESS() | | (2) | | (3) | | Insert node into | | if node in then | | Let denote the position of node placed in | | if the relationship between and is uncertain then | | (8) | | (9) | | else if node contains the node information of node then | | (11) | | if then | | if then | | (14) | | (15) | | else ⊳ | | if node in then | | (18) | | if then | | (20) | | else | | (22) | | end if | | (24) | | else if node not in then | | if then | | (27) | | else | | (29) | | end if | | (31) | | end if | | end if | | else if then | | if then | | (36) | | (37) | | (38) | | else | | if node in then | | (41) | | (42) | | end if | | end if | | end if | | end if | | end if | | Generate and transmit direct vote and indirect vote message to node | | Generate and transmit node information of node to node | | end procedure |
|
