Yasaman Ghasempour, N. Prasad, M. Khojastepour, S. Rangarajan
{"title":"Managing analog beams in mmWave networks","authors":"Yasaman Ghasempour, N. Prasad, M. Khojastepour, S. Rangarajan","doi":"10.1109/ACSSC.2017.8335544","DOIUrl":null,"url":null,"abstract":"In this paper we consider multi-cell mmWave networks wherein each cell equipped with a large antenna array can employ an analog precoder (or a group of analog beams) to serve its associated users, while each such user can employ a single analog beam. A key problem over such a network is to determine the set of users that each cell should serve (a.k.a. user association), the group of beams it should employ, as well as their attributes such as how often and with how much power should each beam be used. This problem becomes harder since the choice of beam at any user is coupled to the cell it is assigned to and the latter's choice of beams. Moreover, practical considerations demand that each transmitting and receiving beam and their attributes be selected from finite codebooks. We develop novel solutions to this seemingly intractable problem. We adopt the generalized Quality-of-Service (QoS) Proportional Fairness (PF) network utility which can balance efficiency with fairness, and is particularly relevant for coverage constrained mmWave systems, since QoS constraints demand provisioning a minimum rate for each user. We prove that, remarkably, the user association problem under this QoS-PF utility can be formulated as a constrained submodular set function maximization problem. Consequently, it can be optimally solved (up to an additive constant) using distributed algorithms. We then propose a simple distributed algorithm to optimize the choice of beams and their attributes, and prove that it converges to a social equilibrium even in the presence a non-ideal communication channel between cells.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 51st Asilomar Conference on Signals, Systems, and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2017.8335544","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
In this paper we consider multi-cell mmWave networks wherein each cell equipped with a large antenna array can employ an analog precoder (or a group of analog beams) to serve its associated users, while each such user can employ a single analog beam. A key problem over such a network is to determine the set of users that each cell should serve (a.k.a. user association), the group of beams it should employ, as well as their attributes such as how often and with how much power should each beam be used. This problem becomes harder since the choice of beam at any user is coupled to the cell it is assigned to and the latter's choice of beams. Moreover, practical considerations demand that each transmitting and receiving beam and their attributes be selected from finite codebooks. We develop novel solutions to this seemingly intractable problem. We adopt the generalized Quality-of-Service (QoS) Proportional Fairness (PF) network utility which can balance efficiency with fairness, and is particularly relevant for coverage constrained mmWave systems, since QoS constraints demand provisioning a minimum rate for each user. We prove that, remarkably, the user association problem under this QoS-PF utility can be formulated as a constrained submodular set function maximization problem. Consequently, it can be optimally solved (up to an additive constant) using distributed algorithms. We then propose a simple distributed algorithm to optimize the choice of beams and their attributes, and prove that it converges to a social equilibrium even in the presence a non-ideal communication channel between cells.