Algorithm 1 Calculating the AMoF for malicious and normal nodes
1:	Input: $CC{I}^{\left(S_n\right)}{}_1$,………, $CC{I}^{\left(S_n\right)}{}_N$,
2:	Output: AMoF
3:	At the super node
4:	$\forall node\in NUT$
5:	Receive $CC{I}^{\left(S_n\right)}{}_1$,………,$CC{I}^{\left(S_n\right)}{}_N$ S.T $CC{I}^{\left(NUT\right)} is N\times n$
6:	Initialize $Tem{p}^{\left(S_j\right)}$, Norm_$Tem{p}^{\left(S_j\right)}{}_i$, $Sigm{a}^{\left(S_j\right)}{}_i, AMo{F}^{\left(S_j\right)}{}_i$
7:	for i = 1 to $N$ do
8:	for j = 1 to n do
9:	$Tem{p}^{\left(S_j\right)}{}_i$←$|(CC{I}^{\left(S_j\right)}{}_{i+1}-CC{I}^{\left(S_j\right)}{}_i)|+Tem{p}^{\left(S_j\right)}{}_{i-1}$
10	$Norm\_Tem{p}^{\left(S_j\right)}{}_i$←$Tem{p}^{\left(S_j\right)}{}_i$/100
11:	end for
12:	$AMo{F}^{\left(S_j\right)}{}_i$← $(Norm\_Tem{p}^{\left(S_j\right)}{}_i/n$) +$AMo{F}^{\left(S_j\right)}{}_{i-1}$
13:	end for