<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     naa a22        4500</leader>
  <controlfield tag="001">510795226</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180411083334.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">180411e20130301xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s11277-012-0610-x</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s11277-012-0610-x</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="2">
   <subfield code="a">A Radio Resource Management Framework for Multi-User Multi-Cell OFDMA Networks Based on Game Theory</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Ioannis Stiakogiannakis, Dimitra Kaklamani]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">This work proposes a radio resource management framework employing game theoretic concepts for orthogonal frequency division multiple access, the most prevalent multiple access technique for the next generation wireless networks. The subcarrier allocation problem is encountered as a combinatorial auction, where the base station auctions the subcarriers and the users bid for and buy bundles of subcarriers, aiming at minimising their required transmit power. Subsequently, each allocated subcarrier is loaded with a number of bits, decided by each user independently, and the power control process is set up as a non-cooperative game. Each user responds to the interference sensed in his environment and, through a best responses process, the game converges to the unique, Pareto optimal, Nash equilibrium. In order to guarantee convergence, a limit is imposed to the maximum modulation level for each subcarrier. Simulation results show that the auction algorithm follows closely the performance of the optimal algorithm, whereas it is of lower computational complexity and requires less feedback information. Similarly, the proposed distributed bit loading and power control scheme achieves lower transmit power per offered bit rate unit. However, the distributed nature of the algorithm results in lower total offered bit rate, because of the partial knowledge and exploitation of channel state information.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media, LLC., 2012</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">OFDMA</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Radio resource management</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Margin adaptive</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Subcarrier allocation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Power control</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Game theory</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Combinatorial auctions</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Stiakogiannakis</subfield>
   <subfield code="D">Ioannis</subfield>
   <subfield code="u">School of Electrical and Computer Engineering, National Technical University of Athens, Athens, Greece</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Kaklamani</subfield>
   <subfield code="D">Dimitra</subfield>
   <subfield code="u">School of Electrical and Computer Engineering, National Technical University of Athens, Athens, Greece</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Wireless Personal Communications</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">69/2(2013-03-01), 745-770</subfield>
   <subfield code="x">0929-6212</subfield>
   <subfield code="q">69:2&lt;745</subfield>
   <subfield code="1">2013</subfield>
   <subfield code="2">69</subfield>
   <subfield code="o">11277</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s11277-012-0610-x</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s11277-012-0610-x</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Stiakogiannakis</subfield>
   <subfield code="D">Ioannis</subfield>
   <subfield code="u">School of Electrical and Computer Engineering, National Technical University of Athens, Athens, Greece</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Kaklamani</subfield>
   <subfield code="D">Dimitra</subfield>
   <subfield code="u">School of Electrical and Computer Engineering, National Technical University of Athens, Athens, Greece</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Wireless Personal Communications</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">69/2(2013-03-01), 745-770</subfield>
   <subfield code="x">0929-6212</subfield>
   <subfield code="q">69:2&lt;745</subfield>
   <subfield code="1">2013</subfield>
   <subfield code="2">69</subfield>
   <subfield code="o">11277</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
