TY - GEN
T1 - A joint congestion control, routing, and scheduling algorithm in multihop wireless networks with heterogeneous flows
AU - Vo, Phuong Luu
AU - Tran, Nguyen H.
AU - Hong, Choong Seon
AU - Chae, Ki Joon
PY - 2011
Y1 - 2011
N2 - We consider the network with two kinds of traffic: inelastic and elastic traffic. The inelastic traffic requires fixed throughput, high priority while the elastic traffic has controllable rate and low priority. Giving the fixed rate of inelastic traffic, how to inject the elastic traffic into the network to achieve the maximum utility of elastic traffic is solved in this paper. The Lagrangian Duality method is applied to solve the optimization problem. We decompose the Lagrangian into subproblems, and each sub-problem associates with each layer. The convexity of the primal problem guarantees the duality gap between primal and dual solutions is zero. The Lagrange multipliers, which are indeed the queue length on nodes for every destinations, implicitly update according to subgradient algorithm. The joint algorithm for rate control, routing, and scheduling is proposed. However, the scheduling is Max-weight scheduling and centralized algorithm actually. The Greedy distributed scheduling is introduced to implement scheduling in a distributed sense.
AB - We consider the network with two kinds of traffic: inelastic and elastic traffic. The inelastic traffic requires fixed throughput, high priority while the elastic traffic has controllable rate and low priority. Giving the fixed rate of inelastic traffic, how to inject the elastic traffic into the network to achieve the maximum utility of elastic traffic is solved in this paper. The Lagrangian Duality method is applied to solve the optimization problem. We decompose the Lagrangian into subproblems, and each sub-problem associates with each layer. The convexity of the primal problem guarantees the duality gap between primal and dual solutions is zero. The Lagrange multipliers, which are indeed the queue length on nodes for every destinations, implicitly update according to subgradient algorithm. The joint algorithm for rate control, routing, and scheduling is proposed. However, the scheduling is Max-weight scheduling and centralized algorithm actually. The Greedy distributed scheduling is introduced to implement scheduling in a distributed sense.
UR - http://www.scopus.com/inward/record.url?scp=79952951288&partnerID=8YFLogxK
U2 - 10.1109/ICOIN.2011.5723125
DO - 10.1109/ICOIN.2011.5723125
M3 - Conference contribution
AN - SCOPUS:79952951288
SN - 9781612846613
T3 - International Conference on Information Networking 2011, ICOIN 2011
SP - 347
EP - 351
BT - International Conference on Information Networking 2011, ICOIN 2011
T2 - International Conference on Information Networking 2011, ICOIN 2011
Y2 - 26 January 2011 through 28 January 2011
ER -