ZTE

ZTE Communications ›› 2009, Vol. 7 ›› Issue (4): 45-48.

• Research Paper • Previous Articles     Next Articles

Packet Scheduling Algorithm for Real-Time Services in Broadband WMAN

Zhang Hanyi, Su Xin   

  1. Wireless and Mobile Communication Technology R&D Center of Tsinghua University , Tsinghua National Laboratory for Information Science and Technology , Beijing 100084 , China
  • Online:2009-12-25 Published:2020-03-03
  • About author:Zhang Hanyi is a master degree candidate at the Wireless and Mobile Communication Technology R&D Center of Tsinghua University. He is mainly engaged in the research and standardization of broadband WMANs and next-generation wireless communication technologies

    Su Xin, PhD, is the deputy director of the Wireless and Mobile Communication Technology R&D Center of Tsinghua University. He is also the deputy group leader of B3G Workgroup (WG6) of Wireless Communication Technology Committee of China Communications Standards Association, leader of IMT-Advanced Promotion Group of the MIIT of China, and a member of IEEE Communications Society. He has long been engaged in the research of mobile communications, software defined radio and broadband wireless access, and has undertaken several national- and ministry-level scientific ▲ research projects.
  • Supported by:
    This work was funded by the National High Technology Research and Development Program (“863” Program) of China under Grant No. 2007AA01Z289.

PDF (PC)

Abstract: Packet scheduling algorithm is the key technology to guarantee Quality of Service (QoS ) and balance the fairness between users in broadband Wireless Metropolitan Area Network (WMAN ). Based on the research of Proportional Fairness (PF ) algorithm and Modified Largest Weighted Delay First (M-LWDF ) algorithm, a new packet scheduling algorithm for real-time services in broadband WMAN, called Enhanced M-LWDF (EM-LWDF ), was proposed. The algorithm phases in new information to measure the load of service queues and updates the state parameters in real-time way, which remarkably improves system performance.Simulation results show that comparing with M-LWDF algorithm, the proposed algorithm is advantageous in performances of queuing delay and fairness while guaranteeing system throughput.