Fast-Converging Scheduling and Routing Algorithms for WiMAX Mesh Networks - NETWORKING 2011 - Part II Access content directly
Conference Papers Year : 2011

Fast-Converging Scheduling and Routing Algorithms for WiMAX Mesh Networks

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 multi-hop 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.
Fichier principal
Vignette du fichier
978-3-642-20798-3_18_Chapter.pdf (296.73 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01285694 , version 1 (29-09-2017)

Licence

Attribution

Identifiers

Cite

Salim Nahle, Naceur Malouch. Fast-Converging Scheduling and Routing Algorithms for WiMAX Mesh Networks. 10th IFIP Networking Conference (NETWORKING), May 2011, Valencia, Spain. pp.238-249, ⟨10.1007/978-3-642-20798-3_18⟩. ⟨hal-01285694⟩
121 View
90 Download

Altmetric

Share

Gmail Facebook X LinkedIn More