Resource Allocation in Multihop Wireless Networks多跳无线网络中的资源分配.pptVIP

Resource Allocation in Wireless Networks: Dynamics and Complexity R. Srikant Department of ECE and CSL University of Illinois at Urbana-Champaign Outline A simple three-node example: Internet versus wireless networks Joint scheduling, routing and congestion control for general static multihop wireless networks (Eryilmaz, S.) Connection-level models and stability (Lin, Shroff, S.) Complexity of the MAC algorithm: simple distributed algorithms (Wu, S., Perkins) Three-Node Internet (Kelly) Solution Functional Decomposition Queue Lengths (Prices): Congestion Control: Wireless Network Lagrange Multipliers Decomposition Congestion control: MAC or Scheduling (MaxWeight): Alternative Formulation Decomposition Congestion control (per-flow queues): MAC or Scheduling (Backpressure): Differences in the Two Formulations Arrivals instantaneously arrive at all nodes in the route versus node-by-node queueing behavior Sources react to sum of queue lengths versus Sources react to entry queue length Why is it sufficient to react to only the entry queue length? Back-pressure algorithm Outline A simple three-node example: Internet versus wireless networks Joint scheduling, routing and congestion control for general static multihop wireless networks Connection-level models and stability Complexity of the MAC algorithm: simple distributed algorithms Stochastic Models The set of allowable rates at each time instant can be time-varying Don’t need to know the statistics of the channel Can model randomness in the arrival processes The proof involves showing that the conditional mean drift of the Lyapunov function has the form shown in the previous page Outline A simple three-node example: Internet versus wireless networks Joint scheduling, routing and congestion control for general static multihop wireless networks Connection-level models and stability Complexity of the MAC algorithm: simple distributed algorithms Connection-Level Model Assume a fixed route for