检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]武汉科技大学电子与信息工程系,湖北武汉430081 [2]华中科技大学电子与信息工程系,湖北武汉430074
出 处:《华中科技大学学报(自然科学版)》2012年第2期77-80,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)
基 金:国家自然科学基金资助项目(60802009);国家科技重大专项资助项目(2010ZX03003-001-02;2010ZX03005-001-03;2012ZX03001036-002);中央高校基本科研业务费专项资金资助项目(2011QN021);湖北省自然科学基金资助项目(2008CDB325)
摘 要:研究了多用户协作通信系统容量与用户间比例公平性的折衷优化问题,将该优化问题视作非凸优化问题.为减小算法复杂度,利用并行分解的方法给出了一种机会中继与分布式功率分配的联合资源优化算法.首先提出了基于用户容量增益的机会中继选择策略,然后利用KKT条件给出了分布式节点优化功率分配算法.仿真结果表明:相对于随机中继选择以及平均功率分配,该算法在具有较低的算法复杂度的同时,能够显著提高系统性能并保证公平性.Scenario of a multi-user cooperative network was considered, in which the system through- put was optimized by using opportunistic relaying. In consideration of both fairness guarantee and throughput enhancement, it was showed that the optimization problem was formulated as a non-con-vex optimization problem, which was difficult to find the global optimum in terms of computational complexity. Thus the optimization problem was decomposed into two sub-problems o{ opportunistic relaying scheme and power allocation. First, the opportunistic relaying strategy was proposed bymaking use of the equivalent channel power gain. Second, a low-complexity power allocation scheme was given. The simulation result shows that the proposed scheme can both improve the system throughput and ensure the fairness with a low-complexity computational cost.
关 键 词:无线通信系统 协作通信 比例公平 资源分配 机会中继
分 类 号:TN925[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15