Resisting Malicious Attacks via Secure Network Coding and Incentive Compatible Mechanism in Multihop Wireless Networks

Abstract

<span style="font-size: 9pt; font-family: "Times New Roman"; mso-fareast-font-family: 宋体; mso-font-kerning: 1.0pt; mso-ansi-language: EN-US; mso-fareast-language: ZH-CN; mso-bidi-language: AR-SA;" lang="EN-US">Network coding substantially improves the throughput of a network and possesses security superiority, but the security and performance of a network coding based wireless network are highly susceptible to malicious attacks such as pollution attack, dropping attack, lack of cooperation and selfish nodes collusion. This paper designs a secure network coding scheme that works in an adversarial environment, which can resist pollution attack, decrease the compromising probability of the message, and achieve tradeoff between security and performance by integrating the multipath and optimizing the coding packets allocation. Meanwhile, it also improves the fault tolerance of link failure or dropping attack by adding the finite redundancy coding packets. In addition, considering the selfish nodes of noncooperation communication, we design an incentive compatible protocol to stimulate forwarding packets and prove that only following the protocol honestly can obtain maximum utility. Furthermore, it is also proved that there is no collusion that can profit all colluding players. Finally, the simulation evaluation and security analysis confirm our theoretical results. </span&gt

An Enforceable Incentive Scheme in Wireless Multi-path Inter-session Network Coding Game

“…It is complementary to the existing work on incentive compatible routing in the same type of wireless networks. S.G. Chen [11] etc design an incentive compatible protocol to stimulate forwarding packets and prove that only following the protocol honestly can obtain maximum utility. An incentive scheme is proposed which is used in multi-path inter-session network coding game in this paper.…”