{'fraction_non_alphanumeric': 0.027488151658767772, 'fraction_numerical': 0.0, 'mean_word_length': 5.857142857142857, '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}}
Rendezvous for self-organizing MANET with multiple radio

Self-Organizing Mobile Ad-hoc Network(MANET) equipped with multiple interfaces and multiple channels(MIMC) is an emergent issue in cognitive radio networks(CRNs). Recently the rendezvous algorithm using the multiple radios for fast rendezvous such as role-based parallel sequence(RPS) algorithm have been studied in distributed network. While the RPS algorithm using one dedicated radio and multiple general radios provides an enhanced rendezvous performance and a guaranteed time-to-rendezvous(TTR), it doesn't consider that how many dedicated radios optimize the rendezvous performance. In this paper, we proposed an optimized waiting and hopping(OWH) algorithm for multiple radio devices to provide guaranteed the lower maximum TTR. We derive an upper-bound maximum TTR for the multiple radios network, and analyze the optimized number of waiting radio theoretically. Extensive simulations are conducted to evaluate the performance our algorithm in symmetric and asymmetric channel environment.