Academia.eduAcademia.edu

Figure from:Optimal Jamming Attacks and Network Defense Policies in Wireless Sensor Networks

See full PDFdownloadDownload figure
eo 1. Numerical results for Case 2 of Problem 1 (lack of knowledge by attacker and network about the strategy of each other. Note that g* = —1 (or —1) in the plots indicate the non-existence of a feasible solution.

Figure 1 eo 1. Numerical results for Case 2 of Problem 1 (lack of knowledge by attacker and network about the strategy of each other. Note that g* = —1 (or —1) in the plots indicate the non-existence of a feasible solution.

Related Figures (1)

Fig. 2. The optimal number of neighbors n to minimize the detection time vs. + for three different q’s.
Fig. 2. The optimal number of neighbors n to minimize the detection time vs. + for three different q’s.