A new approach to the maximum flow problem
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Combinatorial optimization
Performance of multihop wireless networks: shortest path is not enough
ACM SIGCOMM Computer Communication Review
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
Scheduling of broadcasts in multihop wireless networks
The handbook of ad hoc wireless networks
Algorithmic aspects of capacity in wireless networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Asymptotic Capacity of Infrastructure Wireless Mesh Networks
IEEE Transactions on Mobile Computing
Optimization models and methods for planning wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Gateway Placement with QoS Constraints in Wireless Mesh Networks
ICN '08 Proceedings of the Seventh International Conference on Networking
Gateway placement for throughput optimization in wireless mesh networks
Mobile Networks and Applications
On the complexity of bandwidth allocation in radio networks
Theoretical Computer Science
Communication models for throughput optimization in mesh networks
Proceedings of the 5th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Capacity bounds of deployment concepts for Wireless Mesh Networks
Performance Evaluation
Minimum Delay Data Gathering in Radio Networks
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
What is the right model for wireless channel interference?
IEEE Transactions on Wireless Communications
Efficient algorithms to solve a class of resource allocation problems in large wireless networks
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Networks - Network Optimization (INOC 2007)
Joint configuration of routing and medium access parameters in wireless networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
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
Cross-layer optimization of wireless networks using nonlinear column generation
IEEE Transactions on Wireless Communications
The capacity of random wireless networks
IEEE Transactions on Wireless Communications - Part 1
The capacity of wireless networks
IEEE Transactions on Information Theory
Throughput-range tradeoff of wireless mesh backhaul networks
IEEE Journal on Selected Areas in Communications
Computers and Operations Research
Hi-index | 0.24 |
In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks (WMNs) dedicated to Internet access. Routing and transmission scheduling have a major impact on the capacity provided to the clients. A cross-layer optimization of these problems allows the routing to take into account contentions due to radio interference. We present a generic mixed integer linear programing description of the configurations of a given WMN, addressing gateway placement, routing, and scheduling optimizations. We then develop new optimization models that can take into account a large variety of radio interference models, and QoS requirements on the routing. We also provide efficient resolution methods that deal with realistic size instances. It allows to work around the combinatoric of simultaneously achievable transmissions and point out a critical region in the network bounding the network achievable capacity. Based upon strong duality arguments, it is then possible to restrict the computation to a bounded area. It allows for computing solutions very efficiently on large networks.