The maximum concurrent flow problem
Journal of the ACM (JACM)
On the 1.1 edge-coloring of multigraphs
SIAM Journal on Discrete Mathematics
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Faster approximation schemes for fractional multicommodity flow problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Proceedings of the 9th annual international conference on Mobile computing and networking
Impact of interference on multi-hop wireless network performance
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
The capacity of wireless networks
IEEE Transactions on Information Theory
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Algorithmic aspects of communication in ad-hoc networks with smart antennas
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Minimum-cost multicast over coded packet networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Component based channel assignment in single radio, multi-channel ad hoc networks
Proceedings of the 12th annual international conference on Mobile computing and networking
An admission control algorithm for multi-hop 802.11e based WLANs
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Efficient load-balancing routing for wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
International Journal of Ad Hoc and Ubiquitous Computing
Load-balanced mesh router migration for wireless mesh networks
Journal of Parallel and Distributed Computing
An admission control algorithm for multi-hop 802.11e-based WLANs
Computer Communications
Rate-diversity and resource-aware broadcast and multicast in multi-rate wireless mesh networks
Mobile Networks and Applications
Interface assignment and bandwidth allocation for multi-channel wireless mesh networks
Computer Communications
Local edge colouring of Yao-like subgraphs of Unit Disk Graphs
Theoretical Computer Science
Role and channel assignments for wireless mesh networks using hybrid approach
Computer Networks: The International Journal of Computer and Telecommunications Networking
Delay aware link scheduling for multi-hop TDMA wireless networks
IEEE/ACM Transactions on Networking (TON)
Throughput optimization in wireless networks with multi-packet reception and directional antennas
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Feasibility of the receiver capacity model for multi-hop wireless networks
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Local edge colouring of Yao-like subgraphs of unit disk graphs
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
ICNC'09 Proceedings of the 5th international conference on Natural computation
Wireless Networking
Approximating maximum directed flow in a large wireless network
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Joint routing and scheduling in multi-hop wireless networks with directional antennas
INFOCOM'10 Proceedings of the 29th conference on Information communications
Integrated power controlled rate adaptation and medium access control in wireless mesh networks
IEEE Transactions on Wireless Communications
On the achievable forwarding capacity of an infinite wireless network
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
The distributed wireless gathering problem
Theoretical Computer Science
The limit of information propagation speed in large-scale multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Local algorithms for edge colorings in UDGs
Theoretical Computer Science
Network capacity region and minimum energy function for a delay-tolerant mobile ad hoc network
IEEE/ACM Transactions on Networking (TON)
REUSE: A combined routing and link scheduling mechanism for wireless mesh networks
Computer Communications
Joint scheduling and routing algorithm with load balancing in wireless mesh network
Computers and Electrical Engineering
Multidirectional forwarding capacity in a massively dense wireless network
Proceedings of the 24th International Teletraffic Congress
Network topology models for multihop wireless networks
ISRN Communications and Networking
A green framework for energy efficient management in TDMA-based wireless mesh networks
Proceedings of the 8th International Conference on Network and Service Management
Personal and Ubiquitous Computing
Energy efficient management framework for multihop TDMA-based wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
This paper considers the problem of determining the achievable rates in multi-hop wireless mesh networks with orthogonal channels. We classify wireless networks with orthogonal channels into two types, half duplex and full duplex, and consider the problem of jointly routing the flows and scheduling transmissions to achieve a given rate vector. We develop tight necessary and sufficient conditions for the achievability of the rate vector. We develop efficient and easy to implement Fully Polynomial Time Approximation Schemes for solving the routing problem. The scheduling problem is a solved as a graph edge-coloring problem. We show that this approach guarantees that the solution obtained is within 50% of the optimal solution in the worst case (within 67% of the optimal solution in a common special case) and, in practice, is close to 90% of the optimal solution on the average. The approach that we use is quite flexible and can be extended to handle more sophisticated interference conditions, and routing with diversity requirements.