<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01285694</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-18T05:04:17+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Fast-Converging Scheduling and Routing Algorithms for WiMAX Mesh Networks</title>
            <author role="aut">
              <persName>
                <forename type="first">Salim</forename>
                <surname>Nahle</surname>
              </persName>
              <idno type="halauthorid">912463-0</idno>
              <affiliation ref="#struct-389034"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Naceur</forename>
                <surname>Malouch</surname>
              </persName>
              <email type="md5">f788ca8ae8246a45e6a57c4476ce1768</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="numeric">966427</idno>
              <idno type="halauthorid" notation="string">143811-966427</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8703-2264</idno>
              <idno type="IDREF">https://www.idref.fr/077382153</idno>
              <affiliation ref="#struct-389034"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Lip6</forename>
                <surname>Publications</surname>
              </persName>
              <email type="md5">48f930374cf1d03f2eafeaae16bb5814</email>
              <email type="domain">lip6.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2017-09-29 10:52:22</date>
              <date type="whenModified">2023-04-11 15:16:28</date>
              <date type="whenReleased">2017-09-29 10:54:19</date>
              <date type="whenProduced">2011-05-09</date>
              <date type="whenEndEmbargoed">2017-09-29</date>
              <ref type="file" target="https://hal.science/hal-01285694v1/document">
                <date notBefore="2017-09-29"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01285694v1/file/978-3-642-20798-3_18_Chapter.pdf" id="file-1598027-1648302">
                <date notBefore="2017-09-29"/>
              </ref>
              <ref type="externalLink" target="https://link.springer.com/content/pdf/10.1007%2F978-3-642-20798-3_18.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="196566">
                <persName>
                  <forename>Lip6</forename>
                  <surname>Publications</surname>
                </persName>
                <email type="md5">48f930374cf1d03f2eafeaae16bb5814</email>
                <email type="domain">lip6.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01285694</idno>
            <idno type="halUri">https://hal.science/hal-01285694</idno>
            <idno type="halBibtex">nahle:hal-01285694</idno>
            <idno type="halRefHtml">&lt;i&gt;10th IFIP Networking Conference (NETWORKING)&lt;/i&gt;, May 2011, Valencia, Spain. pp.238-249, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-642-20798-3_18"&gt;&amp;#x27E8;10.1007/978-3-642-20798-3_18&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">10th IFIP Networking Conference (NETWORKING), May 2011, Valencia, Spain. pp.238-249, &amp;#x27E8;10.1007/978-3-642-20798-3_18&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1598027-1648302"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UPMC" corresp="SORBONNE-UNIVERSITE">Université Pierre et Marie Curie</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="IFIP-LNCS" corresp="IFIP">IFIP - Lecture Notes in Computer Science</idno>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-TC6" corresp="IFIP-TC">TC 6: Communication Systems</idno>
            <idno type="stamp" n="UPMC_POLE_1" corresp="UPMC">UPMC Pôle 1</idno>
            <idno type="stamp" n="IFIP-LNCS-6641" corresp="IFIP-LNCS">NETWORKING 2011 - Part II</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 5: Resource Allocation Wireless</note>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Fast-Converging Scheduling and Routing Algorithms for WiMAX Mesh Networks</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Salim</forename>
                    <surname>Nahle</surname>
                  </persName>
                  <idno type="halauthorid">912463-0</idno>
                  <affiliation ref="#struct-389034"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Naceur</forename>
                    <surname>Malouch</surname>
                  </persName>
                  <email type="md5">f788ca8ae8246a45e6a57c4476ce1768</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="numeric">966427</idno>
                  <idno type="halauthorid" notation="string">143811-966427</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8703-2264</idno>
                  <idno type="IDREF">https://www.idref.fr/077382153</idno>
                  <affiliation ref="#struct-389034"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">NETWORKING 2011</title>
                <meeting>
                  <title>10th IFIP Networking Conference (NETWORKING)</title>
                  <date type="start">2011-05-09</date>
                  <date type="end">2011-05-13</date>
                  <settlement>Valencia</settlement>
                  <country key="ES">Spain</country>
                </meeting>
                <editor>Jordi Domingo-Pascual</editor>
                <editor>Pietro Manzoni</editor>
                <editor>Sergio Palazzo</editor>
                <editor>Ana Pont</editor>
                <editor>Caterina Scoglio</editor>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
                  <biblScope unit="volume">6641</biblScope>
                  <biblScope unit="issue">Part II</biblScope>
                  <biblScope unit="pp">238-249</biblScope>
                  <date type="datePub">2011</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-642-20798-3_18</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">scheduling</term>
                <term xml:lang="en">routing</term>
                <term xml:lang="en">WiMAX</term>
                <term xml:lang="en">Mesh Networks</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>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.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 6</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-389034" status="OLD">
          <orgName>Networks and Performance Analysis</orgName>
          <orgName type="acronym">NPA</orgName>
          <date type="start">2004-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-233" type="direct"/>
            <relation active="#struct-93591" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-233" status="OLD">
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>Laboratoire d'Informatique de Paris 6</orgName>
          <orgName type="acronym">LIP6</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93591" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93591" status="OLD">
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Université Pierre et Marie Curie - Paris 6</orgName>
          <orgName type="acronym">UPMC</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 place Jussieu - 75005 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.upmc.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>