SCSC2003 Abstract S426

Fluid models of wireless networks

Fluid models of wireless networks

Submitting Author: Prof. R Srikant

Consider a wireless network, where data collected in N separate queues are to be transmitted over a common medium that is time-varying. Several well-known models fit into this definition. Two such examples would be the downlink and the uplink scenarios of a cellular environment.

A {\sl scheduling policy} is an allocation of service rates to the various queues, under the constraint that, at each time instant and each channel state, the set of allocated rates lies within some allowable set of rates. The set of allowable rates for each channel state is assumed to be a convex region. Our goal is to study the throughput of scheduling strategies which stabilize
the system using only queue length information and the current channel state (i.e., without knowing channel or arrival statistics). We will study this by simulating fluid models of the network. We will study a class of simple
scheduling strategies with the goal of validating the use of fluid models to study the throughput of wireless networks. We will show how these fluid models can be used to simulate large wireless networks with complicated resource allocation strategies.

Back to SCSC2003 Abstracts