Fast-converging scheduling and routing algorithms for WiMAX mesh networks

  • Authors:
  • Salim Nahle;Naceur Malouch

  • Affiliations:
  • Université Pierre et Marie Curie - Laboratoire LIP6/CNRS, Paris Cedex;Université Pierre et Marie Curie - Laboratoire LIP6/CNRS, Paris Cedex

  • Venue:
  • NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present fast converging algorithms that fit well WiMAX mesh networks. First, a centralized scheduling algorithm is presented. It calculates schedules by transforming the multi-hop tree into a single hop, and then repartitioning the different schedules in the multihop tree. Second, a routing metric called Multiple Channel One Pass (MCOP) is introduced. MCOP chooses routes by explicitly accounting for the coding and modulation schemes on each route as well as the number of available channels. In addition, the route construction is performed in a way that reduces the impact of the bottlenecks on throughput. Numerical simulations show the superior performance of MCOP as compared to other routing metrics especially when the available number of channels is more than two.