Network coding is a promising technique to improve the throughput and robustness of wireless ad hoc networks. However, the packet-mixing nature of network coding also renders it more prone to pollution attacks. Most existing schemes to combat pollution attacks did not consider the defender's resource limit, nor the trade-off between defensive performance and other metrics such as delay and resource consumption. The authors investigate how to achieve such a trade-off optimally by proposing a two-player strategic game model between the attack and the defender. In this model, the utilities of both players are well defined, and thus the defender can obtain its best strategy by maximising its utility. To do so, a graph-based simulated annealing algorithm is proposed to derive the utility-maximising strategy. Finally, they conduct extensive experiments to evaluate their scheme from different aspects. The results show that their scheme can achieve better utility than existing schemes, and is more computationally efficient in the meanwhile. Moreover, their scheme can obtain a sub-optimal solution within a small number of iterations, which implies that it can be implemented in the short-session communication scenario where it is required to find a sufficiently good solution within a short time.

中文翻译：

---

在启用无线编码的网络中防御污染攻击 特别指定 网络：博弈论框架

网络编码是一种有前途的技术，可以提高无线自组织网络的吞吐量和健壮性。但是，网络编码的分组混合性质也使其更容易受到污染攻击。现有的大多数防止污染攻击的方案都没有考虑防御者的资源限制，也没有考虑防御性能与其他指标（例如延迟和资源消耗）之间的权衡。作者研究了如何通过在攻击者和防御者之间提出两人战略游戏模型来最佳地实现这种折衷。在此模型中，双方的效用得到了很好的定义，因此，防御者可以通过最大化其效用来获得最佳策略。为此，提出了一种基于图的模拟退火算法，以推导效用最大化策略。最后，他们进行了广泛的实验，从不同方面评估他们的计划。结果表明，与现有方案相比，该方案具有更好的实用性，同时在计算效率上也更高。此外，他们的方案可以在少量迭代中获得次优解决方案，这意味着可以在需要在短时间内找到足够好的解决方案的短会话通信方案中实现该方案。