Optimal Transmission Policies for Noisy Channels

We consider transmission policies for multiple users sharing a single wireless link to a base station. The noise, and hence the probability of correct transmission of a packet, depends on the state of the user receiving the packet. The state for each user is independent of the states of the other users and changes according to a two-state good/bad Markov chain. The state of a user is observed only when it transmits. We give conditions under which the optimal policy is the myopic policy, in which a packet is transmitted to the user that is most likely to be in the better of the two states. We do this by showing that the optimal value function is marginally linear in each of the users' probabilities of being in the good state. Our model also may be applied to flexible manufacturing systems with unreliable tools and networked computer systems.

[1]  J. Bather,et al.  Multi‐Armed Bandit Allocation Indices , 1990 .

[2]  Christian M. Ernst,et al.  Multi-armed Bandit Allocation Indices , 1989 .

[3]  G. Michailidis,et al.  On the stationary dynamics of parallel queues with random server connectivities , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[4]  Tava Lennon Olsen,et al.  On Mutually Interfering Parallel Servers Subject to External Disturbances , 2001, Oper. Res..

[5]  Eitan Altman,et al.  Control of Polling in Presence of Vacations in Heavy Traffic with Applications to Satellite and Mobile Radio Systems , 2002, SIAM J. Control. Optim..

[6]  David Tse,et al.  Multiaccess Fading Channels-Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities , 1998, IEEE Trans. Inf. Theory.

[7]  R. Srikant,et al.  Scheduling Real-Time Traffic With Deadlines over a Wireless Channel , 1999, WOWMOM '99.

[8]  Demosthenis Teneketzis,et al.  ON THE OPTIMALITY OF AN INDEX RULE IN MULTICHANNEL ALLOCATION FOR SINGLE-HOP MOBILE NETWORKS WITH MULTIPLE SERVICE CLASSES , 2000 .

[9]  R. Srikant,et al.  Scheduling Real-Time Traffic With Deadlines over a Wireless Channel , 2002, Wirel. Networks.

[10]  E. Gilbert.  Capacity of a burst-noise channel , 1960 .

[11]  R. Srikant,et al.  Fair scheduling in wireless packet networks , 1999, TNET.

[12]  S. PapavassiliouDept.  Optimal Anticipative Scheduling with Asynchronous Transmission Opportunities , 1995 .

[13]  Satish K. Tripathi,et al.  Enhancing throughput over wireless LANs using channel state dependent packet scheduling , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[14]  Wayne E. Stark,et al.  Effect of channel memory on retransmission protocols for low energy wireless data communications , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[15]  Leandros Tassiulas,et al.  Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.

[16]  R. Bertram,et al.  Stochastic Systems , 2008, Control Theory for Physicists.

[17]  Bruce Hajek,et al.  Scheduling with asynchronous service opportunities with applications to multiple satellite systems , 1993, IEEE Trans. Autom. Control..

[18]  Dan Duchamp,et al.  Measured performance of a wireless LAN , 1992, [1992] Proceedings 17th Conference on Local Computer Networks.