access icon free Defending pollution attacks in network coding enabled wireless ad hoc networks: a game-theoretic framework

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.

Inspec keywords: simulated annealing; telecommunication security; ad hoc networks; game theory; network coding

Other keywords: pollution attacks; short-session communication scenario; utility-maximising strategy; two-player strategic game model; simulated annealing algorithm; packet-mixing nature; defensive performance; wireless ad hoc networks; resource consumption; network coding

Subjects: Optimisation techniques; Codes; Radio links and equipment; Game theory

References

    1. 1)
      • 7. Ning, Z., Song, Q., Guo, L., et al: ‘Integration of scheduling and network coding in multi-rate wireless mesh networks: optimization models and algorithms’, Ad Hoc Netw., 2016, 36, pp. 386397.
    2. 2)
      • 17. Do, C.T., Tran, N.H., Hong, C., et al: ‘Game theory for cyber security and privacy’, ACM Comput. Surv., 2017, 50, (2), p. 30.
    3. 3)
      • 4. Katti, S., Rahul, H., Hu, W., et al: ‘XORs in the air: practical wireless network coding’, IEEE/ACM Trans. Netw., 2008, 16, (3), pp. 497510.
    4. 4)
      • 46. Kaliappan, M., Paramasivan, B.: ‘Enhancing secure routing in mobile ad hoc networks using a dynamic Bayesian signalling game model’, Comput. Electr. Eng., 2015, 41, pp. 301313.
    5. 5)
      • 47. Biswas, S., Morris, R.: ‘ExOR: opportunistic multi-hop routing for wireless networks’. ACM SIGCOMM Computer Communication Review, Philadelphia, PA, USA2005, vol. 35, pp. 133144.
    6. 6)
      • 49. Ho, T., Médard, M., Koetter, R., et al: ‘A random linear network coding approach to multicast’, IEEE Trans. Inf. Theory, 2006, 52, (10), pp. 44134430.
    7. 7)
      • 40. Kiennert, C., Ismail, Z., Debar, H., et al: ‘A survey on game-theoretic approaches for intrusion detection and response optimization’, ACM Comput. Surv., 2019, 51, (5), p. 90.
    8. 8)
      • 16. Esfahani, A., Mantas, G., Rodriguez, J., et al: ‘An efficient homomorphic MAC-based scheme against data and tag pollution attacks in network coding-enabled wireless networks’, Int. J. Inf. Secur., 2017, 16, (6), pp. 627639.
    9. 9)
      • 2. Su, H., Zhang, X.: ‘Modeling throughput gain of network coding in multi-channel multi-radio wireless ad hoc networks’, IEEE J. Sel. Areas Commun., 2009, 27, (5), pp. 593605.
    10. 10)
      • 10. Liu, X., Huang, J., Wu, Y., et al: ‘A privacy-preserving signature scheme for network coding’, IEEE Access, 2019, 7, pp. 109739109750.
    11. 11)
      • 22. Cheng, X., Wang, Q., Wang, Q., et al: ‘A high-reliability relay algorithm based on network coding in multi-hop wireless networks’, Wirel. Netw., 2019, 25, (4), pp. 15571566.
    12. 12)
      • 43. Doshi, C.K., Sankaranarayanan, S., Lakshman, V.B., et al: ‘Game theoretic modeling of gray hole attacks in wireless ad hoc networks’. Proc. Int. Conf. on Signal Networks Computing and Systems, New Delhi, India, 2017, pp. 217226.
    13. 13)
      • 35. Ramasamy, R., Vivek, S.S., George, P., et al: ‘Dynamic verifiable encrypted keyword search using bitmap index and homomorphic MAC’. 2017 IEEE 4th Int. Conf. on Cyber Security and Cloud Computing (CSCloud), New York, NY, USA, 2017, pp. 357362.
    14. 14)
      • 34. Cheng, C., Lee, J., Jiang, T., et al: ‘Security analysis and improvements on two homomorphic authentication schemes for network coding’, IEEE Trans. Inf. Forensics Sec., 2016, 11, (5), pp. 9931002.
    15. 15)
      • 42. Fallah, M.: ‘A puzzle-based defense strategy against flooding attacks using game theory’, IEEE Trans. Dependable Secur. Comput., 2008, 7, (1), pp. 519.
    16. 16)
      • 21. Shin, H., Park, J.S.: ‘Optimizing random network coding for multimedia content distribution over smartphones’, Multimedia Tools Appl., 2017, 76, (19), pp. 1937919395.
    17. 17)
      • 6. Xie, L.F., Chong, P.H., Ho, I.W., et al: ‘A survey of inter-flow network coding in wireless mesh networks with unicast traffic’, Comput. Netw., 2015, 91, pp. 738751.
    18. 18)
      • 23. Chen, J., He, K., Du, R., et al: ‘Dominating set and network coding-based routing in wireless mesh networks’, IEEE Trans. Parallel Distrib. Syst., 2013, 26, (2), pp. 423433.
    19. 19)
      • 13. Agrawal, S., Boneh, D.: ‘Homomorphic MACs: MAC-based integrity for network coding’. Int. Conf. on Applied Cryptography and Network Security, Berlin, Heidelberg, 2009, pp. 292305.
    20. 20)
      • 12. Li, T., Chen, W., Tang, Y., et al: ‘A homomorphic network coding signature scheme for multiple sources and its application in IoT’, Secur. Commun. Netw., 2018, 2018, article ID 9641273.
    21. 21)
      • 30. Yun, A., Cheon, J.H., Kim, Y.: ‘On homomorphic signatures for network coding’, IEEE Trans. Comput., 2010, 59, (9), pp. 12951296.
    22. 22)
      • 26. Yoshida, M., Gallegos, A., Noguchi, T.: ‘Adaptive forwarding control using network coding for efficient multicasting in mobile ad-hoc networks’. Proc. 8th ACM Symp. on Design and Analysis of Intelligent Vehicular Networks and Applications, Montreal QC, Canada, 2018, pp. 2733.
    23. 23)
      • 9. Liu, X., Huang, J., Zong, G.: ‘Public auditing for network coding based secure cloud storage’. 2018 17th IEEE Int. Conf. on Trust, Security and Privacy in Computing and Communications/12th IEEE Int. Conf. on Big Data Science and Engineering (TrustCom/BigDataSE), New York, NY, USA, 2018, pp. 713720.
    24. 24)
      • 44. Kwon, Y., Wang, X., Hwang, T.: ‘A game with randomly distributed eavesdroppers in wireless ad hoc networks: a secrecy EE perspective’, IEEE Trans. Veh. Technol., 2017, 66, (11), pp. 99169930.
    25. 25)
      • 1. Ahlswede, R., Cai, N., Li, S.Y., et al: ‘Network information flow’, IEEE Trans. Inf. Theory, 2000, 46, (4), pp. 12041216.
    26. 26)
      • 28. Adeli, M., Liu, H.: ‘Secure network coding with minimum overhead based on hash functions’, IEEE Commun. Lett., 2009, 13, (12), pp. 956958.
    27. 27)
      • 27. Krohn, M.N., Freedman, M.J., Mazieres, D.: ‘On-the-fly verification of rateless erasure codes for efficient content distribution’. Proc. 2004 IEEE Symp. on Security and Privacy, Berkeley, CA, USA, 2004, pp. 226240.
    28. 28)
      • 45. Mehdi, M.M., Raza, I., Hussain, S.A.: ‘A game theory based trust model for vehicular ad hoc networks (VANETs)’, Comput. Netw., 2017, 121, pp. 152172.
    29. 29)
      • 3. Jiang, D., Xu, Z., Li, W., et al: ‘Network coding-based energy-efficient multicast routing algorithm for multi-hop wireless networks’, J. Syst. Softw., 2015, 104, pp. 152165.
    30. 30)
      • 36. Boneh, D., Freeman, D., Katz, J., et al: ‘Signing a linear subspace: signature schemes for network coding’. Int. Workshop on Public Key Cryptography, Irvine, CA, USA, 2009, pp. 6887.
    31. 31)
      • 50. Osborne, M.J., Rubinstein, A.: ‘A course in game theory’ (MIT Press, Cambridge, MA, USA, 1994).
    32. 32)
      • 32. Cheng, C., Jiang, T., Zhang, Q.: ‘Tesla-based homomorphic MAC for authentication in P2P system for live streaming with network coding’, IEEE J. Sel. Areas Commun., 2013, 31, (9), pp. 291298.
    33. 33)
      • 11. Shang, T., Peng, T., Lei, Q., et al: ‘Homomorphic signature for generation-based network coding’. 2016 IEEE Int. Conf. on Smart Cloud (SmartCloud), New York, NY, USA, 2016, pp. 269273.
    34. 34)
      • 24. Tang, X., Zhou, J., Xiong, S., et al: ‘Geographic segmented opportunistic routing in cognitive radio ad hoc networks using network coding’, IEEE Access, 2018, 6, pp. 6276662783.
    35. 35)
      • 19. Tong, W., Zhong, S.: ‘A unified resource allocation framework for defending against pollution attacks in wireless network coding systems’, IEEE Trans. Inf. Forensics Sec., 2016, 11, (10), pp. 22552267.
    36. 36)
      • 52. Casola, V., Fasolino, A.R., Mazzocca, N., et al: ‘An AHP-based framework for quality and security evaluation’. 2009 Int. Conf. on Computational Science and Engineering, 2009, vol. 3, pp. 405411.
    37. 37)
      • 51. Li, S.Y., Yeung, R.W., Cai, N.: ‘Linear network coding’, IEEE Trans. Inf. Theory, 2003, 49, (2), pp. 371381.
    38. 38)
      • 41. Agah, A., Das, S.K.: ‘Preventing DoS attacks in wireless sensor networks: a repeated game theory approach.’, Int. J. Netw. Secur., 2007, 5, (2), pp. 145153.
    39. 39)
      • 39. Xiao, X., Li, M., Wang, J., et al: ‘Optimal resource allocation to defend against deliberate attacks in networking infrastructures’. 2012 Proc. IEEE INFOCOM, Orlando, FL, USA, 2012, pp. 639647.
    40. 40)
      • 15. Esfahani, A., Mantas, G., Rodriguez, J.: ‘An efficient null space-based homomorphic MAC scheme against tag pollution attacks in RLNC’, IEEE Commun. Lett., 2016, 20, (5), pp. 918921.
    41. 41)
      • 33. Chang, J., Shao, B., Zhang, A., et al: ‘Security analysis of an efficient null space-based homomorphic MAC scheme against tag pollution attacks in RLNC’, IEEE Access, 2019, 7, pp. 8839388398.
    42. 42)
      • 48. Chachulski, S., Jennings, M., Katti, S., et al: ‘Trading structure for randomness in wireless opportunistic routing’, vol. 37 (ACM, New York, USA, 2007).
    43. 43)
      • 25. Chen, B., Gao, Z., Yang, M., et al: ‘Packet multicast in cognitive radio ad hoc networks: a method based on random network coding’, IEEE Access, 2018, 6, pp. 87688781.
    44. 44)
      • 38. Yan, G., Lee, R., Kent, A., et al: ‘Towards a Bayesian network game framework for evaluating DDoS attacks and defense’. Proc. 2012 ACM Conf. on Computer and Communications Security, Raleigh, NC, USA, 2012, pp. 553566.
    45. 45)
      • 37. Michiardi, P., Molva, R.: ‘Game theoretic analysis of security in mobile ad hoc networks’, 2002.
    46. 46)
      • 8. Dong, J., Nita-Rotaru, R., Curtmola, C.: ‘Practical defenses against pollution attacks in wireless network coding’, ACM Trans. Inf. Syst. Secur., 2011, 14, (1), p. 7.
    47. 47)
      • 18. Abdalzaher, M.S., Seddik, K., Elsabrouty, M., et al: ‘Game theory meets wireless sensor networks security requirements and threats mitigation: a survey’, Sensors, 2016, 16, (7), p. 1003.
    48. 48)
      • 5. Jamil, F., Javaid, A., Umer, T., et al: ‘A comprehensive survey of network coding in vehicular ad-hoc networks’, Wirel. Netw., 2017, 23, (8), pp. 23952414.
    49. 49)
      • 29. Le, A., Markopoulou, A.: ‘On detecting pollution attacks in inter-session network coding’. 2012 Proc. IEEE INFOCOM, Orlando, FL, USA, 2012, pp. 343351.
    50. 50)
      • 31. Gkantsidis, C., Rodriguez, P.: ‘Cooperative security for network coding file distribution’. INFOCOM, 2006, vol. 3, p. 5.
    51. 51)
      • 20. Li, P., Guo, S., Yu, S., et al: ‘Reliable multicast with pipelined network coding using opportunistic feeding and routing’, IEEE Trans. Parallel Distrib. Syst., 2014, 25, (12), pp. 32643273.
    52. 52)
      • 14. Cheng, C., Jiang, T.: ‘An efficient homomorphic MAC with small key size for authentication in network coding’, IEEE Trans. Comput., 2012, 62, (10), pp. 20962100.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2019.1372
Loading

Related content

content/journals/10.1049/iet-com.2019.1372
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading