检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]湖南科技学院计算机与通信工程系,湖南永州425100 [2]华南师范大学软件学院,广东佛山528225
出 处:《计算机应用研究》2014年第10期3071-3074,共4页Application Research of Computers
基 金:国家自然科学基金资助项目(71272144);湖南省自然科学基金资助项目(11JJ6065);湖南省教育厅科研基金资助项目(12C0681;10C0732)
摘 要:在具有多个次级用户的认知无线电网络中,资源分配问题通常需要同时考虑能效、网络编码的合作传输。针对多次级用户的资源分配问题,使用纳什议价方案建立了一种博弈。该博弈使用考虑成对策略的NBS函数和作为网络优化目标,并使用上下文环境作为约束;引入对次级用户间的双赢合作,使系统的吞吐量和公平性性能得到了改善,并基于此提出了一种高能效的次优资源分配方案。仿真结果显示,所提算法在公平性和能量效率两方面折中的性能要好于通常的距离成对机制,同时其计算复杂度也低于遍历搜索最优化方法。In cognitive radio networks with multi-secondary user (SU), resource allocation problem usually simultaneously considers energy efficiency, network coding, and cooperative transmission. For multi-SU resource allocation problem, this pa- per used Nash bargaining strategy to construct a game, which used the sum of the NBS functions with paring strategy as the Ol5- timal objective and the context conditions as the constraints. It improved the system throughput and fairness via the win-win co- operation between the paring secondary users. Then based on this, it proposed an energy efficient sub-optimal resource alloca- tion strategy. Simulation results show that the proposed method has a good tradeoff performance between fairness and energy ef- ficiency, which outperforms the familiar distance-pairing schemes; meanwhile, its computation complexity is lower than the optimal method with ergodie search.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117