检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]大连理工大学信息与通信工程学院,辽宁大连116023 [2]中国刑事警察学院公安情报系,辽宁沈阳110035 [3]辽宁工业大学电子与信息学院,辽宁锦州121001
出 处:《系统工程与电子技术》2015年第9期2129-2134,共6页Systems Engineering and Electronics
基 金:国家自然科学基金(61172058);高等学校博士学科点专项科研基金(20120041110011)资助课题
摘 要:在传统的无线多播传输中,多播组的系统性能受限于多播组内的最差用户的信道质量。为了克服多播组的系统性能受限的问题,将协作传输引入到基于正交频分多址(orthogonal frequency division multiple access,OFDMA)的无线多播网络中,并提出了在总传输速率受限的情况下,最小化总传输功率的动态资源分配算法。为了减少计算复杂度和保障公平性,提出了协作公平子载波分配算法(cooperative fair,CF)和迭代注水功率分配算法。仿真结果显示,在多播组的用户中进行协作传输的系统性能,要远高于采用传统多播直接传输的性能,并且所提算法也在保证系统性能的同时,实现了多播组间良好的公平性。In conventional wireless multicast scheme, the performance of multicast group is constrained by the user with the worst channel quality. In order to overcome this problem of limited performance, cooperative communication in orthogonal frequency division multiple access (OFDMA)-based multicast network is considered. A dynamic resource allocation algorithm is exploited for targeting the minimum the total power of system while the total rate is constrained. In order to reduce the high computational complexity and guarantee the fair resource allocation of multicast groups, a cooperative fair (CF) subcarrier allocation algorithm and an iterative water-filling power allocation algorithm are proposed. Simulation results show that by exploiting the user coopera- tion among group members, system performance of the proposed scheme with cooperation is significantly enhanced compared with a conventional multicast scheme with direct transmission. Moreover, the proposed algorithms can achieve good tradeoff between capacity and fairness.
分 类 号:TN929.53[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.36