Instantly decodable network codes for real-time applications
Instantly decodable network codes for real-time applications
复制标题
DOI：
10.1109/netcod.2013.6570827
复制
发表时间：
2013-03
期刊：
影响因子：
--
通讯作者：
Anh Le;A. Tehrani;A. Dimakis;A. Markopoulou
中科院分区：
文献类型：
--
作者：
Anh Le;A. Tehrani;A. Dimakis;A. Markopoulou
我们认为，通过即时解码网络编码的实时应用和丢失恢复广播的情况。过去的工作主要集中在最小化完成延迟，这对于有严格截止日期的实时应用程序来说不是正确的目标。在这项工作中，我们有兴趣找到一个代码，是立即解码的最大数量的用户。首先，我们证明了该问题在一般情况下是NP-Hard的。然后，我们考虑实际的概率情况下，用户有i.i.d.丢失概率，并且分组的数量与用户的数量成线性或多项式关系。在这种情况下，我们提供了一个多项式时间（在用户数量）算法，找到最佳的编码数据包。仿真结果表明，所提出的编码方案显着优于最佳重复码和类COPE贪婪方案。
We consider the scenario of broadcasting for realtime applications and loss recovery via instantly decodable network coding. Past work focused on minimizing the completion delay, which is not the right objective for real-time applications that have strict deadlines. In this work, we are interested in finding a code that is instantly decodable by the maximum number of users. First, we prove that this problem is NP-Hard in the general case. Then we consider the practical probabilistic scenario, where users have i.i.d. loss probability, and the number of packets is linear or polynomial in the number of users. In this case, we provide a polynomial-time (in the number of users) algorithm that finds the optimal coded packet. Simulation results show that the proposed coding scheme significantly outperforms an optimal repetition code and a COPE-like greedy scheme.