共查询到14条相似文献,搜索用时 156 毫秒
1.
针对多用户多输入多输出 正交频分复用(multiple input multiple output-orthogonal frequency division multiple, MIMO-OFDM)系统的上行链路提出一种基于非合作博弈模型的跨层资源分配算法。基站为用户分配初始上行速率后,各用户间通过非合作博弈方式实现功率最小化。功率未饱和的用户向基站申请增加吞吐量,基站在调整用户吞吐量时综合考虑用户信道条件与媒体访问控制(media access control, MAC)层缓存的状态。仿真表明,算法既降低了用户终端的功率开销,同时兼顾了多用户间的公平性。 相似文献
2.
3.
4.
为了满足非正交多址接入(non-orthogonal multiple access,NOMA)系统下行链路的一个多用户集群中不同用户的业务需求,提出了具有用户服务质量(quality of service,QoS)保证与最大最小(max-min)公平性准则的功率分配算法。针对不同用户需求,制定了在基站发射总功率与用户满足的最低速率要求约束下的max-min公平准则的优化问题模型,并利用二分法与Karush-Kuhn-Tucker(KKT)条件对复杂的非凸问题进行求解。仿真结果表明,该功率分配算法既保证了用户的QoS要求又满足了用户的公平性准则,并且NOMA系统的吞吐量相较于传统多址接入系统的吞吐量有较大的提升。 相似文献
5.
6.
一种多天线多用户下行系统保障公平的资源分配策略 总被引:1,自引:1,他引:0
将比例公平调度机制推广到多天线多用户下行系统,提出了一种保障公平的资源分配方案和多用户调度机制.基站利用块对角化预编码机制,将多天线下行系统分解为并行无干扰子信道,并根据各个用户的信道状态,选择优化用户集进行传输,从而在保障公平性的同时最大化系统总速率.同时分析了信道反馈错误对该资源分配机制的影响.仿真结果表明,与其他几种用户调度机制相比,该资源分配方案在吞吐量和公平性之间取得了良好的折中. 相似文献
7.
针对无线总线替代有线总线所带来的网络实时性和吞吐量下降的问题,充分利用无线信道提供的众多信道,在媒体接入控制(media access control, MAC)层提出了一种多信道调度算法。该算法在星型拓扑下将每个通信周期分为载波侦听多路访问(carrier sense multiple access,CSMA)阶段和时分多址(time division multiple access,TDMA)阶段。在CSMA阶段,基于不同优先级的灵活接入使得节点间发生碰撞的可能性大大降低。在TDMA阶段,基于全局队列的最早截止时间优先(earliest deadline first, EDF)调度使得信道利用率明显提高。仿真结果表明:提出的多信道MAC调度算法可以有效提高网络的实时性和吞吐量。 相似文献
8.
超密集网络(ultra-dense network, UDN)中,毫微微基站(femto-cell base station, FBS)的密集和随机部署会导致严重的小区间干扰。为了减轻干扰、保障用户服务质量(quality of service, QoS),提出了一种UDN中基于聚类的资源分配方案。首先,设计了一种基于加权密度的改进K-means聚类算法,将FBS动态划分为不同的簇。然后,以最大化UDN系统吞吐量为目标提出了一种两阶段时频资源分配方案:第一阶段,每个聚类内使用贪婪算法执行时频资源块的分配;第二阶段,利用资源补偿分配算法分配剩余的资源块,在考虑用户公平性的同时保证用户QoS。仿真结果表明,本文提出的资源分配方案能够有效提升系统吞吐量,同时保证用户QoS和公平性。 相似文献
9.
一种Ad Hoc网络信道接入退避算法及仿真分析 总被引:3,自引:1,他引:3
移动自组网络的应用环境以及其在商业上的潜在应用要求它支持QoS,高效合理的MAC协议对于保障Ad Hoc网络QoS具有重要的意义。在分析现有典型MAC协议及退避算法的基础上,提出了一种支特动态服务区分兼顾公平性的退避算法——服务区分动态退避(SDDB)算法。分析和仿真结果证明,与IEEE802.11等协议采用的退避算法相比,该算法在信道公平性和提供服务区分方面有较好的改善,并且在信道的吞吐量和提供服务区分、改善信道接入公平性之间能达到较好的折衷。 相似文献
10.
11.
A new scheduling scheme based on users’ quality of service (QoS) in mobile WiMAX networks is presented. The proposed scheme tracks each user’s average rate and adjusts the corresponding scheduling weight adaptively to result in: (a) each user’s average rate is proportional to the corresponding QoS level; (b) the constraints of the minimal and/or maximal rates required by QoS can be satisfied; (c) the utility function of system is maximal under the constraints (a) and (b). Theoretical analysis based on utility function and simulation results indicates the system throughput can be improved dramatically in the proposed scheme. 相似文献
12.
提出基于多波束天线静止地球轨道卫星的宽带移动通信系统方案,与常规结构同类系统用户相比,其容量更大、业务质量更好。采用时隙同步码分多址辅助的多频时分多址接入、程控交换与因特网协议交换结合的交换、时分复用和准正交时分复用下行链路传输体制,可显著增加用户量,简化星上设备,改善互联网应用业务质量。用户接入信道数为173 880, 最高用户下载速率达155 Mbps。仿真结果表明,140个波束、每波束26个16幅度相移键控信号的用户下行链路传输比频分复用传输的链路性能改善11.65dB,使得宽带用户“动中通”天线等效口径缩小至原来的1/4,成本大幅降低。 相似文献
13.
Zero-forcing beamforming with receiver antenna selection in downlink multi-antenna multi-user system
A study on the zero-forcing beamforming (ZFBF) scheme with antenna selection at user terminals in downlink multi-antenna multi-user systems is presented. Simulation results show that the proposed ZFBF scheme with receiver antenna selection (ZFBF-AS) achieves considerable throughput improvement over the ZFBF scheme with single receiver antenna. The results also show that, with multi-user diversity, the ZFBF-AS scheme approaches the throughput performance of the ZFBF scheme using all receiver antennas (ZFBF-WO-AS) when the base station adopts semi-orthogonal user selection (SUS) algorithm, and achieves larger throughput when the base station adopts the Round-robin scheduling algorithm. Compared with ZFBF-WO-AS, the proposed ZFBF-AS scheme can reduce the cost of user equipments and the channel state information requirement at the transmitter (CSIT) as well as the multiuser scheduling complexity at the transmitter. 相似文献
14.
To minimize the total transmit power for multicast service in an orthogonal frequency division multiplexing (OFDM) downlink system, resource allocation algorithms that adaptively allocate subcarriers and bits are proposed. The proposed algorithms select users with good channel conditions for each subcarrier to reduce the transmit power, while guaranteeing each user’s instantaneous minimum rate requirement. The resource allocation problem is first formulated as an integer programming (IP) problem, and then, a full search algorithm that achieves an optimal solution is presented. To reduce the computation load, a suboptimal algorithm is proposed. This suboptimal algorithm decouples the joint resource allocation problem by separating subcarrier and bit allocation. Greedy-like algorithms are employed in both procedures. Simulation results illustrate that the proposed algorithms can significantly reduce the transmit power compared with the conventional multicast approach and the performance of the suboptimal algorithm is close to the optimum. 相似文献