Hostname: page-component-cd9895bd7-fscjk Total loading time: 0 Render date: 2024-12-28T01:24:33.619Z Has data issue: false hasContentIssue false

TRANSMISSION RATE CONTROL OVER RANDOMLY VARYING CHANNELS

Published online by Cambridge University Press:  01 January 2005

Gauresh Rajadhyaksha
Affiliation:
Department of Electrical and Computer Engineering, University of Texas, Austin, TX 78712, E-mail: [email protected]
Vivek S. Borkar
Affiliation:
School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai 400005 India, E-mail: [email protected]

Abstract

The problem of controlling transmission rate over a randomly varying channel is cast as a Markov decision process wherein the channel is modeled as a Markov chain. The objective is to minimize a cost that penalizes both buffer occupancy (equivalently, delay) and power. The nature of the optimal policy is characterized using techniques adapted from classical inventory control.

Type
Research Article
Copyright
© 2005 Cambridge University Press

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.)

References

REFERENCES

Berry, R.A. & Gallager, R.G. (2002). Communication over fading channels with delay constraints. IEEE Transactions on Information Theory 48(5): 11351149.Google Scholar
Bertsekas, D.P. (2001). Dynamic programming and optimal control, Vol. 1, 2nd ed. Belmont, MA: Athena Scientific.
Bertsekas, D.P. (2001). Dynamic programming and optimal control, Vol. 2, 2nd ed. Belmont, MA: Athena Scientific.
Goyal, M., Kumar, A., & Sharma, V. (2003). Power constrained and delay optimal policies for scheduling transmission over a fading channel. In INFOCOM 2003.
Hernandez-Lerma, O. & Lasserre, J.-B. (1996). Discrete-time Markov control processes. New York: Springer-Verlag.
Sundaram, R.K. (1996). A first course in optimization theory. Cambridge: Cambridge University Press.