LAUSR

This paper studies wireless networks with multiple real-time flows that have stringent requirements on both per-packet delay and long-term average delivery ratio. Each flow dynamically adjusts its traffic load based on its observation of network status. When the requirements of per-packet delay and delivery ratio are satisfied, each flow obtains some utility based on its traffic load. We aim to design joint rate control and scheduling policies that maximize the total utility in the system. We first show that the problem of maximizing total utility can be formulated as a submodular optimization problem with exponentially many constraints. We then propose two simple distributed policies that require almost no coordination between different entities in the network. The total utilities under these two policies can be made arbitrarily close to the theoretical upper-bound. Extensive simulations also show that they achieve much better performance than state-of-the-art policies.