.png){kind=icon}
.png){kind=icon}
Return
Online Algorithms for Basestation Allocation
.png){kind=icon}
OA
AI
DOI：10.1109/TWC.2014.041014.131526.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Design of online algorithms for assigning mobile users to basestations is considered with the objective of maximizing the sum-rate, when all users associated to any one basestation equally share each basestation's resources. Each user on its arrival reveals the rates it can obtain if connected to each of the basestations, and the problem is to assign each user to any one basestation irrevocably and without delay so that the sum-rate is maximized at the end of all user arrivals. In online algorithms, at each user arrival, the rates of future users are assumed to be unknown, and no assumptions are made about their statistics. Online algorithms with constant factor loss in comparison to offline algorithms (that know both the user arrival and user rates profile in advance) are derived. The proposed online algorithms are motivated from the famous online k-secretary problem and online maximum weight matching problem.
Keywords:
Basestation allocation
online algorithms
K-secretary problem
online matching
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W