Queue-aware dynamic clustering and ower allocation for network MIMO systems via distributed stochastic learning

IEEE Transactions on Signal Processing

Volumn 59, Issue 3, 2011, Pages 1229-1238

  Cui, Ying ^a   Huang, Qingqing ^a   Lau, Vincent K N ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

delay optimal; distributed stochastic learning; dynamic clustering; interference game; Network MIMO

Indexed keywords

DELAY-OPTIMAL; DISTRIBUTED STOCHASTIC LEARNING; DYNAMIC CLUSTERING; INTERFERENCE GAME; NETWORK MIMO;

BEAMFORMING; CLUSTERING ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONTROLLERS; DECODING; E-LEARNING; LEARNING ALGORITHMS; MARKOV PROCESSES; MIMO SYSTEMS; OPTIMIZATION; Q FACTOR MEASUREMENT; QUEUEING THEORY; STOCHASTIC SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 79951641329     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2010.2097253     Document Type: Article

References (18)

1. F. Boccardi and H. Huang, "Limited downlink network coordination in cellular networks," in IEEE Int. Symp. Pers., Indoor and Mobile Radio Commun. (PIMRC), Athens, Greece, Sep. 2007, pp. 1-5.
2. J. Zhang, R. Chen, J. G. Andrews, A. Ghosh, and R. W. Heath, "Networked MIMO with clustered linear precoding," IEEE. Trans Wireless Commun., vol. 8, no. 4, pp. 1910-1921, Apr. 2009.
3. F. Boccardi, H. Huang, and A. Alexiou, "Network MIMO with reduced backhaul requirements by mac coordination," in Proc. Asilomar Conf. Signals, Syst. Comput. (ACSSC), CA, Oct. 2008, pp. 1125-1129.
4. A. Papadogiannis, D. Gesbert, and E. Hardouin, "A dynamic clustering approach in wireless networks with multi-cell cooperative processing," in Proc. IEEE Int. Conf. Commun. (ICC), Beijing, China, May 2008, pp. 4033-4037.
5. D. P. Bertsekas, Dynamic Programming and Optimal Control, 3rd ed. Cambridge, MA: Athena Scientific, 2007.
6. W. B. Powell, Approximate Dynamic Programming: Solving the Curses of Dimensionality, 1st ed. London, U.K.:Wiley-Interscience, 2007.
7. D. P. Palomar and M. Chiang, "A tutorial on decomposition methods for network utility maximization," IEEE J. Sel. Areas Commun., vol. 24, no. 8, pp. 1439-1451, Aug. 2006.
8. J. Tsitsiklis, "Np-hardness of checking the unichain condition in average cost mdps," Operat. Res. Lett., vol. 35, no. 3, pp. 319-323, May 2007. (Pubitemid 46589660)
9. V. S. Borkar, "An actor-critic algorithm for constrained Markov decision processes," in Syst. Contr. Lett., 2005, vol. 54, pp. 207-213. (Pubitemid 40183502)
10. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
11. Y. Cui, Q. Huang, and V. K. N. Lau, "Queue-aware dynamic clustering and power allocation for network MIMO systems via distributed stochastic learning" [Online]. Available: http://arxiv.org/abs/1012.3877
12. D. Bertsekas and J. Tsitsiklis, Neuro-Dynamic Programming: An Overview. Nashua, NH: Athena Scientific, 1996.
13. X. R. Cao, Stochastic Learning and Optimization: A Sensitivity-Based Approach, 1st ed. New York: Springer, 2007.
14. J. Abounadi, D. Bertsekas, and V. S. Borkar, "Learning algorithms for Markov decision processes with average cost," SIAM J. Contr. Optimiz., vol. 40, no. 3, pp. 681-698, 2001.
15. V. S. Borkar, Stochastic Approximation: A Dynamical Systems Viewpoints, 1st ed. Cambridge, U.K.: Cambridge Univ. Press, 2008, ch. 6.
16. V. S. Borkar, "Stochastic approximation with two time scales," Syst. Contr. Lett., vol. 29, pp. 291-294, 1997. (Pubitemid 127666634)
17. G. Scutari, D. P. Palomar, and S. Barbarossa, "Competitive design of multiuser MIMO systems based on game theory:A unified view," IEEE J. Sel. Areas Commun., vol. 26, no. 7, Sep. 2008.
18. J. N. Tsitsiklis and B. V. Roy, "Feature-based methods for large scale dynamic programming," Mach. Learn., vol. 22, Mar. 1996.