To converge more quickly and effectively—Mean field annealing based optimal path selection in WMN

• Published in: Information sciences Vol. 294; pp. 216 - 226
• Main Authors: Liu, Lianggui, Peng, Yuxu, Xu, Weiqiang
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 10.02.2015
• Subjects: Algorithms; Annealing; Energy function; Finite element method; Heuristic methods; Mathematical analysis; Mathematical models; Mean field annealing; Multi-constrained path selection with optimization; Networks; Optimization; Simulated annealing; Multi-constrained path selection with optimization; Mean field annealing; Energy function; Simulated annealing
• ISSN: 0020-0255; 1872-6291
• DOI: 10.1016/j.ins.2014.10.001

Multi-constrained path selection with optimization aims at finding an optimal path that satisfies a set of QoS parameters, as an NP-hard problem, which is also a big challenge for wireless mesh networks. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this problem. However, existing methods either have analyses in specific network models or cannot support the change of network topology well. Thus, multi-constrained QoSR in emerging wireless mesh networking is worth investigating further. In this paper, we propose a novel Routing Algorithm based on Mean Field Annealing (MFA_RA) to solve this problem. MFA_RA first uses a function of two QoS parameters, wireless link’s delay and transmission success rate, as the cost function, and then seeks to find a feasible path by mean field annealing. Moreover, a set of deterministic equations are utilized to replace the stochastic process in simulated annealing (SA), and a saddle point approximation is adopted for the calculation of the stationary probability distribution at equilibrium. Extensive simulation results demonstrate that MFA_RA is an effective algorithm and can outperform other heuristic algorithms.