To converge more quickly and effectively—Mean field annealing based optimal path selection in WMN
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 d...
Saved in:
Published in | Information sciences Vol. 294; pp. 216 - 226 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier Inc
10.02.2015
|
Subjects | |
Online Access | Get full text |
ISSN | 0020-0255 1872-6291 |
DOI | 10.1016/j.ins.2014.10.001 |
Cover
Loading…