By Topic

A Lexicographically Optimal Load Balanced Routing Scheme for Wireless Mesh Networks

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

1 Author(s)
Pal, R. ; Indian Inst. of Manage., Kolkata

Modern day wireless networks are increasingly supporting various civilian applications that require high bandwidth for successful operation. In such cases, proper bandwidth utilization is essential for good network performance. In this paper, we address the problem of routing a given traffic demand matrix in a multi-hop wireless mesh network such that the total network load is fairly distributed amongst various wireless links. Using lexicographic optimization, we develop a polynomial time multi-path load balanced routing scheme that achieves leximax minimization and distributes the total network load fairly in a min-max sense. We use linear programming to formulate our problem and perform extensive simulations to highlight the performance of our routing scheme in achieving optimal load balance whilst satisfying user requirements.

Published in:

Communications, 2008. ICC '08. IEEE International Conference on

Date of Conference:

19-23 May 2008