Byzantine attack is a severe security concern in network coding enabled wireless ad hoc networks, because the malicious nodes can easily inject bogus packets into the information flow and cause an epidemic propagation of pollution. In this paper, we address the Byzantine attack by proposing a malicious node identification scheme, which can achieve a high identification accuracy on malicious nodes and protect the benign nodes from being mis-identified as attackers. We consider two practical challenges, namely, 1) only a fraction of the intermediate nodes can be deployed as defenders; and 2) the malicious nodes are intelligent–they pretend to be legitimate nodes probabilistically to reduce the chances of being identified. Theoretical analysis and extensive simulations show that our scheme performs well even under the conditions mentioned above. Furthermore, we conduct a series of comparisons between our scheme and several existing schemes, which show that our scheme outperforms them in both identification accuracy and valid throughput during the identification procedure. Finally, we present a two-player game theory framework to find the optimal strategy for the defender, and also provide a case study of the defender’s strategy optimization.

中文翻译：

---

网络编码无线自组织网络中基于博弈论的最优拜占庭攻击者识别


拜占庭攻击是启用网络编码的无线自组织网络中的一个严重的安全问题，因为恶意节点可以轻松地将伪造的数据包注入信息流中并导致污染的流行传播。在本文中，我们通过提出一种恶意节点识别方案来解决拜占庭攻击，该方案可以实现对恶意节点的较高识别准确率，并保护良性节点不被误识别为攻击者。我们考虑两个实际挑战，即1）只有一小部分中间节点可以部署为防御者； 2）恶意节点是智能的——它们在概率上伪装成合法节点，以减少被识别的机会。理论分析和广泛的模拟表明，即使在上述条件下，我们的方案也表现良好。此外，我们对我们的方案与几种现有方案进行了一系列比较，结果表明我们的方案在识别过程中的识别精度和有效吞吐量方面均优于它们。最后，我们提出了一个两人博弈论框架来寻找防守方的最优策略，并提供了防守方策略优化的案例研究。