Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Handbook of mathematics (3rd ed.)
Handbook of mathematics (3rd ed.)
Introduction to Algorithms
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
An efficient algorithm for finding a path subject to two additive constraints
Computer Communications
| Hi-index | 0.00 |
We focus on the algorithmic aspect of selecting a path that minimizes a recently proposed nonlinear path metric (namely, WCETT) for providing high throughput in multi-radio, multihop wireless mesh networks. First, we consider an iterative line search technique and describe how to use it for finding the optimal path in some cases while finding approximately good paths in other cases. We also use the final line search to provide a lower bound on the optimal path. Second, we consider heuristics that might search the concave region of the search space and discover better paths missed by the line search. Specifically, we propose a linearly-guided nonlinear search (LGNS) heuristic. Using simulations, we show the effectiveness of the proposed solutions.