A Study of Discrete Link Jamming Games
Wei-Chung Peng, Robert A. Scholtz · 1986
Link jamming games with continuous levels were studied in [1]. Practically it may not be feasible to implement an optimal power-or rate-randomizing strategy with continuous levels. Games, i.e., design programs, with discrete levels are investigated here. The threshold model and throughput pay-off are the same as in [1]. Average power constraints for both the communicator and the jammer are assumed. Questions like, "If the communicator (jammer) has only two power levels for randomization, which two levels are optimal?" and "What is the maximum signal-to-jamming ratio cost for quantizing the levels?" will be answered.