To converge more quickly and effectively -- mean field annealing based optimal path selection in WMN

DOI10.1016/J.INS.2014.10.001zbMath1360.68785OpenAlexW2044521490MaRDI QIDQ526678

Lianggui Liu, Yuxu Peng, Wei-Qiang Xu

Publication date: 15 May 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.10.001

zbMATH Keywords

simulated annealingenergy functionmean field annealingmulti-constrained path selection with optimization

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Deployment optimization of multi-hop wireless networks based on substitution graph

Cites Work

• Unnamed Item
• QoS routing in wireless sensor networks—a survey
• Algorithms for finding paths with multiple constraints
• Bidirectional Multi-Constrained Routing Algorithms
• Neural networks and physical systems with emergent collective computational abilities.

This page was built for publication: To converge more quickly and effectively -- mean field annealing based optimal path selection in WMN