Opportunistic fair scheduling in wireless networks: An approximate dynamic programming approach

Mobile Networks and Applications

Volumn 15, Issue 5, 2010, Pages 710-728

  Zhang, Zhi ^a   Moola, Sudhir ^a   Chong, Edwin K P ^a  

^a Department of Mechanical Engineering   (United States)

Author keywords

approximate dynamic programming; fairness; Markov decision process; resource allocation; scheduling; stochastic approximation; wireless networks

Indexed keywords

APPROXIMATE DYNAMIC PROGRAMMING; APPROXIMATION METHODS; AVERAGE REWARD; CONTROL PARAMETERS; DATA TRANSMISSION; DELAY MINIMIZATION PROBLEMS; DISCOUNTED REWARD; FAIR SCHEDULING; FAIRNESS; FAIRNESS CONSTRAINTS; INFINITE HORIZONS; MARKOV DECISION PROCESSES; NUMERICAL RESULTS; OPPORTUNISTIC FAIR SCHEDULING; OPTIMALITY EQUATION; PERFORMANCE IMPROVEMENTS; STOCHASTIC APPROXIMATIONS; THROUGHPUT MAXIMIZATION; THROUGHPUT MAXIMIZATION PROBLEM; TRANSMISSION SCHEDULING; WIRELESS HETEROGENEOUS NETWORK;

APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; CONTROL SYSTEM ANALYSIS; HETEROGENEOUS NETWORKS; MARKOV PROCESSES; OPTIMIZATION; RESOURCE ALLOCATION; STOCHASTIC SYSTEMS; WIRELESS NETWORKS;

DYNAMIC PROGRAMMING;

EID: 84755160819     PISSN: 1383469X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11036-009-0198-x     Document Type: Article

References (34)

1. Zhang Z, Moola S, Chong EKP (2008) Approximate stochastic dynamic programming for opportunistic fair scheduling in wireless networks. In: Proc. 47th IEEE conference on decision and control, Cancun, 9-11 December 2008, pp 1404-1409
2. Knopp R, Humblet P (1995) Information capacity and power control in single cell multiuser communications. In: Proc. IEEE int. conference on communications 1995, vol 1, pp 331-335
3. M Andrews K Kumaran K Ramanan A Stolyar P Whiting R Vijayakumar 2001 Providing quality of service over a shared wireless link IEEE Commun Mag 39 2 150 153 10.1109/35.900644 (Pubitemid 32252227)
4. P Bender P Black M Grob R Padovani N Sindhushyana A Viterbi 2000 Cdma/hdr: a bandwidth-efficient high-speed wireless data service for nomadic users IEEE Commun Mag 38 7 70 77 10.1109/35.852034
5. Andrews M (2005) A survey of scheduling theory in wireless data networks. In: Proc. 2005 IMA summer workshop on wireless communications
6. Parkvall S, Dahlman E, Frenger P, Beming P, Persson M (2001) The high speed packet data evolution of wcdma. In: Proc. IEEE VTC 2001, vol 3, pp 2287-2291
7. X Liu EKP Chong NB Shroff 2001 Opportunistic transmission scheduling with resource-sharing constraints in wireless networks IEEE J Sel Areas Commun 19 10 2053 2064 10.1109/49.957318 (Pubitemid 33068000)
8. X Liu EKP Chong NB Shroff 2003 A framework for opportunistic scheduling in wireless networks Comput Netw 41 4 451 474 1056.68050 10.1016/S1389-1286(02) 00401-2
9. X Liu EKP Chong NB Shroff 2004 Opportunistic scheduling: an illustration of cross-layer design Telecommun Rev 14 6 947 959
10. HS Wang N Moayeri 1995 Finite-state markov channel-a useful model for radio communication channels IEEE Trans Veh Technol 43 163 171 10.1109/25.350282
11. F Kelly 1997 Charging and rate control for elastic traffic Eur Trans Telecommun 8 33 37 10.1002/ett.4460080106
12. Puterman ML (1994) Markov decision processes. Wiley, New York
13. Bertsekas DP (2001) Dynamic programming and optimal control, 2nd ed. Athena, Belmont
14. Ross SM (1970) Applied probability models with optimization applications. Dover, New York
15. Derman C (1970) Finite sate Markovian decision processes. Academic, New York
16. Altman E (1998) Constrained Markov decision processes. Chapman and Hall/CRC, London
17. Piunovskiy AB (1997) Optimal control of random sequences in problems with constraints. Kluwer, Dordrecht
18. Feinberg EA, Shwartz A (eds) (2002) Handbook of Markov decision processes: methods and applications. Kluwer, Boston
19. KW Ross 1989 Randomized and past-dependent policies for Markov decision processes with multiple constraints Oper Res 37 3 474 477 0675.90092 10.1287/opre.37.3.474 1000897
20. AB Piunovskiy X Mao 2000 Constrained markovian decision processes: the dynamic programming approach Oper Res Lett 27 119 126 0969.90091 10.1016/S0167-6377(00)00039-0 1797280 (Pubitemid 32033826)
21. RC Chen GL Blankenship 2004 Dynamic programming equations for discounted constrained stochastic control IEEE Trans Automat Contr 49 5 699 709 10.1109/TAC.2004.826725 2057802
22. Bertsekas DP, Tsitsiklis JN (1996) Neuro-dynamic programming. Athena, Belmont
23. DP Bertsekas JN Tsitsiklis C Wu 1997 Rollout algorithms for combinatorial optimization J Heuristics 3 245 262 1071.90571 10.1023/A:1009635226865
24. DP Bertsekas DA Castanon 1999 Rollout algorithms for stochastic scheduling problems J Heuristics 5 1 89 108 0997.90037 10.1023/A:1009634810396
25. Gesbert D, Slim-Alouini M (2004) How much feedback is multi-user diversity really worth? In: Proc. IEEE international conference on communications, pp 234-238
26. Floren F, Edfors O, Molin BA (2003) The effect of feedback quantization on the throughput of a multiuser diversity scheme. In: Proc. IEEE global telecommunication conference (GLOBECOM'03), pp 497-501
27. Svedman P, Wilson S, Cimini LJ Jr., Ottersten B (2004) A simplified opportunistic feedback and scheduling scheme for ofdm. In: Proc. IEEE vehicular technology conference 2004
28. Y Al-Harthi A Tewfik MS Alouini 2007 Multiuser diversity with quantized feedback IEEE Trans Wirel Commun 6 1 330 337 10.1109/TWC.2007.05229 (Pubitemid 46478675)
29. AK Parekh RG Gallager 1993 A generalized processor sharing approach to flow control in integrated services networks: the single-node case IEEE/ACM Trans Netw 1 3 344 357 10.1109/90.234856
30. Kushner HJ, Yin GG (2003) Stochastic approximation and recursive algorithms and applications, 2nd ed. Springer, New York
31. Chen HF (2002) Stochastic approximation and its applications. Kluwer, Dordrecht
32. E Gilbert 1960 Capacity of a burst-noise channel Bell Syst Technol J 39 1253 1265
33. EO Elliott 1963 Estimates of error rates for codes on burst-noise channels Bell Syst Technol 42 1977 1997
34. F Swarts HC Ferreira 1993 Markov characterization of channels with soft decision outputs IEEE Trans Commun 41 678 682 10.1109/26.225482 (Pubitemid 23703958)