Algorithm 1: Secure, Energy- and SLA-Efficient (SESE) Algorithm without involvement of malicious device

Input: $\mathit{G}\left(\mathit{N},\mathit{E}\right),\mathbf{\sigma }, \mathit{d}\left(\mathit{u},\mathit{v}\right), \mathbf{\omega }\left(\mathit{u},\mathit{v}\right),\mathit{c}\left(\mathit{u},\mathit{v}\right) , \mathit{M}\mathit{T}\mathit{T}\mathit{F}\left(\mathit{u},\mathit{v}\right), {\mathit{r}}_{\mathit{u}},{\mathit{P}}_{\mathit{u}}{\mathit{t}}_{\mathit{s}} \mathbf{and} \mathit{M}\mathit{T}\mathit{T}{\mathit{F}}_{\mathit{s}}$

Output: SLA-energy Cooperative Quickest Path (SESE)

BEGIN{

Initialization:

$\mathit{j}\leftarrow \mathbf{1},$

Procedure:

STEP 0: Variable Declaration

$\mathit{G}\leftarrow \mathbf{Network}$

$\mathit{N}\leftarrow \mathbf{Set} \mathbf{of} \mathbf{nodes}$

$\mathit{E}\leftarrow \mathbf{Set} \mathbf{of} \mathbf{links}$

$\mathit{c}\left(\mathit{u},\mathit{v}\right)\leftarrow \mathbf{Capacity} \mathbf{of} \mathbf{the} \mathbf{link} \left(\mathit{u},\mathit{v}\right)$

$\mathit{d}\left(\mathit{u},\mathit{v}\right)\leftarrow \mathbf{Delay} \mathbf{of} \mathbf{link} \mathbf{the} \left(\mathit{u},\mathit{v}\right)$

$\omega \left(\mathit{u},\mathit{v}\right)\leftarrow \mathbf{Energy} \mathbf{rate} \mathbf{of} \mathbf{link} \mathbf{the} \left(\mathit{u},\mathit{v}\right)$

${\mathit{P}}_{\mathit{u}}\leftarrow \mathbf{Endowed} \mathbf{energy} \mathbf{at} \mathbf{node} \mathit{u}$

${\mathit{r}}_{\mathit{u}}\leftarrow \mathbf{Requested} \mathbf{service} \mathbf{performance} \mathbf{factor} \mathbf{at} \mathbf{node} \mathit{u}$

$\mathbf{\sigma }\leftarrow \mathbf{Data}$

${\mathit{t}}_{\mathit{s}}\leftarrow \mathbf{Requested} \mathbf{service} \mathbf{time}$

$\mathit{M}\mathit{T}\mathit{T}{\mathit{F}}_{\mathit{s}}\leftarrow \mathbf{Mean} \mathbf{Time} \mathbf{to} \mathbf{Failure} \mathbf{of} \mathbf{service}$

$\mathit{M}\mathit{T}\mathit{T}\mathit{F}\left(\mathit{u},\mathit{v}\right)\leftarrow \mathbf{Mean} \mathbf{Time} \mathbf{to} \mathbf{Failure} \mathbf{of} \mathbf{a} \mathbf{link}$

STEP 1: Find $\mathit{r}$ capacities corresponds to critical-continuous service and label of minimum capacity:

(i)    ${\mathit{c}}_{\mathbf{1}}<{\mathit{c}}_{\mathbf{2}}<{\mathit{c}}_{\mathbf{3}}\cdots <{\mathit{c}}_{\mathit{r}}$

(ii)   ${\mathit{c}}_{\mathit{m}\mathit{i}\mathit{n}}\left(\mathit{u},\mathit{v}\right)$ with AND rule

STEP 2: Solve $\mathit{S}\mathit{P}{\mathit{P}}_{\mathit{j}}$ w.r.t. delay time $\mathit{d}\left(\mathit{u},\mathit{v}\right)$ in ${\mathit{G}}_{\mathit{j}}$ with capacities ${\mathit{c}}_{\mathit{j}}$

For  $\mathit{j}\leftarrow \mathbf{1}:\mathit{r}$

Set $\mathit{j}\leftarrow \mathbf{1}$

Solve $\mathit{S}\mathit{P}{\mathit{P}}_{\mathit{j}}$.

If No $\mathit{s}-\mathit{t}$ path in ${\mathit{G}}_{\mathit{j}}$ with capacity with ${\mathit{c}}_{\mathit{j}}$

go to STEP3

else

Let ${\mathit{P}}_{\mathit{j}}$ is an optimal solution for ${\mathbf{SPP}}_{\mathit{j}}$ with capacity $\mathit{c}\left({\mathit{P}}_{\mathit{j}}\right)={\mathit{c}}_{\mathit{j}}$

end

end

STEP 3:

If $\mathit{j}= \mathit{r}$

go to STEP4

else

set $\mathit{j}=\mathit{j}+\mathbf{1}$ and go to STEP2

end

STEP 4: Find the solution

Compute the index $\mathit{h}\in \left(\mathbf{1}, \mathbf{2},\dots \mathit{r}\right)$ of path array ${\mathit{P}}_{\mathit{j}}$

${\mathit{T}}_{\mathbf{\sigma }}\left({\mathit{P}}_{\mathit{h}}\right)=\underset{\mathit{j}=\mathbf{1},\dots , \mathit{r}}{\mathbf{min}}{\mathit{T}}_{\mathbf{\sigma }}\left({\mathit{P}}_{\mathit{j}}\right)$

${\mathit{P}}_{\mathit{h}}$ is an optimal solution of the SESE

} END