By Topic

Scheduling algorithms for downlink services in wireless networks: a Markov decision process approach

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
$33 $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

4 Author(s)
W. A. Massey ; Eng. Quadrangle, Princeton Univ., NJ, USA ; K. G. Ramakrisluian ; M. Aravamudan ; G. Pai

We model the scheduling of emerging wireless data services as a Markov decision process. These services are characterized by real-time downlink data transfers such as those needed for personalized traffic, weather and business updates. Characterizing each differing service by its own time-criticality as well as reward and penalty values, we can numerically compute an optimal Markov decision scheduling rule for serving these requests. These computations suggest that we can formulate a simple near optimal rule for scheduling these services efficiently.

Published in:

Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE  (Volume:6 )

Date of Conference:

29 Nov.-3 Dec. 2004