A Quality of Service-Aware Secured Communication Scheme for Internet of Things-Based Networks

. 2019 Oct 6;19(19):4321. doi: 10.3390/s19194321

Algorithm 1 Sybil Node Detection
Initialization: K = ⌀, i = 0, $α$ = 1, $β$ = 1, $γ$ = 1, $δ$ = 1.
	procedure
2:	K ← K $_{t_{i}}$
4:	while $i < η$ do	▹ $η$ is the number of nodes.
6:	if K $_{t_{i}} \geq$ K $_{t_{i + 1}}$ then
8:	K $_{t_{i}}$ = K $_{t_{i}}$
10:	i = i + 1
12:	else
14:	K $_{t_{i}}$ = K $_{t_{i + 1}}$
16:	end if
18:	end while
20:	return K $_{t}$
22:	broadcast K $_{t}$ to all nodes in the network.	▹ After this broadcast, Node 0 will continue the following policy
24:	(K, R $_{m a x}$ ) ← $(\infty, ⌀)$
26:	while R $_{α} \in$ K do
28:	if R $_{α}$ (SN $_{β}$ ) ≠ RSSI(R $_{α}$ (SN $_{β}$ )) then
30:	Exclude R $_{α}$ (SN $_{β}$ )
32:	else
34:	RR $_{γ}$ ← R $_{α}$ (SN $_{β}$ )
36:	end if
38:	if R $_{α}$ (GN $_{β}$ ) ≠ RSSI(R $_{α}$ (GN $_{β}$ )) then
40:	Exclude R $_{α}$ (GN $_{β}$ )
42:	$α$ = $α$ + 1
44:	else
46:	RR $_{γ}$ ← R $_{α}$ (GN $_{β}$ )
48:	$γ$ = $γ$ + 1
50:	end if
52:	end while
54:	$γ$ = 1
56:	bool = true
58:	while bool do
60:	if SizeOf(RR $_{γ}$ (GN)) ≥ SizeOf(RR $_{γ + 1}$ (GN) then
62:	R $_{m a x}$ = RR $_{γ}$ (GN)
64:	$γ$ = $γ$ + 1
66:	else
68:	R $_{m a x}$ = RR $_{γ + 1}$ (GN)
70:	bool = false
72:	end if
74:	end while
76:	return R $_{m a x}$
78:	broadcast R $_{m a x}$ to all nodes in S.
80:	end procedure