Abstract-We address the challenge of energy efficiency in hierarchical spectrum sharing networks with dynamic traffic. We consider a primary and a cognitive secondary transmitter-receiver pair, where the secondary transmitter can utilize cooperative transmission to relay primary traffic while superimposing its own information. The secondary user meets a dilemma in this scenario. By choosing cooperation, it can transmit a packet immediately, but it has to bear the additional cost of relaying. Otherwise, it can wait for the primary user to become idle, which increases the queuing delay that secondary packets experience. To solve this dilemma and trade off delay and energy consumption, we propose dynamic cooperative secondary access control that takes the state of the spectrum sharing network into account. We formulate the problem as a Markov decision process and prove the existence of a stationary policy that is average cost optimal. We evaluate reinforcement learning to find optimal transmission strategy when the traffic and link statistics are not known. We demonstrate that dynamic cooperation is necessary for the secondary system to be able to adapt to changing network conditions and show that optimal sequential decision can significantly improve the tradeoff of the energy consumption and the delay. Index Terms-Hierarchical spectrum sharing, cooperative transmission, queuing systems, Markov decision process, reinforcement learning.
The paper REF studies the tradeoff between packet delay and energy consumption in a cooperative cognitive network.
Dynamic Cooperative Secondary Access in Hierarchical Spectrum Sharing Networks
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
Mathematics Computer Science