Towards Optimal Rate Allocation in Multi-hop Wireless Networks With Delay Constraints: A Double-Price Approach

This paper investigates the optimal rate allocation problem with end-to-end delay constraints in multi-hop wireless networks. The authors introduce Virtual Link Capacity Margin (VLCM), which is the gap between the schedulable link capacity and the maximum allowable flow rate over a link, for link delay control. They formulate the problem as a utility maximization framework with two sets of constraints: capacity and schedulability constraints and end-to-end delay constraints. They prove that the algorithm converges to a global optimum where the aggregate network utility defined over the flow rate set is maximized, while the delay constraints are satisfied.

Provided by: Vanderbilt Student Media Topic: Mobility Date Added: May 2012 Format: PDF

Find By Topic