By Topic

A joint congestion control, routing, and scheduling algorithm in multihop wireless networks with heterogeneous flows

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Phuong Luu Vo ; Kyung Hee Univ., Yongin, South Korea ; Tran, N.H. ; Choong Seon Hong ; Kijoon Chae

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.

Published in:

Information Networking (ICOIN), 2011 International Conference on

Date of Conference:

26-28 Jan. 2011