FENC assumes that intermediate node has pre-knowledge of the neighbor buffers.
To increas the chance to find optimal combination in large scale networks, FENC can be done more than once on output queue in intermediate node.
FENC complexity calculates by multiplying number of sets in tree by complexity of running OpNC upon each set.
Therefore, complexity of FENC calculates by multiplying number of sets in tree by complexity of running OpNC upon each set:
FENC uses network coding to increase transmitted packet in each transmission either.
11 we compare OpNC, FENC and NoNC approaches in term of the total throughput.
FENC uses network coding and therefore it has more packet for combination.
On the contrary, FENC does not need to produce all combinations, therefore it is fast and can schedule more packets compared with OpNC at the same time.