Date Added: Jul 2010
The authors analyze the effects of dynamic packet traffic on jamming attacks in wireless networks. For random access over collision channels, the jamming problem is formulated as a non-cooperative game in which nodes choose their transmission probabilities under energy and delay constraints. They relax the standard assumption of backlogged nodes and evaluate the Nash equilibrium strategies for random arrivals, which introduces the possibility that jamming attacks fail due to empty packet queues at the transmitters. The maximum feasible throughput is derived depending on whether jammers have the queue state knowledge, or not.