Skip to Main Content
In this paper, the dynamic spectrum access problem for cognitive radio (CR) networks is formulated as maximizing the sum channel capacity while satisfying the power budgets of individual secondary user radios as well as the SINR constraints on both the secondary and primary users. By applying the Karush-Kuhn-Tucker theorem, we derive a water-filling soluton. An iterative water-filling algorithm is proposed for implementing joint channel and power allocation in a dynamically changing set of available channels. The proposed algorithm has a complexity that increases linearly with both the number of channels and the number of users.
Date of Conference: 3-6 May 2009