Jamming statistics-dependent frequency hopping

Abstract

This paper studies a jamming statistics-dependent frequency-hopping (FH) pattern generation scheme. Most existing FH patterns are determined by two encryption keys: (a) one for FH in the frequency domain, and (b) the other for time permutation in the time domain. These keys are independent of channel conditions. Hence, an FH signal generated by these two keys occupies the entire spectrum in both frequency and time domains, and the probability of detection by a jammer is low. However, the probability of a hit (or jamming) on the desired user's frequency channels by partial-band noise jamming (PBNJ) can be high because it is inversely proportional to the total number of available frequency positions. Can an FH system with jamming-dependent adaptive FH patterns safeguard the communications systems more effectively? If the answer is yes, then how can an efficient jamming-dependent adaptive FH pattern be found, and can it be implemented cost-effectively for future communications systems against jamming? The aim of this paper is to study answers to the questions posed here.