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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andrews, M.: A Survey of Scheduling Theory in Wireless Networks. In: IMA (Institute for Mathematics and its Applications) summer workshop on wireless communications (2005)
Basar, T., Olsder, G.: Dynamic noncooperative game theory. Academic Press, London (1995)
Bazaraa, M., Jarvis, J., Sherali, H.: Linear Programming and Network Flows. Wiley, Chichester (1990)
Bertsekas, D.: Auction Algorithms. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 128–132 (2009)
Fackler, P.: Compecon Toolbox for Matlab, http://www4.ncsu.edu/~pfackler/compecon/toolbox.html
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)
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)
Heikkinen, T., Hottinen, A.: Distributed scheduling in a Time-Varying Ad hoc Network. Journal of Mobile Multimedia 5(3), 238–254 (2009)
Heikkinen, T.: Distributed Scheduling and Dynamic Pricing in a Communication Network. Wireless Networks 10(3), 233–244 (2004)
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)
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)
Kumaran, K., Qian, L.: Uplink Scheduling in CDMA Packet-Data Systems. Wireless Networks 12, 33–34 (2006)
Osborne, M., Rubinstein, A.: A Course in Game Theory. The MIT Press, Cambridge (1994)
Viswanath, P., Tse, D., Laroia, R.: Opportunistic Beamforming using Dumb Antennas. IEEE Transactions on Information Theory 48(6) (2002)
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)