Adaptive resource sharing in wireless networks

We propose a state-dependent method for allocating and sharing resources based on the least busy algorithm for a wireless system consisting of several overlaid wireless networks. The model is an approximation that utilizes capacity, reservation and different degrees of mobility of users to characterize the system as a network of queues. We use the network net revenue to compare reservation policies. We show how the use of reservation improves network-wide performance.