In this paper,we consider a multi-channel cognitive radio network(CRN)where each secondary user(SU)can only choose to sense a subset of channels.We formulate a joint optimization problem of sensingchannel selection,sensing time and power allocation under the constraints of average transmit power budget and average interference power budget,which maximizes the CRN’s total throughput.We propose a greedy algorithm to solve the joint optimization problem,which has much less computational complexity.Moreover,it is shown that the search space of the greedy algorithm can be further pruned.Finally,numerical results demonstrate that the greedy algorithm has comparable performance to the exhaustive search algorithm.
展开▼
机译:Do Regional Integration Plans Promote Joint Prevention and Control of Air Pollution? - Lessons from China’s Major City Clusters =区域一体化进程带给大气污染联防联控的契机和挑战 - 基于中国国家级城市群发展的研究