An algorithm focus on multi-nodes jamming decision is proposed to fulfill the need of interdicting information transmission in wireless Ad-hoc networks. Firstly
a model of Poisson point process(PPP)network is constructed in terms of the structure of wireless Ad-hoc networks
and then it is used to simulate the process of data transmission. Secondly
random interference to multiple nodes are performed
and the number of stopped network flows is counted by monitoring ACK information or reconnoitering nodes activities. A correlation matrix is constructed from jamming effects. Finally
the correlation matrix is continuously updated in jamming process by taking the advantage of interaction in time of reinforcement learning and is used for the selection of subsequent nodes. The proposed algorithm does not need to have a priori knowledge of information such as network topology or importance of nodes
and interaction is only needed in learning nodes correlation matrix which would be helpful when choose nodes to jam. Simulation results by jamming wireless Ad-hoc in different circumstances and a comparison with the joint slotted exploit explore learning show that the proposed interdiction algorithm increases by 27.1% in accumulate stopped flows
and its robustness is superior to existing algorithms.
LIU Wei, ZHAO Yu, CHEN Rui. Zero-one integer programming based optimization model and two phase resource optimization algorithm for wireless Ad-hoc networks [J]. Computer Sciences, 2017, 44(1): 103-108.
MUKHERJEE A, KESHARY V, PANDYA K. Flying Ad-hoc networks: a comprehensive survey [C]∥3rd International Conference on Computer and Communication Technologies. Berlin, Germany: Springer, 2016: 1254-1270.
AMURU S, BUEHRER R M. Optimal jamming using delayed learning [C]∥Proceedings of 33rd Annual IEEE Military Communications Conference. Piscataway, NJ, USA: IEEE, 2014: 1528-1533.
MOON A H, IQBAL U, BASHIR A, et al. Simulating and analyzing RREQ flooding attack in wireless sensor networks [C]∥ International Conference on Electrical, Electronics, and Optimization Techniques. Piscataway, NJ, USA: IEEE, 2016: 3374-3377.
LIU Shujian, WU Sheng. Analysis and study of Dos attack feasibility based on Zmap [J]. Control and Instruments in Chemical Industry, 2016, 43(7): 725-727.
PROANO A, LAZOS L. Selective jamming attacks in wireless network [C]∥ 2010 IEEE International Conference on Communication. Piscataway, NJ, USA: IEEE, 2010: 11412483.
SEFAIR J A, SMITH J C. Dynamic shortest-path interdiction [J]. Networks, 2016, 68(4): 315-330.
ALTNER D S, ERGUN O, UHAN N A. The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability [J]. Operations Research Letters, 2010, 38(1): 33-38.
DUAN Yong, CUI Baoxia, XU Xinhe. Multi-agent reinforcement learning and its application to role assignment of robot soccer [J]. Control Theory Application, 2009, 26(4): 371-376.
ZHAO Dongbin, SHAO Kun, ZHU Yuanheng, et al. Review of deep reinforcement learning and discussion on the development of computer Go [J]. Control Theory Applications, 2016, 33(6): 701-717.
AMURU S, MICHAEL B R, VAN DER SCHAAR M. Blind network interdiction strategies: a learning approach [J]. IEEE Transactions on Cognitive Communications and Networking, 2015, 1(4): 435-449.
GAI Y, KRISHNAMACHARI B, JAIN R. Combinatorial network optimization with unknown variables: multi-armed bandits with linear reward [J]. Networking IEEE/ACM Transaction on Networking, 2012, 20(5): 1466-1478.