{'fraction_non_alphanumeric': 0.020437956204379562, 'fraction_numerical': 0.0, 'mean_word_length': 5.889447236180905, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An Analysis of Frequency Rendezvous for Decentralized Dynamic Spectrum Access

In this paper, we propose an analysis of frequency rendezvous techniques employing three different scanning rules by combining analytical results with computer simulations. Frequency rendezvous is a critical step in bootstrapping a wireless network that does not possess centralized control. Current techniques for enabling frequency rendezvous in decentralized dynamic spectrum access (DSA) networks either require preexisting infrastructure or use one of several simplifying assumptions regarding the architecture, such as the use of regularly spaced frequency channels for communications. Our approach is designed to be operated in a purely decentralized wireless networking environment, where no centralized control is present, and the spectrum possesses no predefined channels. This is accomplished via a combination of receiver pilot tones, a tone-scanning protocol, and a transmitter/receiver handshaking process. To realize a shortest search time for the target receiver, an efficient scanning rule should be employed. In this paper, three scanning rules, i.e., frequency sequence scanning, pilot tone strength scanning, and cluster scanning, are analyzed using mathematical derivations. To validate our theoretical result, we test the three scanning rules with computer simulations.