Skip to main navigation Skip to search Skip to main content

A novel multi-radio packet scheduling algorithm for real-time traffic on generic link layer

  • Yang Cui*
  • , Yubin Xu
  • , Xuejun Sha
  • , Rongqing Xu
  • , Zhe Ding
  • *Corresponding author for this work
  • Harbin Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, a novel multi-radio packet scheduling algorithm, QU, is proposed for real-time traffic on generic link layer (GLL). First, a scheduling-utility function is designed to represent the utility of scheduling a packet to a radio access with the goal to guarantee QoS and improve spectrum utilization. Second, using this utility function, a multi-radio packet scheduling model is presented based on joint consideration of QoS, fairness and spectrum efficiency, while the solution for this model is NP problem; Finally, Hopfield neural network (HNN) is used to fast and efficiently find an optimal solution for the scheduling model. Simulation results show that, compared with M-LWDF and PLR algorithms, QU algorithm has lower packet loss ratio and higher spectrum efficiency while could meet the allowable maximum delay requirement.

Original languageEnglish
Title of host publication2009 15th Asia-Pacific Conference on Communications, APCC 2009
Pages122-125
Number of pages4
DOIs
StatePublished - 2009
Event2009 15th Asia-Pacific Conference on Communications, APCC 2009 - Shanghai, China
Duration: 8 Oct 200910 Oct 2009

Publication series

Name2009 15th Asia-Pacific Conference on Communications, APCC 2009

Conference

Conference2009 15th Asia-Pacific Conference on Communications, APCC 2009
Country/TerritoryChina
CityShanghai
Period8/10/0910/10/09

Keywords

  • GLL
  • HNN
  • Multi-radio packet scheduling algorithm
  • Scheduling-utility

Fingerprint

Dive into the research topics of 'A novel multi-radio packet scheduling algorithm for real-time traffic on generic link layer'. Together they form a unique fingerprint.

Cite this