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

DOI10.1016/J.INS.2014.10.001MaRDI QIDQ526678zbMATH OpenOpenAlexFDO

Authors Lianggui Liu, Yuxu Peng, Weiqiang 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)

Recommendations

• Optimization architecture for joint multi-path routing and scheduling in wireless mesh networks
• Multi-postpath-based lookahead multiconstraint QoS routing
• Multicast routing based on the simulated annealing
• Gateway selection and routing in wireless mesh networks
• Algorithm for multi-constrained path selection based on experimental analysis

Cites work

• scientific article; zbMATH DE number 1647923 (Why is no real title available?)
• Algorithms for finding paths with multiple constraints
• Bidirectional Multi-Constrained Routing Algorithms
• Neural networks and physical systems with emergent collective computational abilities
• QoS routing in wireless sensor networks -- a survey

Cited in

(1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526678)