Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Guo, W.; Wang, S.; Wu, Y.; Rigelsford, J.; Chu, X.; O'Farrell, T. (2013)
Languages: English
Types: Other
In cellular networks, balancing the throughput among users is important to achieve a uniform Quality-of-Service (QoS). This can be accomplished using a variety of cross-layer techniques. In this paper, the authors investigate how the down-tilt of base-station (BS) antennas can be adjusted to maximize the user throughput fairness in a heterogeneous network, considering the impact of both a dynamic user distribution and capacity saturation of different transmission techniques. Finding the optimal down-tilt in a multi-cell interference-limited network is a complex problem, where stochastic channel effects and irregular antenna patterns has yielded no explicit solutions and is computationally expensive. The investigation first demonstrates that a fixed tilt strategy yields good performances for homogeneous networks, but the introduction of HetNet elements adds a high level of sensitivity to the tilt dependent performance. This means that a HetNet must have network-wide knowledge of where BSs, access-points and users are. The paper also demonstrates that transmission techniques that can achieve a higher level of capacity saturation increases the optimal down-tilt angle. A distributed reinforcement learning algorithm is proposed, where BSs do not need knowledge of location data. The algorithm can achieve convergence to a near-optimal solution rapidly (6-15 iterations) and improve the throughput fairness by 45-56% and the energy efficiency by 21-47%, as compared to fixed strategies. Furthermore, the paper shows that a tradeoff between the optimal solution convergence rate and asymptotic performance exists for the self-learning algorithm.
  • No references.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article