By Topic

A Novel Fast Multi-Constrained QoS Flows Routing Algorithm in 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
$33 $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

2 Author(s)
Lianggui Liu ; Sch. of Inf. & Electron., Zhejiang Sci-Tech Univ., Hangzhou, China ; Zhixin Chen

In Wireless Mesh Networks, a novel fast Mean Field Annealing based multi-constrained QoS flows Routing Algorithm is proposed. Because MFA_RA uses a set of deterministic equations to replace the stochastic process in Simulated Annealing (SA), and uses saddle point approximation in the calculation of the stationary probability distribution at equilibrium, the convergence time is much less than the algorithm based on SA. Simulation results demonstrate that MFA_RS can find better configuration more quickly than SA and is very fit for WMN where various QoS based broadband applications are performed.

Published in:

2009 First International Conference on Information Science and Engineering

Date of Conference:

26-28 Dec. 2009