Utility-optimal scheduling in time-varying wireless networks with delay constraints
Conference Paper
Overview
Identity
Additional Document Info
Other
View All
Overview
abstract
Clients in wireless networks may have per-packet delay constraints on their traffic. Further, in contrast to wireline networks, the wireless medium is subject to fading. In such a time-varying environment, we consider the system problem of maximizing the total utility of clients, where the utilities are determined by their long-term average rates of being served within their delay constraints. We also allow for the additional fairness requirement that each client may require a certain minimum service rate. This overall model can be applied to a wide range of applications, including delay-constrained networks, mobile cellular networks, and dynamic spectrum allocation. We address this problem through convex programming. We propose an on-line scheduling policy and prove that it is utilityoptimal. Surprisingly, this policy does not need to know the probability distribution of system states. We also design an auction mechanism where clients are scheduled and charged according to their bids. We prove that the auction mechanism restricts any selfish client from improving its utility by faking its utility function. We also show that the auction mechanism schedules clients in the same way as that done by the on-line scheduling policy. Thus, the auction mechanism is both truthful and utility-optimal. Finally, we design specific algorithms that implement the auction mechanism for a variety of applications. Copyright 2010 ACM.
name of conference
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
