Skip to main content

Multiuser Scheduling via Dynamic Optimization

  • Conference paper
Wired/Wireless Internet Communications (WWIC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 6074))

Included in the following conference series:

  • 1219 Accesses

Abstract

This paper studies optimal scheduling in a multiuser wireless network, allowing for simultaneous transmission of sets of users. The approach is based on dynamic optimization. The multiuser scheduling problem is solved numerically as a dynamic programming problem with user-specific power constraints, assuming deterministic channel information during a given scheduling window. The dynamic programming approach enables to solve for both an optimal discrete power allocation and scheduling. Numerical examples suggest that previous results on optimal scheduling based on decomposing a T-period scheduling problem to T separate problems do not hold in general when decomposing the problem to a smaller number of larger problems. An auction-based algorithm for distributed scheduling is proposed, achieving an optimal schedule, assuming one-at-a-time transmission.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andrews, M.: A Survey of Scheduling Theory in Wireless Networks. In: IMA (Institute for Mathematics and its Applications) summer workshop on wireless communications (2005)

    Google Scholar 

  2. Basar, T., Olsder, G.: Dynamic noncooperative game theory. Academic Press, London (1995)

    MATH  Google Scholar 

  3. Bazaraa, M., Jarvis, J., Sherali, H.: Linear Programming and Network Flows. Wiley, Chichester (1990)

    MATH  Google Scholar 

  4. Bertsekas, D.: Auction Algorithms. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 128–132 (2009)

    Google Scholar 

  5. Fackler, P.: Compecon Toolbox for Matlab, http://www4.ncsu.edu/~pfackler/compecon/toolbox.html

  6. Han, S., Kim, H., Han, Y.: Distributed Utility Maximization using a Resource Pricing Power Control in Uplink DS-CDMA. IEEE Communication Letters 12(4), 286–288 (2008)

    Article  MathSciNet  Google Scholar 

  7. Heikkinen, T., Hottinen, A.: Distributed Scheduling via Pricing with Partial Orthogonality. In: Proc. 6th International Conference on Advances in Mobile Computing and Multimedia (MoMM 2008), Linz, Austria, November 2008, pp. 248–253 (2008)

    Google Scholar 

  8. Heikkinen, T., Hottinen, A.: Distributed scheduling in a Time-Varying Ad hoc Network. Journal of Mobile Multimedia 5(3), 238–254 (2009)

    Google Scholar 

  9. Heikkinen, T.: Distributed Scheduling and Dynamic Pricing in a Communication Network. Wireless Networks 10(3), 233–244 (2004)

    Article  Google Scholar 

  10. Hottinen, A., Viterbo, E., Heikkinen, T.: Device Collaboration in ad-hoc MIMO Networks. In: Proc. International ITG Workshop on Smart Antennas (WSA), Berlin, Germany, February 16-18 (2009)

    Google Scholar 

  11. Kulkarni, S., Rosenberg, C.: Opportunistic scheduling policies for wireless systems with short term fairness constraints. In: Proc. GLOBECOM 2003 - IEEE Global Telecommunications Conference, December 2003, vol. (1), pp. 533–537 (2003)

    Google Scholar 

  12. Kumaran, K., Qian, L.: Uplink Scheduling in CDMA Packet-Data Systems. Wireless Networks 12, 33–34 (2006)

    Article  Google Scholar 

  13. Osborne, M., Rubinstein, A.: A Course in Game Theory. The MIT Press, Cambridge (1994)

    Google Scholar 

  14. Viswanath, P., Tse, D., Laroia, R.: Opportunistic Beamforming using Dumb Antennas. IEEE Transactions on Information Theory 48(6) (2002)

    Google Scholar 

  15. Yang, K., Prasad, N., Wang, X.: An Auction Approach to Resource Allocation in Uplink Multi-Cell OFDMA Systems. In: Proceedings of the Global Communications Conference, GLOBECOM 2008, New Orleans, LA, USA, November 30-December 4 (2008)

    Google Scholar 

  16. Zheng, D., Ge, W., Zhang, J.: Distributed Opportunistic Scheduling for Ad Hoc Networks with Random Access: An Optimal Stopping Approach. IEEE Tr. on Information Theory 55, 205–222 (2009)

    Article  MathSciNet  Google Scholar 

  17. Zhu, H., Tang, Y., Chlamtac, I.: Unified Collision-Free Coordinated Distributed Scheduling (CF-CDS) in IEEE 802.16 Mesh Networks. IEEE Tr. on Wireless Communications 7(10), 3889–3903 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heikkinen, T. (2010). Multiuser Scheduling via Dynamic Optimization. In: Osipov, E., Kassler, A., Bohnert, T.M., Masip-Bruin, X. (eds) Wired/Wireless Internet Communications. WWIC 2010. Lecture Notes in Computer Science, vol 6074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13315-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13315-2_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13314-5

  • Online ISBN: 978-3-642-13315-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics