Hierarchical beamforming: Resource allocation, fairness and flow level performance

被引:0
作者
Floquet, Julien [1 ,2 ]
Combes, Richard [2 ]
Altman, Zwi [1 ]
机构
[1] Orange Labs, 46 Ave Republ, F-92320 Chatillon, France
[2] Cent Supelec, Lab Signaux & Syst, 3 Rue Joliot Curie, F-91192 Gif Sur Yvette, France
关键词
Beamforming; Wireless networks; Resource allocation; Queuing;
D O I
10.1016/j.peva.2018.09.003
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We consider hierarchical beamforming in wireless networks. For a given population of flows, we propose computationally efficient algorithms for fair rate allocation including proportional fairness and max-min fairness. We next propose closed-form formulas for flow level performance, for both elastic (with either proportional fairness and max-min fairness) and streaming traffic. We further assess the performance of hierarchical beam forming using numerical experiments. Since the proposed solutions have low complexity compared to conventional beamforming, our work suggests that hierarchical beamforming is a promising candidate for the implementation of beamforming in future cellular networks. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:36 / 55
页数:20
相关论文
共 15 条
  • [1] Adan I., 2015, LECT NOTES QUEUEING
  • [2] Alkhateeb A., 2014, IEEE J SEL TOP SIGN
  • [3] Boccardi F., 2012, IEEE COMMUN MAG
  • [4] Bonald T., 2003, P ACM MOB
  • [5] Charash U., 1979, IEEE T COMMUN
  • [6] Hur S., 2013, IEEE T COMMUN
  • [7] Ji H., 2017, IEEE COMMUN MAG
  • [8] Kaufman J., 1981, IEEE T COMMUN
  • [9] Khlass A., 2014, P WIOPT
  • [10] MO J, 2000, IEEE ACM T NETW