Joint MAC-aware routing and load balancing in mesh networks

  • Authors:
  • Vivek Mhatre;Henrik Lundgren;Francois Baccelli;Christophe Diot

  • Affiliations:
  • Bell Labs, Bangalore, India;Thomson Research Lab, Paris, France;ENS-INRIA, Paris, France;Thomson Research Lab, Paris, France

  • Venue:
  • CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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).