Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Algorithms and Complexity
Computational Experience with an Interior Point Algorithm on the Satisfiability Problem
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Approximations of Independent Sets in Graphs
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
A fast algorithm for the maximum clique problem
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
A duality model of TCP and queue management algorithms
IEEE/ACM Transactions on Networking (TON)
P5-free augmenting graphs and the maximum stable set problem
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Polynomial algorithm for finding the largest independent sets in graphs without forks
Discrete Applied Mathematics
Two-phase routing, scheduling and power control for wireless mesh networks with variable traffic
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Realistic propagation simulation of urban mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Maximum matching in sparse random graphs
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of 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
Maximum independent sets in subclasses of P5-free graphs
Information Processing Letters
Proceedings of the 4th Annual International Conference on Wireless Internet
Hard and easy distributions of SAT problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Branching and treewidth based exact algorithms
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Joint congestion control, routing, and MAC for stability and fairness in wireless networks
IEEE Journal on Selected Areas in Communications
Proceedings of the 4th Annual International Conference on Wireless Internet
Hi-index | 0.00 |
Interference and collisions greatly limit the throughput of mesh networks that use contention-based MAC protocols such as IEEE 802.11. Significantly higher throughput is achievable if transmissions are scheduled. However, traditional methods to compute optimal schedules are computationally intractable (unless co-channel interference is neglected). This paper presents a practical technique to compute optimal schedules. The resulting algorithm searches for a low-dimensional optimization problem that has the same solution as the full problem. Such a low-dimensional problem is shown to always exist. The resulting algorithm converges arithmetically fast or geometrically fast, depending on whether the objective is to maximize the proportional fair throughput or to maximize the minimum throughput, where the minimum is over all flows in the network. At each iteration of the algorithm, a graph-theoretic optimization known as the maximum weighted independent set (MWIS) problem must be solved. While the general MWIS problem is NP-hard in the worst case, we find that the MWIS can be solved efficiently. Specifically, computational experiments on over 17 000 topologies indicate that the ratio of the time to solve the MWIS and the mean degree of the conflict graph grows polynomially with the number of nodes.