Algorithm 2: Scrutiny of Offloaded Task Algorithm using TOPSIS

1Inputs: 2Parameters used for task scrutiny (Trust probability ${\sigma }_{TF}$, task size $t_s$, time elapsed t) 3Steps of Algorithm: 41: Normalization of individual vectors per task offloading feature (${\sigma }_{TF}$, $t_s$, t). The Objective of this algorithm is to maximize all the attribute values for the offloaded tasks. 5    $\mathrm{Normalized}\mathrm{Value}=\frac{\mathrm{Actual}\mathrm{Value}}{\sqrt{\sum \mathrm{Actual}{\mathrm{Value}}^2}}$ 62: Calculation of the weighted normalized values for each offloaded task 7    WeightedValue = $({\sigma }_{TF}\times W_{{\sigma }_{TF}})+(t_s\times W_{t_s})+(t\times W_t)$ 8    where $W_{{\sigma }_{TF}}$, $W_{t_s}$, and $W_t$ are the weights. 93: Calculation of the negative-ideal and ideal solutions for each feature. 10     For the Ideal solution, use the Maximum normalized value for all the parameters. 11     For the Negative-ideal solution, use minimum normalized value for all the parameters. 124: Calculation of the nearness of every task to the negative-ideal and ideal solutions using a Euclidean distance measure. 13     $D_i^{+}=\sqrt{{\sum }_{j=1}^m{({\mathrm{NormalizedValue}}_{ij}-{\mathrm{IdealSolution}}_j)}^2}$ 14     $D_i^{-}=\sqrt{{\sum }_{j=1}^m{({\mathrm{NormalizedValue}}_{ij}-{\mathrm{NegativeIdealSolution}}_j)}^2}$ 15Step 5: Computation of the TOPSIS measure for every task: 16     $TOPSI{S}_i=\frac{D_i^{-}}{D_i^{+}+D_i^{-}}$ 17Step 6: Ranking of the tasks based on their TOPSIS scores. 18     Tasks with a greater value of TOPSIS will be the most favorable for offloading as they match the criteria of higher value for all the parameters. 19Output: 20The prioritized offloaded tasks for offloading based on TOPSIS scores. 21Task offloading starting from highly ranked tasks based on TOPSIS.