<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>1276</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2011-05-03</completedDate>
    <publishedDate>2011-05-03</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Measurement Based Self-Optimization in Random Access Communications</title>
    <abstract language="eng">The current work considers random access communications within a single cell and provides  &#13;
an algorithmic suggestion for the almost optimal coordination of user actions.&#13;
In the scenario considered, an access effort is successful if (a) the signal is &#13;
detected at the receiver and (b) no collision occurs. The first event is controlled by the user transmission power and the second by the &#13;
choice of access (back-off) probability. These constitute the user action pair. &#13;
The algorithm aims at exploiting information from measurements and user reports, in order to estimate current &#13;
values of the system situation. Based on these, two optimization problems can be formulated and solved &#13;
for the so called contention level and transmission power level at the &#13;
base station side. The methodology to find the optimal values is based on minimization of a drift function. &#13;
The two values are broadcast in order to help the users update their actions ``almost optimally``. &#13;
In this way the wireless cell can achieve self-optimization, without outside coordination, by relying on such intelligent information exchange&#13;
and parameter estimation.  Numerical results illustrate the great benefits of the &#13;
suggested algorithm, compared to scenarios where the actions remain fixed, at a very low or even zero cost in power expenditure and delay.</abstract>
    <identifier type="serial">11-18</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-12764</identifier>
    <author>Anastasios Giovanidis</author>
    <submitter>Anastasios Giovanidis</submitter>
    <author>Qi Liao</author>
    <author>Slawomir Stanczak</author>
    <series>
      <title>ZIB-Report</title>
      <number>11-18</number>
    </series>
    <subject>
      <language/>
      <type>uncontrolled</type>
      <value>Random Access Channel</value>
    </subject>
    <subject>
      <language/>
      <type>uncontrolled</type>
      <value>Self Organizing Networks (SONs)</value>
    </subject>
    <subject>
      <language/>
      <type>uncontrolled</type>
      <value>Dynamic Programming</value>
    </subject>
    <subject>
      <language/>
      <type>uncontrolled</type>
      <value>Drift Minimization</value>
    </subject>
    <subject>
      <language/>
      <type>uncontrolled</type>
      <value>ALOHA</value>
    </subject>
    <collection role="ccs" number="C.2.2">Network Protocols</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1276/RandomAccess.pdf</file>
  </doc>
</export-example>
