TY - GEN
T1 - Sliding mode based joint congestion control and scheduling in multi-hop ad hoc networks with multi-class services
AU - Ding, Zongrui
AU - Wu, Dapeng
N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].
PY - 2010
Y1 - 2010
N2 - In this paper, we consider the joint problem of congestion control and scheduling with multi-class Quality of Service (QoS) requirements. Generally, the joint problem is formulated as a Network Utility Maximization (NUM) problem and can be decomposed into a congestion control problem and a scheduling problem. Usually, the congestion control problem can be solved in a distributed manner by tracking per-destinationqueue for every flow, which requires that every node should maintain many queues, each corresponding to one destination. With QoS constraints imposed on the congestion control problem, it is hard to obtain an explicit distributed solution. To address this, we propose 1) using per-next-hop-queue instead of perdestination-queue, which considerably reduces queuing overhead, 2) a Sliding Mode (SM) approach to designing a distributed controller for the congestion control problem while satisfying multi-class QoS requirements in the multi-path and multi-hop scenario. We also prove the optimality and convergence of the SM based solution to the NUM problem. ©2010 IEEE.
AB - In this paper, we consider the joint problem of congestion control and scheduling with multi-class Quality of Service (QoS) requirements. Generally, the joint problem is formulated as a Network Utility Maximization (NUM) problem and can be decomposed into a congestion control problem and a scheduling problem. Usually, the congestion control problem can be solved in a distributed manner by tracking per-destinationqueue for every flow, which requires that every node should maintain many queues, each corresponding to one destination. With QoS constraints imposed on the congestion control problem, it is hard to obtain an explicit distributed solution. To address this, we propose 1) using per-next-hop-queue instead of perdestination-queue, which considerably reduces queuing overhead, 2) a Sliding Mode (SM) approach to designing a distributed controller for the congestion control problem while satisfying multi-class QoS requirements in the multi-path and multi-hop scenario. We also prove the optimality and convergence of the SM based solution to the NUM problem. ©2010 IEEE.
UR - http://www.scopus.com/inward/record.url?scp=79551630811&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-79551630811&origin=recordpage
U2 - 10.1109/GLOCOM.2010.5684101
DO - 10.1109/GLOCOM.2010.5684101
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9781424456383
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - 2010 IEEE Global Telecommunications Conference, GLOBECOM 2010
T2 - 53rd IEEE Global Communications Conference, GLOBECOM 2010
Y2 - 6 December 2010 through 10 December 2010
ER -