JCP 2010 Vol.5(11): 1706-1714 ISSN: 1796-203X
doi: 10.4304/jcp.5.11.1706-1714
doi: 10.4304/jcp.5.11.1706-1714
Resisting Malicious Attacks via Secure Network Coding and Incentive Compatible Mechanism in Multihop Wireless Networks
Siguang Chen1, Meng Wu2 and Weifeng Lu2
1 College of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing, China
2 College of Telecommunications & Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing, China
Abstract—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.
Index Terms—Network coding, malicious attacks, multipath routing, game theory, collusion
2 College of Telecommunications & Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing, China
Abstract—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.
Index Terms—Network coding, malicious attacks, multipath routing, game theory, collusion
Cite: Siguang Chen, Meng Wu and Weifeng Lu, " Resisting Malicious Attacks via Secure Network Coding and Incentive Compatible Mechanism in Multihop Wireless Networks," Journal of Computers vol. 5, no. 11, pp. 1706-1714, 2010.
PREVIOUS PAPER
GPU Accelerated Simulation of Cardiac Activities
General Information
ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO, ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
-
Nov 14, 2019 News!
Vol 14, No 11 has been published with online version [Click]
-
Mar 20, 2020 News!
Vol 15, No 2 has been published with online version [Click]
-
Dec 16, 2019 News!
Vol 14, No 12 has been published with online version [Click]
-
Sep 16, 2019 News!
Vol 14, No 9 has been published with online version [Click]
-
Aug 16, 2019 News!
Vol 14, No 8 has been published with online version [Click]
- Read more>>