A BPPE Algorithm for Instantly Decodable Network Coding in Wireless Broadcasting

Instantly decodable network coding (IDNC) is a low-cost network coding technique for recovering unattained packets by multiple receivers. Due to its NP-hard nature, finding the optimal IDNC coded packets is intractable. In the well-known graph-based method proposed by Sorour
et al.
, a maximum weight clique selection problem is formulated as an approximation, and a heuristic algorithm called
maximum weight clique
(MWC) is proposed in maximizing the clique weight. In this letter, a base policy-based partial enumeration (BPPE) algorithm is proposed in addressing the maximum weight clique selection problem. In particular: 1) the necessity of constructing the IDNC graph as in MWC is eliminated and 2) different enumeration lengths could be chosen, so that a consistent performance-run time tradeoff could be achieved. Simulation results testify the effectiveness of BPPE in addressing the maximum weight clique selection problem over existing algorithms in terms of performance-run time tradeoff.