By Topic

Mean field network based QoS routing scheme 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 ; Dept. of Commun. Eng., Nanjing Univ. of Posts & Telecommun., China ; Guangzeng Feng

Multi-constrained quality-of-service routing (QoSR) is to find a feasible path that satisfies multiple constraints simultaneously, as an NPC problem, which is also a big challenge for wireless mesh networks. There are few methods, which can solve this problem effectively so far. In this paper, we propose a novel routing scheme based on mean field network (MFN_RS) to solve this problem. This algorithm first uses a function of the wireless link's delay and capacity both of which are QoS parameters as the cost function, and then seeks to find a feasible path by mean field annealing. Because MFN_RS 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, thus the convergence time is much less than the algorithm based on SA. Simulation results demonstrate that MFN_RS is an effective algorithm and is very fit for wireless mesh networks where the topology may be changing constantly.

Published in:

Proceedings. 2005 International Conference on Wireless Communications, Networking and Mobile Computing, 2005.  (Volume:2 )

Date of Conference:

23-26 Sept. 2005