{'fraction_non_alphanumeric': 0.01406926406926407, 'fraction_numerical': 0.0, 'mean_word_length': 5.292517006802721, '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}}
A reduced search space routing algorithm for large-scale cognitive radio wireless

The problem of finding the shortest route between a source and a destination in a large-scale network is investigated. A simple and efficient technique to reduce the network search space size based on nodes position information is developed. Following the proposed technique, it is shown that the route found within the reduced search space has the same number of hops as that obtained when solving the problem considering the large-scale network as the number of nodes increases. Furthermore, the proposed technique provides a significant complexity reduction. The proposed algorithm is also applied to cognitive radio networks to analyze route throughput. Compared to the average link throughput obtained via solving the large-scale network, a negligible throughput degradation is noticed and a remarkable complexity reduction is obtained.