共查询到19条相似文献,搜索用时 171 毫秒
1.
在多用户MIMO下行系统应用中,在保证MIMO复用增益的情况下采用合适的用户调度算法保障用户的公平性一直是问题的关键.通过研究发现比例公平算法严格保障了用户的公平性,但用户公平性是通过单用户调度的方式实现的,这对系统容量有较大影响.提出一种基于用户集调度的比例公平算法,牺牲了一定的公平性以换取系统容量的提升.本文在基于块对角算法的MIMO系统上,对提出的算法进行了仿真验证.仿真表明,在用户集数目适当的条件下,所提出的算法将能在系统复用增益下降不大的前提下保证用户的近似公平. 相似文献
2.
针对下行非正交多址接入系统多用户场景,综合考虑吞吐量、服务质量、公平性、串行干扰消除(SIC)能力等因素,提出一种基于比例速率约束的公平资源分配算法。利用比例公平思想设计自适应比例公平用户配对方案,通过动态调整遗忘因子加快调度优先级的更新速度。设计最优功率分配方案以保证SIC的正确执行,同时为进一步提升配对用户间的公平性,给出基于比例速率约束的2种功率分配方案,获得相对稳定的功率分配关系。仿真结果表明,在保证系统吞吐量的前提下,该算法可有效提升接入系统的用户数和用户间公平性。 相似文献
3.
针对具有不完美信道状态信息的Femtocell双层网络,为了保证网络效用最大化、最小服务质量要求及Femtocell用户之间的效用公平,提出了基于议价博弈的鲁棒功率控制方案.在保证宏小区用户正常传输情况下,考虑到Femtocell家庭用户的最小服务质量要求,将Femtocell网络的鲁棒功率控制问题转化为议价博弈功率控制问题.为了保证Femtocell家庭用户之间的公平性,给出了Kalai-Smorodinsky(K-S)议价博弈解,证明了议价博弈解的存在性和唯一性,并提出了一种基于二分查找算法的分布式鲁棒功率控制方案.仿真结果表明,所提出的算法不仅具有较好的收敛性能,而且能够较好地保证用户之间的公平性. 相似文献
4.
针对现有非合作功率控制博弈算法中存在用户“远近性公平”问题,在主次用户共享频谱的认知无线电上行链路中,给出一种基于代价函数的高效和公平的功率控制博弈算法。在该博弈模型中,代价函数的设定依据次用户接收端信号质量需满足次用户的服务质量要求。改进后的效用函数能够同时兼顾认知无线电系统的总吞吐量和次用户获取资源的公平性,并利用超模理论证明了该模型存在纳什均衡,然后得到求解发射功率纳什均衡解的迭代过程。仿真结果表明,相比已有的研究,该算法不仅能提高认知系统的吞吐量,还能降低发射功率,改善系统效用,而且兼顾了远近用户吞吐量的公平性。 相似文献
5.
随着人们对移动网络服务需求的日益增长,用户需要在复杂的异构网络中实现不同接入技术之间的无缝切换,因此选择总最佳连接并提供服务质量保证的切换决策成为下一代互联网研究的关键内容.为了更好地满足用户的需求,在综合考虑网络信息的不确定性、用户服务质量需求、用户偏好、用户愿意支付的费用以及网络供应商的收益等因素的前提下,设计了基于快速连续蚁群算法的切换决策机制,并引入协商博弈和Nash均衡思想来解决用户之间的串谋问题以保证切换决策的公平性.仿真结果表明,设计的切换决策机制在满足用户服务质量需求的同时,不仅使双方的效用最大,并且最契合用户的偏好,能够很好地解决下一代互联网中支持总最佳连接的切换决策问题. 相似文献
6.
7.
8.
一种面向公平保证QoS的WiMAX二级调度方案 总被引:1,自引:0,他引:1
IEEE 802.16作为全球微波接入互操作系统技术标准,虽然定义了5类信流(分别是UGS,rtPS,ertPS,nrtPS和BE),并将服务质量支持机制引入媒体接入控制层,却没有规定相应的调度算法.为有效保证各种多媒体通信的服务质量,提出了一种基于正交频分多址接入技术和自适应调制编码机制的二级调度方案.该调度方案采用跨层设计思想,适用于PMP WiMAX网络下行链路中.一级调度器按照QoS优先级顺序调度位于不同类型缓存器的队头分组,从而满足rtPS业务的最大时延限定和nrtPS业务的最小速率要求;完成一级调度后,为满足用户速率公平性,二级调度器根据自适应调制编码信息及用户状态信息调度位于不同用户缓存器的队头分组.仿真结果表明该方案能够有效保证各种多媒体通信服务满足QoS要求并兼顾用户速率公平,同时也可获得较高的WiMAX系统吞吐量. 相似文献
9.
将LoRaWAN中的资源分配设定为扩频因子分配和信道分配的优化问题,特别是在LoRaWAN中有大量连接设备的情况下,以保证有限频谱资源的LoRa用户之间的吞吐量公平性。首先,引入匹配理论,将LoRa用户与信道和LoRa用户与扩频因子视为匹配双方,为了最大化它们的效用,提出了一种基于匹配的信道与扩频因子分配算法MSFCAA。然后,以匹配理论为基础,以最大化效用为目标,以最优化网络信道与扩频因子分配为结果,最大限度地提高LoRaWAN中实现的最小信道容量。同时,还提出一种公平传输时间初始化算法,以保证每组参数的吞吐量公平性。仿真结果表明,公平传输时间初始化算法能获得优于其他分配方案的初始分配结果,基于匹配的信道与扩频因子分配算法能显著提升LoRa网络数据提取率并极大降低网络能耗。 相似文献
10.
11.
Traffic conditioners enforce agreements between domains to allow service profiles to conform to subscribers Service Level Agreements. To ensure fairness in the network, these traffic conditioners should allocate bandwidth to subscribers according to their agreed contracted rate and share excess bandwidth in proportion to this agreed rate when the network is over or well provisioned. In instances where the network is under provisioned, the allocation of bandwidth to a subscriber should degrade in proportion to its agreed rate. In this paper a provision aware proportional fair sharing three colour marker is proposed to ensure that these fairness criteria are fulfilled for aggregated flows. Its main contributions are in achieving fairness in under provisioned networks and in the presence of UDP traffic whilst being insensitive to the number of flows in an aggregate. This is demonstrated through a quantitative simulation analysis and also exhibits improved performance over other aggregated approaches, including a recent proposal to provide fairness in under provisioned networks. These results infer that fairness can be achieved by considering the provision of the network in the design of the algorithm, by using separate marking algorithms for TCP and UDP traffic and by using an adaptive factor that mitigates sensitivity to the number of flows in an aggregate. 相似文献
12.
The IEEE 802.16 standard defines mesh mode as one of its two operational modes in medium access control (MAC). In the mesh mode, peer-to-peer communication between subscriber stations (SSs) is allowed, and transmissions can be routed via other SSs across multiple hops. In such an IEEE 802.16 mesh network, accurate and reliable determination of dynamic link capacity and end-to-end capacity of a given multi-hop route is crucial for robust network control and management. The dynamic capacities are difficult to determine in a distributed system due to decentralized packet scheduling and interference between communicating nodes caused by the broadcast nature of radio propagation. In this paper, we first propose a method for computing the dynamic link capacity between two mesh nodes, and extend that to determine the dynamic end-to-end capacity bounds of a multi-hop route based on the concept of Bottleneck Zone. The physical deployments of networks are also considered in the capacity estimation. We demonstrate the effectiveness and accuracy of our methods for computing dynamic link capacity and end-to-end capacity bounds through extensive simulations. 相似文献
13.
针对终端直通(D2D)通信系统中用户的公平性问题,首先对现有的比例公平原则进行扩展,推导出一个与加权和速率有关的优化问题,然后提出了一个最大带权匹配比例公平(KMPF)资源分配算法对其进行优化。该算法通过功率控制最大化用户的加权和速率,并由最大带权匹配(KM)算法按照系统总的加权和速率最大原则为D2D用户分配可以复用的蜂窝用户资源。最后由仿真结果可得,该算法在使得系统公平指数相对于贪婪资源分配算法高出0.4的同时保证系统吞吐量达到其水平的95%以上,而相对于公平性较好的随机资源分配算法,该方案得到的系统吞吐量提高了约50%,说明该算法能在兼顾系统吞吐量的同时解决系统公平性问题。 相似文献
14.
《Journal of Network and Computer Applications》2010,33(4):467-476
This paper investigates variable rate control strategies for real-time multimedia variable bit rate (VBR) services over IEEE 802.16 broadband wireless networks. A data rate control mechanism is derived for the case where the uplink channel provides real-time services and the traffic rate parameter remains constant. This paper shows that the common queuing scheduling algorithms have some bandwidth allocation fairness problems for the real-time polling service (rtPS) in the MAC layer. In other words, the use of a VBR for the rtPS by a WiMAX system results in additional access latency jitter and bandwidth allocation disorder in the transmitted multimedia streams during the regular time interval polling of subscribe stations (SSs) for the contention bandwidth request period. However, the proposed scheduling algorithm solves these SSs contending with bandwidth resource allocation problems based on an extended rtPS (ertPS) of quality-of-service (QoS) pre-programming for a ranging response non-contention polling period. The adopted bandwidth allocation of max–min fairness queue scheduling uses a time constraint condition to transmit real-time multimedia VBR streaming in an IEEE 802.16 broadband wireless environment. In addition, we use the ns-2 simulation tool to compare the capacity of multimedia VBR stream and show that the proposed ertPS scheduling algorithm outperforms other rtPS scheduling algorithms. 相似文献
15.
This paper describes a packet scheduling algorithm for wireless sensor networks (WSNs) that meets the proportional fairness principle. Based on the weighted round-robin strategy, the proposed scheduling algorithm allocates a different service quota to different traffic according to the average packet arrival rate. This guarantees proportional fairness in terms of the average packet delivery delay and the average packet loss ratio. Since the scheduling algorithm does not perform high-load operations such as time stamping and sorting, it can be implemented easily and is suitable for resource-limited WSNs. The proposed scheduling algorithm is tested in a WSN and is found to guarantee the proportional fairness of the average packet delivery delay when this is used as the performance metric, and to realize proportional fairness in the average packet loss ratio when all the queues are overflowing and the average packet loss ratio is used as the performance metric. 相似文献
16.
17.
在协作频谱接入过程中,共享频谱各网络中的频谱需求呈现高度动态性,现有机制难以兼顾分组传输时延和服务公平性。针对这一问题,提出一种基于联合优先级调度的协作动态频谱分配机制。将频谱分配问题建模为比例公平模型并联合网络的服务等级和用频请求的到达时间为各网络设定动态服务优先级,解得分配结果后,基于分配频谱的中心频率与需求频谱的中心频率最近的原则将频谱资源分配给各网络。仿真结果表明,与已有的基于网络固定优先级调度、基于网络动态优先级调度和基于用频请求动态优先级调度的协作频谱分配机制相比,本机制能够更好地保证网络获取频谱的公平性,并且在分组传输时延性能上有所改进。 相似文献
18.
研究网络资源调度优化问题,中继技术是发展网络的关键技术。传统的资源调度算法中,部分比例公平调度(PPF)与两跳比例公平调度(THPF)均有不足,PPF算法能获得较高的系统吞吐率,但不能保证用户的公平性,THPF算法则相反。为了解决系统同时获得吞吐率与用户公平性问题,根据THPF算法设计了一种基于最少好信道优先的两跳比例公平调度算法(S-THPF),通过优先给好信道较少的用户分配信道资源,从而保证尽可能多的用户获得最优的信道。仿真表明算法在提高系统吞吐率的同时能满足用户公平性要求。 相似文献