%0 Conference Proceedings
%T Fast-Converging Scheduling and Routing Algorithms for WiMAX Mesh Networks
%+ Networks and Performance Analysis (NPA)
%A Nahle, Salim
%A Malouch, Naceur
%Z Part 5: Resource Allocation Wireless
%< avec comité de lecture
%( NETWORKING 2011
%B 10th IFIP Networking Conference (NETWORKING)
%C Valencia, Spain
%Y Jordi Domingo-Pascual
%Y Pietro Manzoni
%Y Sergio Palazzo
%Y Ana Pont
%Y Caterina Scoglio
%I Springer
%3 Lecture Notes in Computer Science
%V 6641
%N Part II
%P 238-249
%8 2011-05-09
%D 2011
%R 10.1007/978-3-642-20798-3_18
%K scheduling
%K routing
%K WiMAX
%K Mesh Networks
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 6
%2 https://hal.science/hal-01285694/document
%2 https://hal.science/hal-01285694/file/978-3-642-20798-3_18_Chapter.pdf
%L hal-01285694
%U https://hal.science/hal-01285694
%~ UPMC
%~ CNRS
%~ LIP6
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ UPMC_POLE_1
%~ IFIP-LNCS-6641
%~ SORBONNE-UNIVERSITE
%~ SU-SCIENCES
%~ SU-TI
%~ ALLIANCE-SU