Algorithm 2. Procedure B. Procedure (B): $f_{Inter}\left(R^i, IHF\right)$

Input: $R^i$ Output: Interleaved Honeypot Frames On Channel 1. Set $n^i$ to data transmission mode 2. Get the stream of $R^i$ from Procedure B 3. Set Interleaved Honeypot Frame (IHF) queue $IR{Q}^i$ at sender 4. Do for each transmission, $n(T{X}^i)$ at sender                   $If\left(R^i==p\left(\mathbf{1}\right)\right):$              $pop\left(IR{Q}^i\right) \& IR{Q}^i\left(count\right)--$              $Insert \left(f^i,f^{i+\mathbf{1}}, IH{F}^i\right)\to n(T{X}^i)$            $If\left(R^i==p\left(\mathbf{0}\right)\right):$              $Insert \left(f^i\right)\to n(T{X}^i)$            $Else:$              $n(T{X}^i)\to Error$ 5. Set Deinterleaver Honeypot Frame (DHF) queue $DR{Q}^i$ at receiver 6. Do for each reception, $n(R{X}^i)$ at receiver                $If\left(R^i==\mathbf{1}\right):$              $pop\left(f^i,f^{i\mathbf{+}\mathbf{1}}, IH{F}^i\right) \& push (DR{Q}^i)$              $DR{Q}^i\left(count\right)++$                 $If\left(R^i==\mathbf{0}\right):$              $n(R{X}^i)\to Receive Frame$            $Else:$              $n(R{X}^i)\to Error$ 7. Do for all active channels, $C(A{X}^i)$ 8. Call Procedure (A) for each $n(T{X}^i)$ at $C(A{X}^i)$ 9. Set the number of $IH{F}^i$ as $k\mathbf{\propto }c\left(I\right)$; $c\left(I\right)-Channel Independence Factor$

End of Procedure (B)