Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Design and evaluation of a new MAC protocol for long-distance 802.11 mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels
IEEE/ACM Transactions on Networking (TON)
The Challenges of Technology Research for Developing Regions
IEEE Pervasive Computing
Long-distance 802.11b links: performance measurements and experience
Proceedings of the 12th annual international conference on Mobile computing and networking
Long distance wireless mesh network planning: problem formulation and solution
Proceedings of the 16th international conference on World Wide Web
FRACTEL: a fresh perspective on (rural) mesh networks
Proceedings of the 2007 workshop on Networked systems for developing regions
WiLdnet: design and implementation of high performancewifi based long distance networks
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Improving minimum flow rate in wireless mesh networks by effective placement of directional antennas
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
| Hi-index | 0.03 |
Long-distance multi-hop wireless networks have been used in recent years to provide connectivity to rural areas. The salient features of such networks include TDMA channel access, nodes with multiple radios, and point-to-point long-distance wireless links established using high-gain directional antennas mounted on high towers. It has been demonstrated previously that in such network architectures, nodes can transmit concurrently on multiple radios, as well as receive concurrently on multiple radios. However, concurrent transmission on one radio, and reception on another radio causes interference. Under this scheduling constraint, given a set of source-destination demand rates, we consider the problem of satisfying the maximum fraction of each demand (also called the maximum concurrent flow problem). We give a novel joint routing and scheduling scheme for this problem, based on linear programming and graph coloring. We analyze our algorithm theoretically and prove that at least 50% of a satisfiable set of demands is satisfied by our algorithm for most practical networks (with maximum node degree at most 5).