Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Efficient integration of multihop wireless and wired networks with QoS constraints
IEEE/ACM Transactions on Networking (TON)
Approximate dynamic programming for link scheduling in wireless mesh networks
Computers and Operations Research
IEEE Communications Magazine
Gateway Placement Optimization in Wireless Mesh Networks With QoS Constraints
IEEE Journal on Selected Areas in Communications
A routing protocol suitable for backhaul access in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Load Balancing Forest Topology Generation Algorithm in Wireless Mesh Networks
Proceedings of the Second International Conference on Innovative Computing and Cloud Computing
| Hi-index | 0.00 |
This paper deals with issues regarding network planning and optimization in multi-hop wireless mesh networks (WMNs). The central focus is on mathematical programming formulations for both the uncapacitated and capacitated joint gateway selection and routing (U/C-GSR) problem in WMNs, which are in general NP-complete, when expressed as decision problems. We detail a reformulation using the shortest path cost matrix (SPM) and prove that it gives the optimal solution when applied to the uncapacitated case. We extend the SPM formulation to the capacitated case and show computationally, by using a lower bound on the optimal solution, that it performs within a small optimality gap. Evidence from numerical investigations shows that, the proposed formulation can dramatically improve the computation time for WMNs with realistic network sizes. Furthermore, a set of extensions to the basic formulation is detailed to allow modeling issues such as multi-rate transmission, restricting the number of hops in each routing sub-tree and declaring unreliable nodes as leaf nodes in the routing tree.