Massive MIMO Scheduling Protocols

doi:10.1017/9781316771655.016

15 - Massive MIMO Scheduling Protocols

from Part III - Network Protocols, Algorithms, and Design

Published online by Cambridge University Press: 28 April 2017

Giuseppe Caire

Edited by

Vincent W. S. Wong ,

Robert Schober ,

Derrick Wing Kwan Ng and

Li-Chun Wang

Show author details

Giuseppe Caire: Affiliation:
Technical University of Berlin, Germany
Vincent W. S. Wong: Affiliation:
University of British Columbia, Vancouver
Robert Schober: Affiliation:
Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany
Derrick Wing Kwan Ng: Affiliation:
University of New South Wales, Sydney
Li-Chun Wang: Affiliation:
National Chiao Tung University, Taiwan

Book contents

Get access

Summary

In this chapter, we present a general approach to data-oriented downlink scheduling in a wireless network, possibly formed from multiple base stations and users. Following commonly used acronyms, base stations will be denoted by “BS” (base station) and user devices by “UE” (user equipment). Specifically, we consider the case where the BSs have a large number of antennas and serve a given number of downlink data streams using multiuser multiple-input multiple-output (MIMO) spatial multiplexing. When the number of antennas is large and is significantly larger than the number of downlink data streams, such systems are referred to as “massive MIMO.” As we shall see, a network operating in the massive MIMO regime has several advantages, not only in terms of achievable spectral efficiency per cell but also in terms of simplified signal processing, rate allocation, and user scheduling. This nontrivial system simplification is due to the fact that the large number of antennas and not-so-large number of simultaneously transmitted data streams has the consequence that the signal-to-interference-plus-noise ratio (SINR) at each UE becomes an almost deterministic quantity that depends only on the distance-dependent path loss and large-scale fading (shadowing) of the propagation channel between the UE and the serving BS, and not on the small-scale multipath fading. Since distance-dependent path loss and shadowing are relatively slowly varying in time and frequency nonselective, in contrast to the time- and frequency-selective small-scale fading, it follows that the scheduling protocol can learn quite accurately the rate at which each user can be served from each BS. Based on this knowledge, a scheduling protocol can decide dynamically which subset of users should be served from which BS. In this chapter, we will see how such a dynamic scheduling policy with given optimality performance guarantees can be systematically designed.

Introduction

Wireless data traffic has grown dramatically in recent years. Unlike traditional voice-oriented interactive communications, wireless data is typically asymmetric (the downlink traffic is much higher than the uplink traffic) and more delay tolerant. For example, a typical killer application is represented by on-demand video streaming, which is predicted to account for 75% of the total mobile data traffic by 2019 [1]. The streaming process requires that video frames arrive at the receiver within their playback deadlines.

Information

Type: Chapter
Information: Key Technologies for 5G Wireless Systems , pp. 335 - 357

DOI: https://doi.org/10.1017/9781316771655.016 [Opens in a new window]

Publisher: Cambridge University Press

Print publication year: 2017

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Book purchase

Temporarily unavailable

References

[1] Cisco, “Cisco visual networking index: Global mobile data traffic forecast update, 2015–2020,” Tech. Rep., Feb. 2016. Available at http://goo.gl/1XYhqY.

[2] DASH Industry Forum, “MPEG DASH standard.” Available at http://mpeg.chiariglione.org/standards/mpeg-dash.

[3] A., Begen, T., Akgul, and M., Baugher, “Watching video over the web: Part 1: Streaming protocols,” IEEE Internet Comput., vol. 15, no. 2, pp. 54–63, Mar. 2011.Google Scholar

[4] Y., Sánchez, T., Schierl, C., Hellge, T., Wiegand, D., Hong, D., De Vleeschauwer, W., Van Leekwijck, and Y., Lelouedec, “iDASH: Improved dynamic adaptive streaming over http using scalable video coding,” in Proc. of ACM Multimedia Systems Conf. (MMSys), Feb. 2011.

[5] A. F., Molisch, Wireless Communications, 2nd edn, Wiley, 2011.

[6] T. L., Marzetta, “Noncooperative cellular wireless with unlimited numbers of base station antennas,” IEEE Trans. Wireless Commun., vol. 9, no. 11, pp. 3590–3600, Nov. 2010.Google Scholar

[7] Z., Wang, A. C., Bovik, H. R., Sheikh, and E. P., Simoncelli, “Image quality assessment: From error visibility to structural similarity,” IEEE Trans. Image Process., vol. 13, no. 4, pp. 600–612, Apr. 2004.Google Scholar

[8] M. J., Neely, “Wireless peer-to-peer scheduling in mobile networks,” in Proc. of Conf. on Information Sciences and Systems (CISS), Mar. 2012.

[9] M., Neely, “Stochastic network optimization with application to communication and queueing systems,” Synth. Lect. Commun. Netw., vol. 3, no. 1, pp. 1–211, 2010.Google Scholar

[10] J., Mo and J., Walrand, “Fair end-to-end window-based congestion control,” IEEE/ACM Trans. Netw., vol. 8, no. 5, pp. 556–567, Oct. 2000.Google Scholar

[11] D., Bethanabhotla, G., Caire, and M. J., Neely, “Adaptive video streaming for wireless networks with multiple users and helpers,” IEEE Trans. Commun., vol. 63, no. 1, pp. 268–285, Jan. 2015.Google Scholar

[12] M., Neely, “Universal scheduling for networks with arbitrary traffic, channels, and mobility,” in Proc. of IEEE Conf. on Decision and Control (CDC), Dec. 2010.

[13] A., Eryilmaz and R., Srikant, “Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control,” in Proc. of IEEE International. Conf. on Computer Communications (INFOCOM), Mar. 2005.

[14] D., Bethanabhotla, G., Caire, and M., Neely, “WiFlix: Adaptive video streaming in massive MU-MIMO wireless networks,” IEEE Trans. Wireless Commun., vol. 15, no. 6, pp. 4088–4103, Jun. 2016.Google Scholar

[15] H., Huh, G., Caire, H., Papadopoulos, and S., Ramprashad, “Achieving massive MIMO spectral efficiency with a not-so-large number of antennas,” IEEE Trans. Wireless Commun., vol. 11, no. 9, pp. 3226–3239, Sep. 2012.Google Scholar

[16] J., Hoydis, S., Ten Brink, and M., Debbah, “Massive MIMO in the UL/DL of cellular networks: How many antennas do we need?” IEEE J. Sel. Areas Commun., vol. 31, no. 2, pp. 160–171, Feb. 2013.Google Scholar

[17] A., Tulino and S., Verdú, Random Matrix Theory and Wireless Communications, NOW Publishers, 2004.

[18] R., Couillet and M., Debbah, Random Matrix Methods for Wireless Communications, Cambridge University Press, 2011.

[19] D., Bethanabhotla, O. Y., Bursalioglu, H. C., Papadopoulos, and G., Caire, “Optimal user-cell association for massiveMIMO wireless networks,” IEEE Trans. Wireless Commun., vol. 15, no. 3, pp. 1835–1850, Mar. 2016.Google Scholar

[20] H., Huh, A. M., Tulino, and G., Caire, “Network MIMO with linear zero-forcing beamforming: Large system analysis, impact of channel estimation, and reduced-complexity scheduling,” IEEE Trans. Inf. Theory, vol. 58, no. 5, pp. 2911–2934, May 2012.Google Scholar

[21] Y., Lim, C., Chae, and G., Caire, “Performance analysis of massive MIMO for cell-boundary users,” IEEE Trans. Wireless Commun., vol. 14, no. 12, pp. 6827–6842, Dec. 2015.Google Scholar

[22] B., Hassibi and B. M., Hochwald, “How much training is needed in multiple-antenna wireless links?” IEEE Trans. Inf. Theory, vol. 49, no. 4, pp. 951–963, Apr. 2003.Google Scholar

[23] A., Adhikary, J., Nam, J. Y., Ahn, and G., Caire, “Joint spatial division and multiplexing the large-scale array regime,” IEEE Trans. Inf. Theory, vol. 59, no. 10, pp. 6441–6463, Oct. 2013.Google Scholar

[24] J., Nam, A., Adhikary, J. Y., Ahn, and G., Caire, “Joint spatial division and multiplexing: Opportunistic beamforming, user grouping and simplified downlink scheduling,” IEEE J. Sel. Top. Signal Process., vol. 8, no. 5, pp. 876–890, Oct. 2014.Google Scholar

[25] A., Adhikary, E., Al Safadi, M. K., Samimi, R., Wang, G., Caire, T. S., Rappaport, and A. F., Molisch, “Joint spatial division and multiplexing for mm-Wave channels,” IEEE J. Sel. Areas Commun., vol. 32, no. 6, pp. 1239–1255, Jun. 2014.Google Scholar

[26] H., Yin, D., Gesbert, M., Filippou, and Y., Liu, “A coordinated approach to channel estimation in large-scale multiple-antenna systems,” IEEE J. Sel. Areas Commun., vol. 31, no. 2, pp. 264–273, Feb. 2013.Google Scholar

[27] S., Wagner, R., Couillet, M., Debbah, and D., Slock, “Large system analysis of linear precoding in correlated MISO broadcast channels under limited feedback,” IEEE Trans. Inf. Theory, vol. 58, no. 7, pp. 4509–4537, Jul. 2012.Google Scholar

[28] T., Yoo and A., Goldsmith, “On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming,” IEEE J. Sel. Areas Commun., vol. 24, no. 3, pp. 528–541, Mar. 2006.Google Scholar

[29] xiph.org, “Xiph.org video test media.” Availabel at http://media.xiph.org/video/derf/.

[30] Z., Wang, A. C., Bovik, H. R., Sheikh, and E. P., Simoncelli, “The SSIM index for image quality assessment.” Available at http://goo.gl/ngR0UL.

Accessibility standard: Unknown

Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.