Algorithm 1: Secure edge-based energy management protocol

Input:

N: nodes.

$s_k$: secret keys.

$X_i$: fitness function.

SN: sink node.

GW: gateway devices.List_N: list of neighbors.

Output: Data forwarders, multiple routes, nearest neighbors, authentic nodes, privacy

Procedure multipaths

for (i=1; i<=N; i++)

do

construct routing tables

store the information

end for

for (i=1; i<=List_N; i++)

extract node information $id$$, d_{i }$, positioning coordinates

compute fitness function $X_i$$=\alpha e_i$$+\beta l_i$ + γ$p_i$

identify group $G_i$ using fitness function

compute error rate $f(X_i\prime$$)={\displaystyle \sum }_{i=0}^n{X}_i$+ µ

end for

end procedure

Procedure authentic_comm

for each $nod{e}_i$$\in$$[1: \mathrm{list}\_{\mathrm{N}}_{ }$]

do

SN shares the keys for nodes and edges

Validate the incoming keys and store them in the table

if key= valid

call encryption ( )

else

record the information in the table

end if

end for

Procedure data_verification( )

negotiate edge devices and SN

if authentication is verified

call data transmission ( )

end procedure