小无线网络中基于BLUF的包调度算法

Wireless packet scheduling algorithm based on BLUF in wireless networks

在无线网络的多用户资源分配中,一个重要的问题就是设计高效的调度算法来保证用户的公平性,并充分利用有限资源和保证用户服务质量要求。提出一种基于缓冲区长度效用函数的多用户包调度(BLUF)算法,该算法充分考虑无线信道的时变特性,用缓冲区长度的效用函数来表示调度的服务质量需求的紧急程度,用户当前信道速率与其获得的平均信道速率的比值表示用户公平性和系统效率的权衡程度。仿真结果表明,与存在的比例公平性无线包调度(PFS)算法相比,BLUF算法能够保证实时任务的时延需求的前提下,获得更好的公平性、系统吞吐量等性能。

Designing effective algorithm to satisfy QoS and fineness of users is an important problem in resource allocation for multi-user of wireless networks,while making full use of the limited resource.In this paper,we propose a multi-user wireless packet scheduling algorithm based on Buffer-Length-Utility Function （BLUF）,namely BLUF algorithm.The algorithm uses the BLUF as a scheduling urgency factor and the relative status of the current channel to the average channel status as an efficiency indicator of resource usage and fineness by taking channel＇s time-varying property into full consideration.The simulation study shows that the algorithm is able to give better throughput and fairness than existing algorithms such as Proportional Fair Scheduling（PFS）,while satisfying the time-delay of RT traffics.