This paper studies the cognitive broadcast channel in which the primary user communicates to the primary receiver, while the secondary user has noncausal knowledge of the primary radio's codeword and expects to co...This paper studies the cognitive broadcast channel in which the primary user communicates to the primary receiver, while the secondary user has noncausal knowledge of the primary radio's codeword and expects to communicate to two secondary receivers. Comparing with the existing cognitive radio channel which considers only one secondary receiver, cognitive broadcast channel studies the case that there are multiple secondary receivers.To this end, we investigate the fundamental limits of the performance of the Gaussian cognitive broadcast channel from the information theoretic perspective. Specifically, we derive the capacity region of the Gaussian cognitive degraded broadcast channel with weak interference.展开更多
Different schemes, which performed channel, power and time allocation to enhance the network performance of overall end-to-end throughput for cooperative cognitive radio network, were investigated. Interference temper...Different schemes, which performed channel, power and time allocation to enhance the network performance of overall end-to-end throughput for cooperative cognitive radio network, were investigated. Interference temperature limit of corresponding primary users was considered. Due to the constraints caused by multiple dual channels, the power allocation problem is non-convex and NP-hard. Based on geometric programming (GP), a novel and general algorithm, which turned the problem into a series of GP problems by logarithm approximation (LASGP), was proposed to efficiently solve it. Numerical results verify the efficiency and availability of the LASGP algorithm. Solutions of LASGP are provably convergent and globally optimal point can be observed as well as the channel allocation always outperforms power or timeslot allocation from simulations. Compared with schemes without any allocation, the scheme with joint channel, power and timeslot allocation significantly increases the overall end-to-end throughput by no less than 70% under same simulation conditions. This scheme can not only maximize the throughput by increasing total maximum power of relay node, but also outperform other resource allocation schemes when lower total maximum power of source and relay nodes is restricted. As the total maximum power of source node increases, the scheme with joint channel and timeslot allocation performs best in all schemes.展开更多
基金supported by the Project-Sponsored by SRF for ROCS,SEMthe National Science and Technology Major Project of the Ministry of Science and Technologyof China under Grants No.2012ZX03003004,No.2010ZX03006002+2 种基金the National Natural Science Foundation of China under Grants No.61172052,No.61261046the Scientific Research Foundation of the Higher Education Institutions of Guangxi under Grant No.201203YB159Wuzhou University Foundation under Grant No.2012B001
文摘This paper studies the cognitive broadcast channel in which the primary user communicates to the primary receiver, while the secondary user has noncausal knowledge of the primary radio's codeword and expects to communicate to two secondary receivers. Comparing with the existing cognitive radio channel which considers only one secondary receiver, cognitive broadcast channel studies the case that there are multiple secondary receivers.To this end, we investigate the fundamental limits of the performance of the Gaussian cognitive broadcast channel from the information theoretic perspective. Specifically, we derive the capacity region of the Gaussian cognitive degraded broadcast channel with weak interference.
基金Project(60902092) supported by the National Natural Science Foundation of China
文摘Different schemes, which performed channel, power and time allocation to enhance the network performance of overall end-to-end throughput for cooperative cognitive radio network, were investigated. Interference temperature limit of corresponding primary users was considered. Due to the constraints caused by multiple dual channels, the power allocation problem is non-convex and NP-hard. Based on geometric programming (GP), a novel and general algorithm, which turned the problem into a series of GP problems by logarithm approximation (LASGP), was proposed to efficiently solve it. Numerical results verify the efficiency and availability of the LASGP algorithm. Solutions of LASGP are provably convergent and globally optimal point can be observed as well as the channel allocation always outperforms power or timeslot allocation from simulations. Compared with schemes without any allocation, the scheme with joint channel, power and timeslot allocation significantly increases the overall end-to-end throughput by no less than 70% under same simulation conditions. This scheme can not only maximize the throughput by increasing total maximum power of relay node, but also outperform other resource allocation schemes when lower total maximum power of source and relay nodes is restricted. As the total maximum power of source node increases, the scheme with joint channel and timeslot allocation performs best in all schemes.
