Sliding Mode Based Congestion Control and Scheduling for Multi-Class Traffic Over Per-Link Queueing Wireless Networks

Download Now Free registration required

Executive Summary

This paper considers the problem of joint congestion control and scheduling in wireless networks with Quality of Service (QoS) guarantees. Different from per-destination queueing in the existing works, which is not scalable, this work considers per-link queueing at each node, which significantly reduces the number of queues per node. Under per-link queueing, the authors formulate the joint congestion control and scheduling problem as a Network Utility Maximization (NUM) problem and use a dual decomposition method to separate the NUM problem into two sub-problems, i.e., a congestion control problem and a scheduling problem. Then, they develop a Sliding Mode (SM) based distributed congestion control scheme, and prove its convergence and optimality property.

  • Format: PDF
  • Size: 235.97 KB