Research Article
Probabilistic Caching Placement in the Presence of Multiple Eavesdroppers
Algorithm 1
Optimization of probabilistic caching placement.
| Input: input parameters , , , , , | | Output: output the optimal caching probability | | and the average probability of success transmission | | (1) Initialize | | (2) | | (3) for do | | (4) | | (5) | | (6) | | (7) | | (8) end for | | (9) function | | (10) ObjectiveFunction= | | (11) | | (12) Initialize and | | (13) ConstraintFunction= | | (14) | | ,,,,, | | , | | (15) return | | (16) end function | | (17) function | | (18) | | (19) | | (20) calculate , , | | (21) | | (22) | | (23) return | | (24) end function |
|