By Topic

Packet Scheduling in Broadband Wireless Networks Using Neuro-Dynamic Programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Rong Yu ; Dept. of Electron. Eng., Tsinghua Univ., Beijing ; Zhi Sun ; Shunliang Mei

The design of future-generation broadband wireless network introduces a set of challenging technical issues. This paper focuses on the packet scheduling algorithms. The key difficulty of the problem lies in the high variability of wireless channel capacity and the unknown model of packet arrival process. We view the packet scheduling problem as a semi-Markov decision process (SMDP), and approximately solve the problem by using the methodology of neuro-dynamic programming (or reinforcement learning). The proposed algorithm, called neuro-dynamic programming scheduling (NDPS), employs a feature-based linear approximating architecture to produce a near optimal solution of the corresponding SMDP problem. Simulation experiment is carried out to demonstrate that NDPS can simultaneously achieve three performance objectives: (i) QoS differentiation and guarantee, (ii) high bandwidth utilization, and (iii) both short-term and long-term fairness.

Published in:

Vehicular Technology Conference, 2007. VTC2007-Spring. IEEE 65th

Date of Conference:

22-25 April 2007