By Topic

Scheduling and Control of Mobile Communications Networks with Randomly Time Varying Channels by Stability Methods

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)
Kushner, H.J. ; Dept. of Appl. Math., Brown Univ., Providence, RI

Consider a communications network consisting of mobiles, some of which can serve as a receiver and/or transmitter in a multihop path. There are random external data processes, each destined for some destinations. At each mobile the data is queued according to the source-destination pair until transmitted. The capacities of the connecting channels are randomly varying. Time is divided into small scheduling intervals. At the beginning of the intervals, the channels are estimated via pilot signals and this information is used for the scheduling decisions during the interval, concerning the allocation of transmission power and/or time, bandwidth, and perhaps antennas, to the various queues in a queue and channel-state dependent way, to assure stability. Lost packets might or might not have to be retransmitted. General networks are covered, conditions used in previous works are weakened, and the distributions of the input file lengths can be heavy tailed. The resulting controls are readily implementable. The choice of Lyapunov function allows a range of tradeoffs between current rates and queue lengths, under very weak conditions. Because of the non-Markovian nature of the problem, we use the perturbed stochastic Lyapunov function method, which is designed for such problems. Extensions concerning acknowledgments, multicasting, non-unique routes, and others, are available

Published in:

Decision and Control, 2006 45th IEEE Conference on

Date of Conference:

13-15 Dec. 2006