为保证正交频分复用中继系统中混合业务的QoS要求，提出相对最长队列优先/相对比例公平的调度算法R-LQAF/RPF. 根据实时用户的速率需求引入相对变化函数，并利用RPF算法提高实时业务用户的吞吐量.同时根据用户队列长度和系统队列长的关系，采用R-LQAF算法降低用户丢包率，保证了非实时用户的QoS满意
度. 仿真结果表明，与比例公平和最大加权时延优先算法相比较，R-LQAF/RPF算法不仅能针对不同业务采取不同的调度策略，而且对用户吞吐量、速率需求满意度、丢包率性能均有所提升，充分保证了混合业务的QoS要求.
To ensure QoS requirements for mixed-service in an orthogonal frequency division multiplexing relay system, we propose a relative largest queue aware first/relative proportional fair (R-LQAF/RPF) scheduling algorithm. By setting a relative variation function, we use an RPF scheduling algorithm to enhance the
realtime user throughput to meet the actual user rate requirements. We also use an R-LQAF scheduling algorithm to improve the scheduling performance, decrease the packet loss rate, and ensure QoS requirements for non-realtime user according to the relationship of the user queue length and the system queue length.Simulation results show that, compared with the existing proportional fair and the largest weighted delay first algorithm, the R-LQAF/RPF algorithm can flexibly choose different scheduling strategies for different businesses, effectively improve user performances in terms of throughput, packet loss rate, and satisfaction of demanded rate, and guarantee QoS requirements of mixed businesses.
[1] Lin X, CUTHBERT L.A two-hop proportional fairness scheduling algorithm for relay based OFDMA systems[C]//WiCOM'08.4 International Conference on Wire- less Communications,Beijing: 2008:165-168.
[2] BYUNG G K, JANG W L. Joint opportunistic subchannel and power scheduling for relay-based OFDMA networks with scheduling at relay stations[J].IEEE Transactions on VehicularTechnology, 2010, 59(5):2138-2148.
[3] NG D W K, SCHOBER R. Resource allocation and scheduling in multi-cell OFDMA systems with decode-and-forward relaying[J]. IEEE Transactions onWireless Communications, 2011, 10(7): 2246- 2258.
[4] ANDREWS M, KUMARAN K, RAMANA N K. Providing quality of service over a shared wireless link[J]. IEEE Communications Magazine, 2001, 39(2): 150-154.
[5] KAE W C,WHA S J , DONG G J .Resource allocation in OFDMA wireless communications systems supporting multimedia services[J]. IEEE/ACM on Networking, 2009, 17(3):926-935.
[6] CHANDUR P, KARTHIK R M. Performance evaluation of scheduling algorithms for mobile WiMAX networks[C]// 2012 IEEE International Conference on Pervasive Computing and Communications Workshops, India: 2012:764-769.
[7] SEUNGWAN R, BYUNGHAN R, HYUNHWA S. Urgency and efficiency based packet scheduling algorithm for OFDMA wireless system. in communications[C]//2005 IEEE International Conference onComMunications, Korea,2005: 2779-2785.
[8] RUI Z, HOANG N N, SASASE I. Packet scheduling for cellular networks with relaying to support user QoS and fairness. in wireless communicat ions and networki-Ng [C]// IEEEWireless Communications and Networking Conference(WCNC). Kowloon: 2007: 3896-3900.
[9] CHIYH,AICP.3-Approximatioalgorithm for joint routing and link scheduling in wireless relay networks[J]. IEEE Transactions on Wireless Communications,2009,8(2): 856-861.
[10] 韩智，郭爱煌.中继OFDMA系统混合业务的分步跨层调度算法[J]. 计算机应用研究，2011,(7): 36-39.HAN Zhi, GUO Aihuang. Step-by-step cross-layer scheduling algorithm for mixed servic-ees in relay OFDMA system[J]. Application Research of Computers, 2011,(7): 36-39.(in Chinese)
[11] KAUSAR R.,CHENY,CHAI K K. Adaptive time domain scheduling algorithm for OFDMA based LTE-advanced networks[C]//2011 IEEE 7th International Conferen-ce on Wireless and Mobile Computing,2011: 476-482.
[12] HUINING H, Performance analysis of cellular networks with digital fixed relays[D]. Canada: Carleton University, 2003:20-40.
[13] RUI W, CUI Y. Decentralized fair schedul-ing in two-hop relay-assisted cognitive OFDMA systems[J]. IEEE Journal of Selected Topics in Signal Processing,2011,5(1): 171-181.
[14] FOUAD Y M M. An autonomous resource block assignment scheme for OFDMA-based relay-assisted cellular networks [J]. IEEE Transactions on Wireless Communications, 2012,11(2): 637-647.
[15] DANHUA Z. Dynamic resource allocation for real-time services in cooperative OFDMA systems [J]. IEEE CommunicationsLetters, 2011, 15(5):497-499.
