Algorithm 1. Procedure A. Procedure (A): $gen:rand\left(n^{LA},s:seed\right)$

Input: $n^L,seed, s:seed$ Output: $random number, R$ 1. Get node MAC address (48 bits), $n^{LA}$ 2. Set random seed matrix $seed \left[i\ast k\right]$ 3. Computer, $s:seed$ $\forall n^i\left(c^i,\mathsf{\tau }\right)$; $n^i-sender, c^i-channel id, \mathsf{\tau }-Session id$             $s:seed=n^{LA}\left|\right|seed \left[i\left(x\right)\ast k\left(x\right)\right]$       $n\_r^i=rand\left(s:seed\left|\left|T\right|\right|N\right)$; $T-Timestamp , N-Nonce$ 4. Call the SHA-3 (512 Bits) function and do                $R=Sha\mathbf{\_}{\mathbf{3}}^{\mathbf{512}}\left(n_r{}^i\right)$ 5. Start binary bit string computation,         $Rb=tr\_bin\left(R\right)$; $tr\_bin-Bit truncation$ 6. Redo for all $n^i$. 7. Construct binary $Rb$ matrix, $Rb\left[i\ast k\right]$ 8. Generate random slot bits, $R=rand\_elect\left(Rb\left[i\ast k\right]\right)$ 9. Store $R^i$ in $Key \left[s\right]$ iteratively 10. Recall the steps from 1 to 10.

End of Procedure (A)