Performance Analysis of Jammed Single-Hop Wireless Networks

We develop a theoretical approach to derive system throughput for single-hop wireless networks with N independent channels, n users and m jammers where users and jammers follow the given policies to randomly select channels at each time slot. The whole system, named as NRL model, can be modeled as a Markov chain, and the system state at each time slot is defined as the number of successful jammers. The key point is to derive the transition probability matrix and obtain the stationary distribution. Then, the theoretical system throughput can be computed straightforwardly. Numerical experiments are used to validate theoretical results, and the throughput differences between numerical and theoretical results are within 0.3%. Also, we derive the theoretical throughput for a Dumb model where users and jammers randomly select channels at each time slot. Compared with Dumb model, NRL model achieves better performance for big n and worse performance for small n.