Optimal Transmission Policies for Noisy Channels

References

  • Altman E., Kushner H. J. Control of polling in absence of vacations in heavy traffic with applications to satellite and mobile radio systems. SIAM J. Control and Optim. (2001) . (to appear)Google Scholar
  • Bambos N., Michailidis G. On the stationary dynamics of parallel queues with random server connectivities. Proc. of the 34th Conf. on Dec. and Cont. (1995) 3638–3643CrossrefGoogle Scholar
  • Bhagwat P., Bhattacharya P., Krishna A., Tripathi S. K. Enhancing throughput over wireless LANs using channel state dependent packet scheduling. IEEE INFOCOM (1996) (IEEE Press)1133–1140CrossrefGoogle Scholar
  • Carr M., Hajek B. Scheduling with asynchronous service opportunities with applications to multiple satellite systems. IEEE Trans. Automat. Control (1993) 38:1820–1832CrossrefGoogle Scholar
  • Choi J. D., Wasserman K. M., Stark W. E. Effect of channel memory on retransmission protocols for low energy wireless data communications. Proc. Internat. Conf. Comm. (1999) . (ICC'99)CrossrefGoogle Scholar
  • Duchamp D., Reynolds N. Measured performance of a wireless LAN. 17th Conf. on Local Computer Networks (1992) (IEEE Press)494–499CrossrefGoogle Scholar
  • Gilbert E. N. Capacity of a burst-noise channel. Bell Systems Technical Journal (1960) 39:1253–1266CrossrefGoogle Scholar
  • Gittins J. C.Multi-armed Bandit Allocation Indices (1989) (J. Wiley and Sons, New York) Google Scholar
  • Gittins J. C., Jones D. M., Gani J., et al. A dynamic allocation index for the sequential design of experiments. Progress in Statistics (1974) (North Holland, Amsterdam) 241–266Google Scholar
  • Kumar P. R., Varajya P.Stochastic Systems (1986) (Prentice-Hall)Google Scholar
  • Lott C., Teneketzis D. On the optimality of an index rule in multichannel allocation for single-hop mobile networks with multiple service classes. Probab. Eng. Info. Sci. (2000) 14:259–298CrossrefGoogle Scholar
  • Lu S., Bharghavan V., Srikant R. Fair scheduling in wireless packet networks. IEEE/ACM Trans. Networking (1999) 7(4):473–489CrossrefGoogle Scholar
  • Ross S. M.Introduction to Stochastic Dynamic Programming (1983) (Academic Press, New York) Google Scholar
  • Shakkottai S., Srikant R. Scheduling real-time traffic with deadlines over a wireless channel. ACM WOWMOM (1999) 35–42CrossrefGoogle Scholar
  • Tassiulas L., Ephremides A. Dynamic server allocation to parallel queues with randomly varying connectivity. IEEE Trans. on Info. Theory (1993) 39:466–478CrossrefGoogle Scholar
  • Tassiulas L., Papavassiliou S. Optimal anticipative scheduling with asynchronous transmission opportunities. IEEE Trans. Automat. Control (1995) 40:2052–2062CrossrefGoogle Scholar
  • Tse D. N. C., Hanly S. V. Multiaccess fading channels—Part I: Polymatroid structure, optimal resource allocation and throughput capacities. IEEE Trans. on Info. Theory (1998) 44:2796–2815CrossrefGoogle Scholar
  • Wasserman K. M., Olsen T. Lennon. On mutually interfering parallel servers subject to external disturbances. Oper. Res. (2001) 49:700–709LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.