首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到12条相似文献,搜索用时 15 毫秒
1.
In downlink coordinated multi-point(CoMP) system, full cooperation is always not applicable in real world because of its high request in the backhaul. To deal with this problem, clustering decision is made to process transmission. In this paper clustering methods based on the metric signal-to-leakage-plus-noise(SLNR) is proposed. In addition, user scheduling schemes based on SLNR is also put up to make the scheduling set as large as possible. Simulation results show that the proposed clustering methods not only reduce the data sharing among the cooperating base stations(BSs), but also improve the system throughput compared with the traditional clustering methods based on channel strength.  相似文献   

2.
The downlink zero-forcing beamforming strategy in the case of random packet arrivals is investigated. Under this setting, the relevant fairness criterion is the stabilization of all buffer queues which guarantees a bounded average delay for all users. It has been shown that allocating resources to maximize a queue-length-weighted sum of the rates is a stabilizing policy. However, the high complexity of user selection and the feasible rates determination for optimal scheme may prevent the real-time scheduling operation. Two low complexity algorithms are provided taking the channel state, queue state and orthogonality into account. In particular, the authors pick the first user with the largest product between channel gain and queuing length, and select the remaining users to construct candidate user set based on the greedy user selection method or channel orthogonal user selection method. Then, the power and rate allocation for the selected users are implemented based on the modified water-filling method. The complexity of the proposed algorithms is analyzed. The average delay and average throughput are studied in homogeneous scenarios and heterogeneous scenarios, respectively. Simulation results show that the proposed algorithms can take full advantage of the multi-user diversity gain and provide average delay (or throughput) and fairness improvement compared with channel-aware-only schemes.  相似文献   

3.
传统的应急决策和调度对突发事件地点周围的人员和物资信息不能及时充分掌握,不能第一时间做出决策方案的问题,面对这一问题,本文设计的系统旨在紧急突发事件发生后,快速参考对比相似案例,通过案例推理和规则推理算法分析得出最佳应急决策,通过决策进行资源的合理、便捷调度.  相似文献   

4.
针对采用随机波束成形的MIMO下行链路,提出了一种多用户调度算法。在接收端利用每个用户在各个波束方向上的比例公平性参数来得到容量门限。仿真结果显示,这种调度算法相比其他门限调度算法,在系统性能无明显损失的情况下,有效地减小了反馈量。  相似文献   

5.
针对多功能一体化相控阵雷达的资源管理与调度,对系统工作模式、约束条件进行了探讨。研究了一种多功能资源资源管理与调度技术,分析了在各种模式下系统资源分配、系统功能实现的状况以及高效、高速合成系统多任务所需的不同波束。  相似文献   

6.
Due to the constraint of single carrier frequency division multiple access (SC-FDMA) adopted in long term evolution (LTE) uplink, subcarriers allocated to single user equipment (UE) must be contiguous. This contiguous allocation constraint limits resource allocation flexibility and makes the resource scheduling problem more complex. Most of the existing work cannot well meet UE's quality of service (QoS) requirement, because they just try to improve system performance mainly based on channel condition or buffer size. This paper proposes a novel resource scheduling scheme considering channel condition, buffer size and packet delay when allocating frequency resource. Firstly, optimization function is formulated, which aims to minimize sum of weight for bits still left in UE buffer after each scheduling slot. QoS is the main concern factor here. Then, to get packet delay information, this paper proposes a delay estimation algorithm. Relay node (RN) is introduced to improve overall channel condition. Specific RN selection strategy is also depicted in the scheme. Most important of all, a creative negotiation mechanism is included in the subcarrier allocation process. It can improve the overall system throughput performance in guarantee of user's QoS requirement. Simulation results demonstrate that the scheme can greatly enhance system performance like delay, throughput and jitter.  相似文献   

7.
To take advantage of the multiuser diversity resulted from the variation in channel conditions among the users,it has become an interesting and challenging problem to efficiently allocate the resources such as subcarriers,bits,and power.Most of current research concentrates on solving the resource-allocation problem for all users together in a centralized way,which brings about high computational complexity and makes it impractical for real system.Therefore,a coalitional game framework for downlink multi-user resource allocation in long term evolution(LTE) system is proposed,based on the divide-and-conquer idea.The goal is to maximize the overall system data rate under the constraints of each user’s minimal rate requirement and maximal transmit power of base station while considering the fairness among users.In this framework,a coalitional formation algorithm is proposed to achieve optimal coalition formation and a two-user bargaining algorithm is designed to bargain channel assignment between two users.The total computational complexity is greatly reduced in comparison with conventional methods.The simulation results show that the proposed algorithms acquire a good tradeoff between the overall system throughout and fairness,compared to maximal rate and max-min schemes.  相似文献   

8.
为了改善现有车路通信方式覆盖范围小、交付时延大和传输速率低的现状,将TD-LTE技术引入车路通信接入系统。提出了基于TD-LTE的车路通信接入系统无线资源调度模型;构建了车路通信仿真场景,对比例公平算法、指数比例公平算法和改进的最大权重时延优先算法进行性能分析。仿真结果表明:车辆低速移动场景下,系统负载较低时指数比例公平算法性能较好,系统负载较高时改进的最大权重时延优先算法表现更优,比例公平算法不适合车路通信多媒体业务流调度;车辆高速移动场景下,三者都不适合车路通信多媒体业务流调度。  相似文献   

9.
This paper addresses the issue of real-time data transmission in vehicles to roadside (V2R) environment by the hybrid coordination function (HCF) of controlled channel access (HCCA) specified by the IEEE 802.1 lp standard. HCCA is one of the medium access mechanisms in the IEEE 802.11 standard, and uses the polling scheme similar to the point coordination function (PCF) to provide reliable quality of service (QoS), which may cause resource overshooting and high time consuming. This paper tries to improve the performance of the HCCA polling scheme and designs new data transmission scheduling scheme. The simulation results of the proposal are compared with those of the standard strategy. Simulation results demonstrate that the improved HCCA has lower delay, loss rate, and higher throughput than those of the standard one.  相似文献   

10.
基于ILP的综合接入系统I/O调度方案   总被引:5,自引:0,他引:5  
在综合业务接入系统中引入了自治系统内部标签(ILP)信令格式,提出了一种新的基于优先级的参数自适应轮询调度(priority-based parameter auto-adaptive round-robin scheduling)方案,给出了该方案在综合接入系统I/O调度中的实现方法,并对调度方案的性能进行了实验分析。  相似文献   

11.
The algorithm of scheduling scheme of channel-aware priority-based groupwise transmission is investigated for non-real time data service for the uplink direct sequence code division multiple access (DS/CDMA) system using the burst-switching scheme to support the integrated voice/data service. The proposed scheme optimally determines the transmission-time groups and assigns optimal data rates to the users with packets in the transmission-time group depending on priority metric, which involves several parameters such as delay threshold, waiting time, length of packet, and state of the channel, in a way of minimizing the average transmission delay. Simulation results show that the proposed algorithm gives better performance of average transmission delay and packet loss probability than any other conventional algorithms.  相似文献   

12.
This article proposes a dynamic subcarrier and power allocation algorithm for multicell orthogonal frequency division multiple access (OFDMA) downlink system, based on inter-cell interference (ICI) mitigation. Different from other ICI mitigation schemes, which pay little attention to power allocation in the system, the proposed algorithm assigns channels to each user, based on proportional-fair (PF) scheduling and ICI coordination, whereas allocating power is based on link gain distribution and the loading bit based on adaptive modulation and coding (AMC) in base transceiver station (BTS). Simulation results show that the algorithm yields better performance for data services under fast fading.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号