A new approach to the maximum flow problem
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Combinatorial optimization
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
Selected Topics in Column Generation
Operations Research
On the complexity of bandwidth allocation in radio networks
Theoretical Computer Science
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
An approximation algorithm for the wireless gathering problem
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Optimal scheduling for link assignment in traffic-sensitive STDMA wireless ad-hoc networks
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
The nominal capacity of wireless mesh networks
IEEE Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Wireless mesh network performance issues have been modeled by the Joint Routing and Scheduling Problem (JRSP) in which a maximum per-flow throughput is computed. A classical relaxation of JRSP, denoted as the Round Weighting Problem (RWP), consists in assigning enough weight to sets of compatible simultaneous transmissions (rounds), while minimizing the sum of them, thus maximizing the relative weight of each round, which model the throughput. In this work, we present a new linear formulation of RWP focused on the transport capacity over the network cuts, thus eliminating the routing. We prove its equivalence with existing formulations with flows and formalize a primal-dual algorithm that quickly solves this problem using a cross line and column generations process. An asset of this formulation is to point out a bounded region, a "bottleneck" of the network, that is enough to optimize in order to get the optimal RWP of the whole network. The size and location of this area is experimentally made through simulations, highlighting a few hop distant neighborhood of the mesh gateways. One would then apply approximated methods outside this zone to route the traffic without degrading the achieved capacity.