Reputation-based defense scheme against pollution attacks on network coding

被引:0
|
作者
Wang T. [1 ]
Cai Y. [1 ,2 ]
Zhang Y. [1 ]
机构
[1] Beijing Key Laboratory of Internet Culture and Digital Dissemination Research, Beijing Information Science and Technology University, Beijing
[2] State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing
基金
中国国家自然科学基金;
关键词
Network coding; Pollution attack; Reputation mechanism; Security; Wireless networks;
D O I
10.7544/issn1000-1239.2016.20150502
中图分类号
学科分类号
摘要
Network coding is to apply innovative error-correction coding techniques in the network layer to improve network performance in both wired and wireless networks. It has been theoretically shown and experimentally demonstrated that if it is properly applied, it can significantly improve end-to-end network throughput, and hence has attracted tremendous attention in the last fifteen years. Unfortunately, this technique also has some serious drawbacks. One of the major problems is its vulnerability to pollution attacks, where malicious nodes can inject corrupted packets to mess up with the decoding process. To deal with this serious problem, many schemes have been proposed in the literature, but most of them are centralized in the sense that a trusted central authority may be required. In this paper, we propose a novel distributed defense scheme based on some reputation mechanism by taking advantage of node mobility. The fundamental idea is to apply an effective reputation mechanism to locate potential malicious nodes whenever suspected polluted packets are detected. We have conducted extensive comparison studies of our proposed scheme and the existing ones, and demonstrated that the proposed scheme can achieve high successful packet delivery ratio by effectively locating and isolating the malicious nodes, even when there exist multiple malicious nodes in the network. © 2016, Science Press. All right reserved.
引用
收藏
页码:2491 / 2499
页数:8
相关论文
共 31 条
  • [1] Ahlswed R., Cai N., Li S.Y.R., Et al., Network information flow, IEEE Trans on Information Theory, 46, 4, pp. 1204-1216, (2000)
  • [2] Chachulski S., Jennings M., Katti S., Et al., Trading structure for randomness in wireless opportunistic routing, Proc of the 2007 Conf on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 169-180, (2007)
  • [3] Zhang X., Li B., Optimized multipath network coding in lossy wireless networks, IEEE Journal on Selected Areas in Communications, 27, 5, pp. 622-634, (2009)
  • [4] Zhang X., Li B., Dice: A game theoretic framework for wireless multipath network coding, Proc of the 9th ACM Int Symp on Mobile Ad Hoc Networking and Computing, pp. 293-302, (2008)
  • [5] Katti S., Katabi D., Balakrishnan H., Et al., Symbol-level network coding for wireless mesh networks, Computer Communication Review, 38, 4, pp. 401-412, (2009)
  • [6] Park J.S., Gerla M., Lun D.S., Et al., CodeCast: A network-coding-based ad hoc multicast protocol, IEEE Wireless Communications, 13, 5, pp. 76-81, (2006)
  • [7] Katti S., Katabi D., Et al., The importance of being opportunistic: Practical network coding for wireless environments, Proc of the 43rd Annual Allerton Conf on Communication, Control, and Computing, pp. 1-10, (2005)
  • [8] Katti S., Rahul H., Hu W., Et al., Xors in the air: Practical wireless network coding, Computer Communication Review, 36, 4, pp. 243-254, (2006)
  • [9] Le J., Lui J., Chiu D.M., DCAR: Distributed coding-aware routing in wireless networks, IEEE Trans on Mobile Computing, 9, 4, pp. 596-608, (2010)
  • [10] Das S., Wu Y., Chandra R., Et al., Context-based routing: Technique applications and experience, Proc of the 5th USENIX Symp on Networked Systems Design and Implementation, pp. 379-392, (2008)