A. Martínez-Vargas and Á.G. Andrade (Mexico)
Dynamic spectrum access, knapsack problem, dynamic programming, open sharing model.
In this paper, we introduce and study the dynamic spectrum allocation problem in cognitive radio networks. We present the preliminary results using a standard knapsack approach to simulate a Spectrum Commons Model. A dynamic programming technique is used to solve the knapsack problem. We consider a central coordinator node, namely, spectrum server. It collects all the reports from nodes and makes a decision, according to a predefined objective: maximizing the aggregated throughput without violating the system capacity constraint.
Important Links:
Go Back
