共查询到20条相似文献,搜索用时 140 毫秒
1.
司钊 《电信工程技术与标准化》2013,(2):80-84
采用改进的贪婪算法分配时隙的无线资源,根据用户业务的QoS和数据队列信息确定用户的优先权,并在获知信道状态信息条件下,按照传输比特消耗功率最小原则搜索所有子载波信道,为用户动态分配子载波和比特。仿真结果表明,在两种传输速率要求下,当接入用户数相同时,改进算法比传统贪婪算法减少功率消耗3.9622W;改进算法多消耗1.9858W功率却增加了2个接入用户,用户消耗平均功率比前者少2.2456W/用户。 相似文献
2.
Ding Xu Zhiyong Feng Ping Zhang 《International Journal of Communication Systems》2014,27(10):2121-2140
This paper considers a downlink cognitive radio network consisting of one cognitive base station and multiple secondary users (SUs) that shares spectrum with a primary network. Unlike most of previous studies that focus on the SUs that carry only one type of service, in this paper, the SUs that carry heterogeneous services are considered. Specifically, the SUs are classified by service types, that is, the SUs that carry nonreal‐time services and the SUs that carry real‐time services. The QoS of the nonreal‐time SUs is guaranteed by the minimum mean rate constraint, whereas the QoS of the real‐time SUs is guaranteed by the minimum instantaneous rate constraint. Under this setup, a joint subchannel, rate, and power allocation scheme based on dual optimization method is proposed to minimize the mean transmit power consumption of the cognitive base station. The complexity of the proposed scheme is linear in the number of subchannels and the number of SUs. Extensive simulation results are provided to validate the proposed resource allocation scheme. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
3.
This paper studies the problem of effective resource allocation for multi-radio access technologies (Multi-RAT) nodes in heterogeneous cognitive wireless networks (HCWNs). End-to-end utility, which is defined as the delay of end-to-end communication, is taken into account in this paper. In the scenario of HCWNs, it is assumed that the cognitive radio nodes have the ability of Multi-RAT and can communicate with each other through different paths simultaneously by splitting the arrival packets. In this paper, the problem is formulated as the optimization of split ratio and power allocation of the source cognitive radio node to minimize the delay of end-to-end communication, and a low complexity step-by-step iterative algorithm is proposed. Numerical results show good performance of the proposed algorithm over two other conventional algorithms. 相似文献
4.
LiangXiaowen ZhuJinkang 《电子科学学刊(英文版)》2004,21(6):454-460
In this paper, a blockwise adaptive subcarrier allocation algorithm for multiuser Orthogonal Frequency Division Multiplexing (OFDM) system is introduced. Assuming the knowledge of channel information for all users, the algorithm minimizes the total transmit power while satisfying the total power and users‘ rate constraints. The result of simulation shows that the proposed algorithm reduces the average bit Signal-to-Noise Ratio (SNR) by approximately 4 dB compared with OFDM-Frequency Division Multiple Access (OFDM-FDMA), and supports more users in a multiuser Rayleigh fading channel. As assigning subcarriers in block, the computational complexity of the algorithm is much lower than that of the derivation of “water-filling” algorithm. 相似文献
5.
Eirini Eleni Tsiropoulou Symeon Papavassiliou 《International Journal of Electronics》2013,100(11):1581-1587
In this letter, the problem of optimal joint uplink power and subcarrier allocation in single-carrier frequency-division multiple access wireless networks with real-time services is addressed, via the introduction and adoption of a utility-based framework. A joint optimisation power and subcarrier allocation problem is formulated and the optimal power allocation is determined, while an iterative algorithm to realise the joint allocation is presented. Finally, numerical results are provided that demonstrate the effectiveness of the proposed approach in terms of power savings and user satisfaction. 相似文献
6.
7.
本文基于单信道系统中时间公平机会调度的研究,提出了3种推广到多用户下行OFDM多载波系统中的方案.这3种方案均以子载波为单位进行调度,充分利用信道的时变和频率选择特性:方案1对每个子载波单独调度,控制参数以时隙为单位更新;方案2将时频二维的子载波串在一起调度,控制参数以子载波为单位更新;方案3同方案2,但控制参数以时隙为单位更新.仿真结果表明,这3种方案均能够在保证时间公平性的前提下,相对非机会调度较大程度地提高系统性能.并且,这3种方案对子载波数和用户数没有限制,简单高效地使用有限的无线资源. 相似文献
8.
9.
HAO Zhi-jie XU Xiao-dong ZHAO Ying-hong TAO Xiao-feng LI Lin-jun ZHANG Zhong-qi 《中国邮电高校学报(英文版)》2010,17(2):14-18,45
Utility based resource allocation strategy in multi-cell orthogonal frequency-division multiplexing (OFDM) system plays a critical role in next generation mobile communication systems. Based on the analysis of risk aversion utility functions, this article proposed the system utility based utility, which is named the customer satisfaction (CS) utility. Compared with the proportional fairness (PF) utility, the CS utility reflects the user demands better, and enables the system to adjust its resource allocation according to both the traffic requirements and the resource situation. 相似文献
10.
In cognitive radio networks (CRNs), resources available for use are usually very limited. This is generally because of the tight constraints by which the CRN operate. Of all the constraints, the most critical one is the level of permissible interference to the primary users. Attempts to mitigate the limiting effects of this constraint, thus achieving higher productivity, are a current research focus, and in this work cooperative diversity is investigated as a promising solution. Cooperative diversity has the capability to achieve diversity gain for wireless networks. In the work, therefore, the possibility of and mechanism for achieving greater utility for the CRN when cooperative diversity is incorporated are studied. To accomplish this, a resource allocation model is developed and analyzed for the heterogeneous, cooperative CRN. In the model, during cooperation, a best relay is selected to assist the secondary users that have poor channel conditions. Overall, the cooperation makes it feasible for virtually all the secondary users to improve their transmission rates while still causing minimal harm to the primary users. The results show a marked improvement in the resource allocation performance of the CRN when cooperation is used in contrast to when the CRN operates only by direct communication. 相似文献
11.
To improve energy efficiency and robustness of heterogeneous wireless networks with wireless information and power transfer,the robust joint transmit power and power splitting resource allocation problem was studied.Based on mini-max probability machine and Dinkelbach method,the original NP-hard problem was transformed into a solvable convex optimization form,meanwhile a distributed dual resource allocation algorithm was proposed.Additionally,both computational complexity and robust sensitivity were analyzed.Simulation results show that the proposed algorithm can guarantee the quality of service requirements of macro cellular users and femtocell users under channel uncertainties. 相似文献
12.
Spectrum resource allocation method of maximizing transmission rate in cognitive heterogeneous wireless networks 总被引:1,自引:0,他引:1
Aiming at the problem that it is difficult to allocate spectrum resources to secondary users efficiently in cognitive heterogeneous wireless networks with heterogeneous spectrum attributes,dynamic channel conditions and diverse service requirements,a spectrum resource allocation strategy with maximum transmission rate was proposed.Firstly,the strategy aimed at maximizing the total transmission rate,and constrained the limited spectrum resources and user service requirements to construct a non-linear multi-constrained spectrum resource allocation 0-1 planning model.Then a polynomial time complexity simplification method was designed.According to idle spectrum information,channel conditions,business requirements and allocation decision history information,and the benefit matrix was constructed and modified to achieve constraint simplification,and the execution efficiency was improved by improving the coefficient matrix transformation strategy of the traditional Hungarian algorithm.Finally,the performance of the method was compared and analyzed by experiments.Experimental results show that the proposed method has higher transmission rate and execution efficiency. 相似文献
13.
14.
Multipath networks allow each source to send packets from it to its destination over multiple paths, which increases the available bandwidth and throughput for source‐destination pairs. Recently, a variety of flow control schemes have been presented for multipath networks to achieve optimal resource allocation. Unfortunately, much of the investigation focused on elastic traffic with controllable packet injection rates. Networks have witnessed an increase in real‐time traffic (voice and video), which are inelastic. We consider resource allocation for heterogeneous traffic in multipath networks and formulate an optimization problem, which is intrinsically difficult nonconvex. In order to address the aforementioned issue and obtain the optimum, we approximate an equivalent problem of the original optimization problem to a strictly convex problem and present a primal‐dual resource allocation algorithm for the approximation problem, which converges to an optimal solution satisfying the Karush‐Kuhn‐Tucker conditions of the original problem. We evaluate its convergence performance through theoretical analysis and illustrate it with numerical examples. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
15.
16.
Orthogonal Frequency Division Multiple Access (OFDMA) is an efficient multiple access method for the future wireless systems.
This paper studies the adaptive subcarrier and bit allocation problem in OFDMA systems to support heterogeneous services.
The goal of the considered resource optimization technique is to maximize the total system throughput under the overall transmit
power constraint while guaranteeing the QoS requirement of realtime users and supporting proportional fairness among non-realtime
users. First, we introduce a Rate Adaptive (RA) resource allocation algorithm for non-realtime users and a Margin Adaptive
(MA) algorithm for realtime users. Then, based on the previous algorithms, a novel algorithm is proposed to allocate the resource
to both classes of users, which makes an efficient tradeoff between the resource usage of realtime users and non-realtime
users. The algorithm is locally optimal solution provided that the MA and RA algorithms are utilized. Also, to reduce the
computational complexity, a suboptimal method based on the balancing of the average power per subcarrier is also introduced.
Monte Carlo simulation results show that all the proposed algorithms outperform the existing counterparts. The results also
show that the suboptimal method for heterogeneous services can efficiently reduce the computational complexity at the cost
of very little performance degradation.
This work was supported by the National Natural Science Foundation of China (Nos. 60472079, 60572115), and by the Natural
Science Foundation of Zhejiang Province (No. Z104252), China. 相似文献
17.
1 Introduction Next-generation wireless communication systems (systems beyond 3G) will be required to provide flexible and easy deployment solution to high-speed communications and to support a variety of services utilizing advanced multiple access techni… 相似文献
18.
In this paper,we investigate the power and subcarrier allocation issue in the case of partial side information for downlink orthogonal frequency division multiple access(OFDMA)system.Relaxation method is utilized to characterize the necessary conditions of the optimal solution and the uniqueness of the optimal solution is proved.The game theoretical concept,surplus function is also introduced to analyze the optimal solution.Based on the theoretical analysis,we propose iterative surplus balancing algorithm(ISBA)that can jointly assign the power and subcarriers in multiple rounds,and then the optimality of ISBA is proved.Simulation results are presented to show the characteristics of the theoretical analysis and ISBA. 相似文献
19.
针对多用户正交频分复用(OFDM)系统资源分配问题,提出了一种改进的基于边缘自适应(MA)准则的子载波和比特分配算法。在采用比例公平准则为每个用户分配子载波集合基础上,以用户速率最大者-最小者(Max-Min)子载波交换为原则进行子载波调整,使用户功率递减同时兼顾用户的公平性;通过对信道状态信息进行判断,利用贪婪算法将用户子载波分配的比特取整,以实现系统功率最小化。实验结果表明,本文提出的改进次优算法的计算复杂度较传统分步算法稍高,但仍远低于最优算法,其系统性能得以提升,且接近最优算法。 相似文献