Resource allocation for relay assisted cognitive radio network  

作　　者：袁福 郑林华 袁继兵 王梓斌 

机构地区：[1]School of Electronic Science and Engineering, National University of Defense Technology

出　　处：《Journal of Central South University》2013年第4期969-976,共8页中南大学学报（英文版）

基　　金：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.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.

关 键 词：cognitive radio joint resource allocation geometric programming RELAY 

分 类 号：TN925[电子电信—通信与信息系统] TM58[电子电信—信息与通信工程]