Dynamic Spectrum Allocation Based On Interference Temperature

Cognitive radio, as one of a brand new wireless communication technology, aims to settle down the relatively scariness of spectrum resource caused by the fix spectrum allocation policy nowadays. With the idea of spectrum hole detection, dynamic spectrum allocation and adaptive learning algorithm in mind, cognitive user may markedly improve the spectrum utilization by reusing the spectrum in different dimensions from temporal, spatial and spectrum field. Such a device could theoretically operate in a licensed band without causing harmful interference to the primary licensee. This paper introduces the dynamic spectrum allocation of CR and explains the transmit power controlling, dynamic channel allocation and distribute coordinate channel establishment it may concern.At the beginning, this paper first analyses the dynamic characteristics of a CR system and how these characteristics impact the dynamic spectrum allocation. After introducing the concept of interference temperature created by FCC for quantifying and managing interference, the idea of interference temperature multiple access is proposed. ITMA uses interference temperature and CDMA to unify the concepts of dynamic spectrum allocation.Following which, based on FCC's fix receiver interference model, two of the multi-user transmit power control algorithms, average power control and"shadow price"power control, are studied. The ideas behind APC and SPC are equilibrations of interference temperature at fix receiver and cognitive receivers respectively. Simulations have proved that, with higher compute complication, however, the"shadow price"algorithm may achieve lower energy consumption.Step forward, the situation of sharing multi-channel among multi-user is considered. To come over the problem, the"Game Theory"is adapted. Two different objective functions for the channel allocation games, which capture the utility of selfish users and cooperative users, are defined. As show in this paper that, the cooperate game can be formulated as a potential game, and thus converges to a pure strategy Nash equilibrium. Alternatively, a no-regret learning implementation is proposed for the selfish game, and mixed strategy equilibrium is obtained. By the end of this paper, the coordinate channel, which is the foundation of cooperation, is taken into account. After looking inside the spectrum heterogeneity, the assumption of distributed coordination channel is brought forward, and three of its relative theories, neighbor discover, coordination procedure and bridge nodes formulation, are described in detail.