DocumentCode
2212412
Title
A Novel Fast Multi-Constrained QoS Flows Routing Algorithm in Wireless Mesh Networks
Author
Liu, Lianggui ; Chen, Zhixin
Author_Institution
Sch. of Inf. & Electron., Zhejiang Sci-Tech Univ., Hangzhou, China
fYear
2009
fDate
26-28 Dec. 2009
Firstpage
5303
Lastpage
5306
Abstract
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.
Keywords
deterministic algorithms; probability; quality of service; simulated annealing; wireless mesh networks; MFA_RA; broadband applications; deterministic equations; mean field annealing; multiconstrained QoS; routing algorithm; saddle point approximation; simulated annealing; stationary probability distribution; wireless mesh networks; Convergence; Equations; Finance; Informatics; Information science; Probability distribution; Routing; Simulated annealing; Stochastic processes; Wireless mesh networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Science and Engineering (ICISE), 2009 1st International Conference on
Conference_Location
Nanjing
Print_ISBN
978-1-4244-4909-5
Type
conf
DOI
10.1109/ICISE.2009.117
Filename
5454714
Link To Document