Adaptive chaotic frequency hopping

Abstract

Chaotic systems are widely used as robust and secure communication systems in jamming environments. Frequency hopping spread spectrum (FHSS) is an effective mechanism used to mitigate the effects of jamming, fading, and interference. To improve the performance of FHSS many adaptive frequency hopping schemes are used such as matched frequency hopping (MFH), clipped matched frequency hopping (CMFH), and advanced matched frequency hopping (AMFH). These schemes adaptively select the hopping pattern that includes only good sub-channels. Using these schemes result in forcing the system to be vulnerable to smart jammer attack. In this paper we propose a new algorithm that synthesizes one dimensional chaotic map which generates a random code that mostly selects good sub-channels to achieve good bit error rate (BER), good frequency diversity, and secure transmission provided by the high randomness properties of the chaotic systems.