Skip to main content

A Simplified Fair Scheduling Algorithm for Multiuser MIMO System

  • Conference paper
  • 914 Accesses

Abstract

In this paper, an efficient user scheduling algorithm with fairness is proposed. In the multiuser MIMO system, how to ensure the MIMO multiplexing gain and fairness is a key point. Although the PF algorithm ensures the fairness of the system, the sum-capacity is restricted. We improves the PF algorithm, and achieve a tradeoff between the multiplexing gain and fairness. The simulation results show the proposed algorithm can get the multiplexing gain, ensuring the fairness.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Costa, M.: Writing on dirty paper. IEEE Trans. Inf. Theory. 29(5), 439 (2003)

    MathSciNet  MATH  Google Scholar 

  2. Spencer, Q.H., Swindlehurst, A.L., Haardt, M.: Zero-forcing methods for downlink spatial multiplexing in multiuser MIMO channels. IEEE Trans. Signal Process. 52(4), 461–471 (2004)

    Article  MathSciNet  Google Scholar 

  3. Caire, G., Shamai, S.: On the achievable throughput of a multi-antenna Gussian broadcast channel. IEEE Trans. Inf. Theory 43(7), 1691–1760 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  4. Shen, Z., Chen, R., Andrews, J.G.: Low Complexity User Selection Algorithm for Multiuser MIMO Sysem. IEEE Trans. Signal Process 54(9), 3658–3663 (2006)

    Article  Google Scholar 

  5. Shen, Z., Chen, R., Andrews, J.G.: Sum Capacity of Multiuser MIMO Broadcast Channels with Block Diagonalization. In: IEEE International Symposium, vol. 54(9), pp. 886–890 (2006)

    Google Scholar 

  6. Xiaojie, Z., Jungwoo, L.: Low Complexity Multiuser MIMO Scheduling with Channel Decomposition. In: Fortieh Asilomar Conference on Signals, Systems and Computers, ACSSC 2006, pp. 641–645 (2006)

    Google Scholar 

  7. Yoo, T., Goldsmith, A.: On the Optimality of Multiantenna Broadcast Scheduling Using Zero-Forcing Beamforming. IEEE Journal on Selected Areas in Communications 24(3), 528–541 (2006)

    Article  Google Scholar 

  8. Viswanath, P., Tse, D.N.C., Laroia, R.: Opportunistic beamforming using dumb antennas. IEEE Trans. Inf. Theory. 48(6), 1277–1294 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  9. Viswanath, H., Venkatesan, S., Huang, H.: Downlink capacity evaluation of cellular networks with kown-interference cancellation. IEEE J. Sel.Areas Commun. 21(6), 802–811 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Shen, Z., Fu, D., Jin, F. (2012). A Simplified Fair Scheduling Algorithm for Multiuser MIMO System. In: Ren, P., Zhang, C., Liu, X., Liu, P., Ci, S. (eds) Wireless Internet. WICON 2011. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 98. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30493-4_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30493-4_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30492-7

  • Online ISBN: 978-3-642-30493-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics