{"title":"CDMA网络反向链路上吞吐量最大化的最优条件","authors":"Patrick Hosein","doi":"10.1109/ISSSTA.2004.1371803","DOIUrl":null,"url":null,"abstract":"We consider the information-theoretic sum capacity of the reverse link of a CDMA wireless network. In particular we consider the problem of maximizing the throughput of this channel. The decision variables are the transmission powers that are allocated to the mobiles in the network. The major contribution of this paper is the derivation of thresholds that determine when it is: (a) optimal to serve only a single user; and (b) optimal to simultaneously serve multiple users. We also derive the optimal power allocations for the case where users are provided guaranteed minimum rates. Finally we provide a numerical example where we compare the gains of scheduling subsets of users at a time instead of all users simultaneously while maintaining some degree of fairness.","PeriodicalId":340769,"journal":{"name":"Eighth IEEE International Symposium on Spread Spectrum Techniques and Applications - Programme and Book of Abstracts (IEEE Cat. No.04TH8738)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Optimality conditions for throughput maximization on the reverse link of a CDMA network\",\"authors\":\"Patrick Hosein\",\"doi\":\"10.1109/ISSSTA.2004.1371803\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the information-theoretic sum capacity of the reverse link of a CDMA wireless network. In particular we consider the problem of maximizing the throughput of this channel. The decision variables are the transmission powers that are allocated to the mobiles in the network. The major contribution of this paper is the derivation of thresholds that determine when it is: (a) optimal to serve only a single user; and (b) optimal to simultaneously serve multiple users. We also derive the optimal power allocations for the case where users are provided guaranteed minimum rates. Finally we provide a numerical example where we compare the gains of scheduling subsets of users at a time instead of all users simultaneously while maintaining some degree of fairness.\",\"PeriodicalId\":340769,\"journal\":{\"name\":\"Eighth IEEE International Symposium on Spread Spectrum Techniques and Applications - Programme and Book of Abstracts (IEEE Cat. No.04TH8738)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-08-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Eighth IEEE International Symposium on Spread Spectrum Techniques and Applications - Programme and Book of Abstracts (IEEE Cat. No.04TH8738)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSSTA.2004.1371803\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eighth IEEE International Symposium on Spread Spectrum Techniques and Applications - Programme and Book of Abstracts (IEEE Cat. No.04TH8738)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSSTA.2004.1371803","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimality conditions for throughput maximization on the reverse link of a CDMA network
We consider the information-theoretic sum capacity of the reverse link of a CDMA wireless network. In particular we consider the problem of maximizing the throughput of this channel. The decision variables are the transmission powers that are allocated to the mobiles in the network. The major contribution of this paper is the derivation of thresholds that determine when it is: (a) optimal to serve only a single user; and (b) optimal to simultaneously serve multiple users. We also derive the optimal power allocations for the case where users are provided guaranteed minimum rates. Finally we provide a numerical example where we compare the gains of scheduling subsets of users at a time instead of all users simultaneously while maintaining some degree of fairness.