{'fraction_non_alphanumeric': 0.0136986301369863, 'fraction_numerical': 0.0, 'mean_word_length': 5.643939393939394, '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}}
Channel-Grouping based rendezvous algorithm for cognitive radio adhoc networks

Cognitive Radio is utilized to exploit the existing wireless spectrum opportunistically, in which way to alleviate the spectrum shortage problem. It is of fundamental importance in cognitive radio adhoc networks for users to meet on a common channel via rendezvous and thereby establish communication links. In this paper, we investigate the probability analytic model to discuss the problem of rendezvous. Furthermore, a resulting Channel-Grouping based algorithm is proposed for decentralized rendezvous. The basic idea of the algorithm is to divide all channels into small sets, reducing the number of selectable channels in each round and thus improving the probability of successful rendezvous. Extensive simulations show that our proposed algorithm outperforms the other rendezvous schemes.