| 注册
首页|期刊导航|东南大学学报(自然科学版)|一种用于OFDMA认知网络的低复杂度资源分配算法

一种用于OFDMA认知网络的低复杂度资源分配算法

宋晓勤 刘叶 金慧 雷磊 胡静 宋铁成

东南大学学报(自然科学版)2017,Vol.47Issue(6):1123-1128,6.
东南大学学报(自然科学版)2017,Vol.47Issue(6):1123-1128,6.DOI:10.3969/j.issn.1001-0505.2017.06.007

一种用于OFDMA认知网络的低复杂度资源分配算法

A low-complexity resource allocation algorithm for OFDMA cognitive networks

宋晓勤 1刘叶 1金慧 1雷磊 1胡静 2宋铁成2

作者信息

  • 1. 南京航空航天大学电子信息工程学院,南京211106
  • 2. 东南大学信息科学与工程学院,南京210096
  • 折叠

摘要

Abstract

For the power-limited orthogonal frequency division multiple access (OFDMA) cognitive networks,a low-complexity resource allocation algorithm is proposed,including subcarrier allocation and power allocation.In the subcarrier allocation,the algorithm assigns the subcarriers with the worst channel quality to the users at a higher priority.Then,the remaining subcarriers are sorted in descending order according to the variance of channel quality and assigned to the users.Thus,the remaining subcarriers will not be allocated to the users with the worst channel quality.In the power allocation,the judgment of the anti-interference threshold of the primary user is introduced into the traditional linear water-filling algorithm.This algorithm can maximize the throughput of secondary users and improve the anti-interference ability of the primary user simultaneously.The simulation resuits show that,compared with the existing algorithms,the proposed algorithm can effectively improve the channel quality for the subcarriers allocated to users.The throughput of secondary users is very close to the theoretical upper bound.The proposed algorithm has an acceptable faimess for primary users and low computational complexity.

关键词

OFDMA/子载波分配/功率分配/用户吞吐量

Key words

orthogonal frequency division multiple access (OFDMA)/subcarrier allocation/power allocation/user throughput

分类

信息技术与安全科学

引用本文复制引用

宋晓勤,刘叶,金慧,雷磊,胡静,宋铁成..一种用于OFDMA认知网络的低复杂度资源分配算法[J].东南大学学报(自然科学版),2017,47(6):1123-1128,6.

基金项目

国家自然科学基金资助项目(61372104,61572254)、研究生创新基地(实验室)开放基金资助项目(kfjj20170402). (61372104,61572254)

东南大学学报(自然科学版)

OA北大核心CSCDCSTPCD

1001-0505

访问量0
|
下载量0
段落导航相关论文