{'fraction_non_alphanumeric': 0.015437392795883362, 'fraction_numerical': 0.0, 'mean_word_length': 5.274193548387097, '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}}
Range-bound pricing of channels in multichannel multiuser cognitive radio networks

Appropriate pricing of channel bandwidths that are allotted to secondary users is an important and challenging task in cognitive radio networks. It is usually carried out through the auctions held by the spectrum licensees themselves or by the designated third parties that collect the vacant channel information from the licensed users. In most of the standard auction methods, range of bidding prices can be very wide, with no restriction on maximum and minimum bidding values. This situation can create instability in channel pricing that can lead to underutilization of vacant bandwidths. An auction scheme, in which predefined maximum and minimum bid values can be used, is proposed in this work. It also proposes to offer reduction in allocation prices, based on the prevailing demand and supply of vacant channels, at various times. Simulation results indicate that the proposed scheme offers better performance in comparison with other existing auction methods, in supporting the Quality of Service (QoS) of cognitive radio users, and in stabilizing the pricing of channels.