共查询到20条相似文献,搜索用时 468 毫秒
1.
发现干扰节点,并将功率适当地分配至各个可用频谱上,以提高节点数据率和网络吞吐量,是认知无线电网络当前的研究热点.本文提出一种基于非协作博弈功率分配方法(PANG),以提高认知无线网络系统吞吐量.PANG将认知网络节点功率分配问题转化为非协作博弈问题,并采用线性代价因子的方法抑制功率分配时的盲目性.理论分析表明,PANG存在纳什均衡点,具有帕累托最优解.本文使用Matlab对PANG算法进行仿真,仿真结果表明,PANG算法能够比PIWF算法更加合理的进行功率分配,并有效的提高系统吞吐量. 相似文献
2.
3.
4.
5.
为了降低长期演进技术增强(long term evolution-advanced,LTE-A)网络中资源分配时的功率消耗,提高小区边缘用户频谱利用率,提升系统吞吐量,提出了LTE-A网络中基于下行协作多点传输(coordinated multi-point transmission/reception,CoMP)技术的跨层功率分配优化方法。该方法在传统功率分配方法的基础上引入了联合处理(joint processing/transmission,JP)技术,并对其进行了分析;接着将无线链路控制(radio link control,RLC)层的用户队列状态信息情况考虑到物理层的功率分配算法模块中,建立了新的跨层功率分配方案,并且使用了遗传算法对该方案进行求解;仿真结果表明和传统的几种方法比较起来,有效提高了小区平均频谱效率和边缘频谱效率,减少了功率浪费。 相似文献
6.
随着无线通信业务的不断增长和智能终端的日益多样化,无线频谱资源变得愈加紧缺,认知无线电作为一项能够有效解决频谱利用率过低的技术,近年来引起了学术界和工程界的广泛关注。在认知无线电网络中,次用户以合作频谱感知的方式智能判断主用户的工作状态,以便在授权频谱的空闲时段内接入并加以使用。将全双工通信技术引入到传统的认知无线电网络中,实现了频谱感知和数据传输的同步,既能确保数据传输的连续性,又能减少对主用户的干扰,对提升无线频谱利用率具有重要作用。对于多信道全双工认知无线电网络的信道分配,建立了次级网络吞吐量最大化模型,并通过惩罚函数法,将混合整数非线性规划问题转换成不带约束条件的非线性规划问题,提出了基于遗传算法的全双工认知无线电网络信道分配策略。仿真实验结果表明,该算法能在综合考虑算法复杂度和性能的情况下,完成信道分配并保证次级网络吞吐量的最大化。 相似文献
7.
提出了一个基于OFDM的多用户认知无线电系统的基于效用函数的跨层资源优化分配算法,该算法不仅能控制认知用户因为频谱泄露导致的对主用户的干扰,而且能够在多个认知子用户间平衡资源分配中的资源使用效率和公平性的问题。仿真结果显示,提出的算法就平均吞吐量或平均效用与现有的最具代表性的两种典型算法相比有更好的性能,同时认知子用户也获得了公平性的资源分配。 相似文献
8.
基于underlay频谱共享模式的认知异构网络可有效缓解频谱资源短缺问题,但同时会加剧网络中的干扰。针对该问题,提出了一种基于非合作博弈模型的动态频谱分配和功率控制算法进行干扰协调。首先,考虑频谱共享造成的干扰问题,引入认知用户优先等级,将问题构建为联合动态频谱分配与功率控制的频谱定价博弈模型;其次,通过两阶段动态博弈得到纳什均衡解,实现认知网络层频谱资源合理分配和发射功率控制。仿真表明,所提算法能够实现不同优先级用户频谱资源的合理分配和认知基站发射功率控制,有效抑制认知异构网络的跨层干扰和层内干扰。 相似文献
9.
研究认知无线电网络中的分布式频谱资源分配策略对提高频谱资源利用率具有重要的意义.基于动态议价博弈模型并结合最佳单位带宽定价,对认知无线电网络中主用户和认知用户的收益进行建模,在此基础上提出一种高效的基于议价博弈的分布式频谱分配策略(Bargaining Game-Distributed Spectrum Allocation Strategy,BG-DSAS).分别分析了两用户和N用户条件下的策略方案,并给出了实现BG-DSAS频谱分配策略的算法流程.仿真实验从多个角度分析了策略的合理性和有效性. 相似文献
10.
11.
12.
13.
14.
Oscar Ardaiz Pau Artigas Torsten Eymann Felix Freitag Leandro Navarro Michael Reinicke 《Applied Intelligence》2006,25(2):131-145
Efficient resource allocation in dynamic large-scale environments is one of the challenges of Grids. In centralized economic-based
allocation approaches, the user requests can be matched to the fastest, cheapest or most available resource. This approach,
however, shows limitations in scalability and in dynamic environments. In this paper, we explore a decentralized economic
approach for resource allocation in Grid markets based on the Catallaxy paradigm. Catallactic agents discover selling nodes
in the resource and service Grid markets, and negotiate with each other maximizing their utility by following a strategy.
By means of simulations, we evaluate the behavior of the approach, its resource allocation efficiency and its performance
with different demand loads in a number of Grid density and dynamic environments. Our results indicate that while the decentralized
economic approach based on Catallaxy applied to Grid markets shows similar efficiency to a centralized system, its decentralized
operation provides greater advantages: scalability to demand and offer, and robustness in dynamic environments. 相似文献
15.
基于分布式网络资源的网络带宽分配方法 总被引:1,自引:0,他引:1
本文针对计算机网络资源的带宽分配问题提出一种分配求解方法,该方法根据用户提出的带宽资源需求和系统可用资源的状况,按用户满意度最佳和系统效率最佳的原则制订价格,并通过用户的价格参数进行带宽资源的协商与分配.分析表明,该方法可以达到优化系统效率和提高用户满意度的目标. 相似文献
16.
We deal with a buffer allocation problem of assembly/disassembly (AD) systems with a finite buffer capacity. The problem is to determine capacities of individual buffers for a given total available capacity of buffers with the objective of maximizing throughput rate. We first present an algorithm (BA-G) in which a conventional gradient search is used for finding an initial solution and a two-optimization procedure is used for improving the initial solution. Since this algorithm may require an excessive computation time, especially when a procedure for performance evaluation employed in the algorithm takes a long computation time, a new algorithm (BA-P) is developed in which a sophisticated procedure is used for finding an initial solution. In this procedure, capacities of individual buffers are determined based on the efficiency of their upstream and downstream machines. Results of computational experiments show that the latter algorithm gives the same solutions as those obtained by the former algorithm in much shorter time. 相似文献
17.
本文提出了一种多载波系统中自适应功率和比特分配算法。该算法在低信噪比时基于最大化信道容量分配比特,基于最小化误码率分配功率;在高信噪比时采用Fischer算法进行比特功率分配。仿真结果表明,低信噪比时所提算法比Fisher算法性能好,高信噪比时和Fisher算法的性能一样好。因此,文中所提算法比Fisher算法更具有实际应用价值。仿真结果也表明了子载波数对系统性能的影响。 相似文献
18.
Wei Li Flávia C. Delicato Paulo F. Pires Young Choon Lee Albert Y. Zomaya Claudio Miceli Luci Pirmez 《Journal of Parallel and Distributed Computing》2014
Wireless Sensor Networks (WSNs) are useful for a wide range of applications, from different domains. Recently, new features and design trends have emerged in the WSN field, making those networks appealing not only to the scientific community but also to the industry. One such trend is the running different applications on heterogeneous sensor nodes deployed in multiple WSNs in order to better exploit the expensive physical network infrastructure. Another trend deals with the capability of accessing sensor generated data from the Web, fitting WSNs in novel paradigms of Internet of Things (IoT) and Web of Things (WoT). Using well-known and broadly accepted Web standards and protocols enables the interoperation of heterogeneous WSNs and the integration of their data with other Web resources, in order to provide the final user with value-added information and applications. Such emergent scenarios where multiple networks and applications interoperate to meet high level requirements of the user will pose several changes in the design and execution of WSN systems. One of these challenges regards the fact that applications will probably compete for the resources offered by the underlying sensor nodes through the Web. Thus, it is crucial to design mechanisms that effectively and dynamically coordinate the sharing of the available resources to optimize resource utilization while meeting application requirements. However, it is likely that Quality of Service (QoS) requirements of different applications cannot be simultaneously met, while efficiently sharing the scarce networks resources, thus bringing the need of managing an inherent tradeoff. In this paper, we argue that a middleware platform is required to manage heterogeneous WSNs and efficiently share their resources while satisfying user needs in the emergent scenarios of WoT. Such middleware should provide several services to control running application as well as to distribute and coordinate nodes in the execution of submitted sensing tasks in an energy-efficient and QoS-enabled way. As part of the middleware provided services we present the Resource Allocation in Heterogeneous WSNs (SACHSEN) algorithm. SACHSEN is a new resource allocation heuristic for systems composed of heterogeneous WSNs that effectively deals with the tradeoff between possibly conflicting QoS requirements and exploits heterogeneity of multiple WSNs. 相似文献
19.
网络环境下高校自动排课系统中教室安排算法的设计与分析 总被引:6,自引:0,他引:6
自动排课系统在高校教学管理中处于重要位置,也是一个难题。本文设计了一种高校自动排课系统中教室安排算法,对算法中四类不同的教室安排方式结果的合理性和效率进行了详细地比较和分析,设计并实现了高校教室安排与管理系统。 相似文献
20.
智能土石方调配系统对工程数据、生产数据和地理空间数据进行数字化,存入数据库服务器,根据工程进度计划,利用动态线性规划算法,生成任意时间跨度的土石方调配方案。由于大型工程数据量巨大,影响土石方调配方案的边界条件众多,且实际施工现场数据处于动态变化之中,因此智能土石方调配系统的数据库设计的好坏,直接关系到整个土石方调配平衡方案的可信度、可操作性和运行质量。通过需求分析,设计了数据库结构,开发了智能土石方调配系统并应用到世界最高的面板坝的土石方调配方案优化分析中,数据库运行状况良好,提高了土石方调配方案的准确性和可操作性。 相似文献