IP Address Mutation Scheme Using Vector Projection for Tactical Wireless Networks

  • Jong-Kwan LeeEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11402)


The static address configuration of networks and hosts allows attackers to have enough time to discover target networks and systems. On the other hands, the defenders always lack of time to respond because they can take action after attacker’s explicit behaviors. To eliminate the attacker’s asymmetric advantage of time, randomization of addresses have been suggested as Moving Target Defense (MTD) which is a promising technique to make the attacker’s reconnaissance activities difficult by dynamically changing network properties. In this paper, I propose the address mutation scheme using vector projection for tactical wireless networks that are a leader node centric hierarchical structure. In the proposed scheme, the addresses in the same networks are mutated with a simple vector operation by fully distributed manner and the mutated addresses are shared to all the members in the internal networks. Unlike the conventional schemes, all addresses associated with network entities for data delivery are mutated. I evaluate the performance of the proposed scheme by numerical analysis and experimental simulations. The results show that the proposed scheme could effectively randomize the addresses in tactical wireless networks.


Moving Target Defense Address mutation Tactical wireless networks 


  1. 1.
    Beraud, P., Cruz, A., Hassell, S., Meadows, S.: Using cyber maneuver to improve network resiliency. In: 2011 - MILCOM 2011 Military Communications Conference, Baltimore, MD, pp. 1121–1126 (2011)Google Scholar
  2. 2.
    Carroll, T.E., Crouse, M., Fulp, E.W., Berenhaut, K.S.: Analysis of network address shuffling as a moving target defense. In: 2014 IEEE International Conference on Communications (ICC), Sydney, NSW, pp. 701–706 (2014)Google Scholar
  3. 3.
    Wang, S., Zhang, L., Tang, C.: A new dynamic address solution for moving target defense. In: 2016 IEEE Information Technology, Networking, Electronic and Automation Control Conference, Chongqing, pp. 1149–1152 (2016)Google Scholar
  4. 4.
    Tang, H., Sun, Q.T., Yang, X., Long, K.: A network coding and DES based dynamic encryption scheme for moving target defense. IEEE Access 6, 26059–26068 (2018)CrossRefGoogle Scholar
  5. 5.
    Cai, G.-L., Wang, B.-S., Hu, W., Wang, T.-Z.: Moving target defense: state of the art and characteristics. Front. Inf. Technol. Electron. Eng. 17(3), 1122–1153 (2016)CrossRefGoogle Scholar
  6. 6.
    Sun, J., Sun, K.: DESIR: Decoy-enhanced seamless IP randomization. In: IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, San Francisco, CA, pp. 1–9 (2016)Google Scholar
  7. 7.
    Luo, Y.B., Wang, B.S., Wang, X.F., Hu, X.F., Cai, G.L., Sun, H.: RPAH: random port and address hopping for thwarting internal and external adversaries. In: 2015 IEEE Trustcom/BigDataSE/ISPA, Helsinki, pp. 263–270 (2015)Google Scholar
  8. 8.
    Wu, J.: Meaning and vision of mimic computing and mimic security defense. Telecommun. Sci. 30(7), 17 (2014)Google Scholar
  9. 9.
    Jafarian, J.H., Al-Shaer, E., Duan, Q.: An effective address mutation approach for disrupting reconnaissance attacks. IEEE Trans. Inf. Forensics Secur. 10(12), 2562–2577 (2015)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Cyber Warfare Research CenterKorea Military AcademySeoulKorea

Personalised recommendations