Inspired by recent industrial efforts toward high altitude flying wireless points powered by renewable energy, an online resource allocation for a mobile access point (AP) travelling at high altitude is. The AP allocates its resources (available energy) to maximize the utility (reward) provided to a sequentially observed set of users service. The problem is formulated as a 0/1 dynamic knapsack problem incremental capacity over a finite time horizon, the solution of which is open in the literature. We address the problem through deterministic and formulations. For the deterministic problem, several online are proposed based on an instantaneous threshold that can adapt short-time-scale dynamics. For the stochastic model, after showing the of a threshold based solution on a dynamic programming (DP), an approximate threshold based policy is obtained. The of proposed policies are compared with that of the optimal obtained through DP.
No takes yet. Share an insight, caveat, or question.
Ceran et al. (2015) studied this question.