A state action frequency approach to throughput maximization over uncertain wireless channels
暂无分享,去创建一个
Eytan Modiano | Shie Mannor | Ishai Menache | Krishna P. Jagannathan | Shie Mannor | Ishai Menache | K. Jagannathan | E. Modiano
[1] Michael J. Neely,et al. Exploiting channel memory for multi-user wireless scheduling without channel measurement: Capacity regions and algorithms , 2010, 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.
[2] P. Whittle. Restless bandits: activity allocation in a changing world , 1988, Journal of Applied Probability.
[3] Anthony Ephremides,et al. A cross-layer approach for stable throughput maximization under channel state uncertainty , 2009, Wirel. Networks.
[4] Krishna P. Jagannathan. Asymptotic performance of queue length based network control policies , 2010 .
[5] Anthony Ephremides,et al. Joint Scheduling and Routing for Ad-hoc Networks Under Channel State Uncertainty , 2007, 2007 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops.
[6] John N. Tsitsiklis,et al. Introduction to linear optimization , 1997, Athena scientific optimization and computation series.
[7] Qing Zhao,et al. Indexability of Restless Bandit Problems and Optimality of Whittle Index for Dynamic Multichannel Access , 2008, IEEE Transactions on Information Theory.
[8] Javier de Frutos,et al. Approximation of Dynamic Programs , 2012 .
[9] Aditya Gopalan,et al. On Wireless Scheduling With Partial Channel-State Information , 2012, IEEE Transactions on Information Theory.
[10] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[11] Mingyan Liu,et al. Optimality of Myopic Sensing in Multi-Channel Opportunistic Access , 2008, 2008 IEEE International Conference on Communications.
[12] Ward Whitt,et al. Approximations of Dynamic Programs, I , 1978, Math. Oper. Res..
[13] Lei Ying,et al. Scheduling in Mobile Ad Hoc Networks With Topology and Channel-State Uncertainty , 2012, IEEE Trans. Autom. Control..
[14] Leandros Tassiulas,et al. Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.
[15] 丸山 徹. Convex Analysisの二,三の進展について , 1977 .
[16] Ward Whitt,et al. Approximations of Dynamic Programs, II , 1979, Math. Oper. Res..
[17] E. Altman. Constrained Markov Decision Processes , 1999 .
[18] John N. Tsitsiklis,et al. On the Empirical State-Action Frequencies in Markov Decision Processes Under General Policies , 2005, Math. Oper. Res..
[19] Michael J. Neely,et al. On Achievable Network Capacity and Throughput-Achieving Policies over Markov ON/OFF Channels , 2010, arXiv.org.
[20] Lei Ying,et al. Scheduling in Mobile Ad Hoc Networks With Topology and Channel-State Uncertainty , 2012, IEEE Transactions on Automatic Control.
[21] Eytan Modiano,et al. Dynamic power allocation and routing for time-varying wireless networks , 2005 .