A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Comparison of routing metrics for static multi-hop wireless networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Architecture and evaluation of an unplanned 802.11b mesh network
Proceedings of the 11th annual international conference on Mobile computing and networking
Measurement driven deployment of a two-tier urban mesh access network
Proceedings of the 4th international conference on Mobile systems, applications and services
Determining the end-to-end throughput capacity in multi-hop networks: methodology and applications
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Efficient load-balancing routing for wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Enhanced wireless mesh networking for ns-2 simulator
ACM SIGCOMM Computer Communication Review
Beacon-Stuffing: Wi-Fi without Associations
HOTMOBILE '07 Proceedings of the Eighth IEEE Workshop on Mobile Computing Systems and Applications
Routing stability in static wireless mesh networks
PAM'07 Proceedings of the 8th international conference on Passive and active network measurement
Enhanced wireless mesh networking for ns-2 simulator
ACM SIGCOMM Computer Communication Review
Practical, distributed channel assignment and routing in dual-radio mesh networks
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Capacity-aware routing in heterogeneous mesh networks: an analytical approach
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Diffusion based distributed internet gateway load balancing in a wireless mesh network
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Load-aware routing in mesh networks: Models, algorithms and experimentation
Computer Communications
Routing Internet traffic in heterogeneous mesh networks: Analysis and algorithms
Performance Evaluation
Fast track article: Comparing simulation tools and experimental testbeds for wireless mesh networks
Pervasive and Mobile Computing
Survey on diversity-based routing in wireless mesh networks: Challenges and solutions
Computer Communications
International Journal of Ad Hoc and Ubiquitous Computing
Optimal multipath forwarding in planned Wireless Mesh Networks
Computer Communications
Hi-index | 0.00 |
Past approaches to routing in mesh networks either (i) do not account for the MAC-layer interactions between the links in a tractable manner, or (ii) are agnostic to load-balancing across gateways. Our answer to these problems is MaLB (MAC-aware and Load Balanced routing algorithm), a greedy, tractable, and distributed mesh routing algorithm. Since the underlying objective function has high combinatorial complexity, MaLB uses a greedy approach. MaLB finds an optimum routing forest (union of trees rooted at the gateways) by taking into account MAC-layer interaction between links, as well as optimum multi-hop association of mesh nodes to gateways. MaLB builds on top of ETP (Expected Through-Put), a recently proposed MAC-aware routing metric. We also propose a low complexity variant of MaLB called LB (Load Balanced routing algorithm) which performs load balancing in a MAC-agnostic manner. MaLB performs especially well in networks with skewed topologies that result from unplanned mesh network deployment, as well as in the presence of gateway failures. Simulations with an enhanced version of ns-2 show that MaLB results in up to 60% higher throughput than a shortest path algorithm with ETX (Expected Transmission Count). Furthermore, MaLB results in up to 30% improvement over the LB algorithm, as well as a shortest path algorithm with ETT (Expected Transmission Time).