<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-09-20T07:55:07Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/81698" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/81698</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_10761</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_10755</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:identifier>http://hdl.handle.net/2142/81698</dc:identifier>
          <dc:description>125 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005.</dc:description>
          <dc:contributor>Nahrstedt, Klara</dc:contributor>
          <dc:creator>Xue, Yuan</dc:creator>
          <dc:date>2015-09-25T20:20:03Z</dc:date>
          <dc:date>2015-09-25T20:20:03Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>2005</dc:date>
          <dc:date>2005</dc:date>
          <dc:description>In this dissertation, we propose a new price-based resource allocation framework in wireless ad hoc networks to achieve optimal resource utilization and fairness among competing end-to-end flows. We build our pricing framework on the notion of maximal cliques  in wireless ad hoc networks. Based on such a price-based theoretical framework, we present a two-tier iterative algorithm. Distributed across wireless nodes, the algorithm converges to a global network optimum with respect to resource allocations. Further, we present a price pair mechanism to coordinate multiple resource allocations, and to provide incentives simultaneously. Finally, we present a channel aware price generation scheme to decompose the bit rate adjustment and the flow rate allocation. The allocation result achieves channel time fairness where user fairness and channel utilization is balanced.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-25T20:20:03Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
3199182.pdf: 3325541 bytes, checksum: 1c3c5e0c79eaa98a6703ad29be4c0608 (MD5)
  Previous issue date: 2005</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 82979
Lift date: Forever
Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:identifier>(MiAaPQ)AAI3199182</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Computer Science</dc:subject>
          <dc:title>Price -Based Optimal Resource Allocation in Multi-Hop Wireless Networks</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Computer Science</department>
            <discipline>Computer Science</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
