{'fraction_non_alphanumeric': 0.01653944020356234, 'fraction_numerical': 0.0, 'mean_word_length': 5.346774193548387, '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}}
Time optimization in spectrum sensing: Interesting cases

Traditionally spectrum sensing approaches do not take the historical traffic data into account. In such approaches, equal amount of time is allocated for spectrum sensing of the sub-bands in the band of interest. In this research paper, we formulate the problem of time optimal spectrum sensing taking the historical data into account. We solve the problem in practically interesting special cases. Effectively interesting integer programming problems are solved. In that effort it is shown that the variance of discrete random variable constitutes a quadratic form associated with a laplacian like matrix. Using this result, time optimal spectrum sensing is formulated as a multi-linear objective function optimization problem.