Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

Measurement Based Self-Optimization in Random Access Communications

Please always quote using this URN: urn:nbn:de:0297-zib-12764
  • The current work considers random access communications within a single cell and provides an algorithmic suggestion for the almost optimal coordination of user actions. In the scenario considered, an access effort is successful if (a) the signal is detected at the receiver and (b) no collision occurs. The first event is controlled by the user transmission power and the second by the choice of access (back-off) probability. These constitute the user action pair. The algorithm aims at exploiting information from measurements and user reports, in order to estimate current values of the system situation. Based on these, two optimization problems can be formulated and solved for the so called contention level and transmission power level at the base station side. The methodology to find the optimal values is based on minimization of a drift function. The two values are broadcast in order to help the users update their actions ``almost optimally``. In this way the wireless cell can achieve self-optimization, without outside coordination, by relying on such intelligent information exchange and parameter estimation. Numerical results illustrate the great benefits of the suggested algorithm, compared to scenarios where the actions remain fixed, at a very low or even zero cost in power expenditure and delay.

Download full text files

Export metadata

Metadaten
Author:Anastasios Giovanidis, Qi Liao, Slawomir Stanczak
Document Type:ZIB-Report
Tag:
CCS-Classification:C. Computer Systems Organization / C.2 COMPUTER-COMMUNICATION NETWORKS / C.2.2 Network Protocols
Date of first Publication:2011/05/03
Series (Serial Number):ZIB-Report (11-18)
ZIB-Reportnumber:11-18
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.