{"title":"具有吞吐量和功率约束的准静态无线衰落信道的最优速率控制","authors":"R. R, U. Mukherji","doi":"10.1109/NCC.2018.8599975","DOIUrl":null,"url":null,"abstract":"We propose a novel recursive algorithm for determining the optimal admission and transmission rates for an M/M/1 transmitter buffer for obtaining minimum average queue length, under quasi-static fading, while satisfying a throughput constraint with given available transmit power. The optimal rate setting policy is obtained with significant savings in memory and computational complexity, and is simple and easy to implement.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal rate control in a quasi-static wireless fading channel with throughput and power constraints\",\"authors\":\"R. R, U. Mukherji\",\"doi\":\"10.1109/NCC.2018.8599975\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a novel recursive algorithm for determining the optimal admission and transmission rates for an M/M/1 transmitter buffer for obtaining minimum average queue length, under quasi-static fading, while satisfying a throughput constraint with given available transmit power. The optimal rate setting policy is obtained with significant savings in memory and computational complexity, and is simple and easy to implement.\",\"PeriodicalId\":121544,\"journal\":{\"name\":\"2018 Twenty Fourth National Conference on Communications (NCC)\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Twenty Fourth National Conference on Communications (NCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCC.2018.8599975\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Twenty Fourth National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2018.8599975","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal rate control in a quasi-static wireless fading channel with throughput and power constraints
We propose a novel recursive algorithm for determining the optimal admission and transmission rates for an M/M/1 transmitter buffer for obtaining minimum average queue length, under quasi-static fading, while satisfying a throughput constraint with given available transmit power. The optimal rate setting policy is obtained with significant savings in memory and computational complexity, and is simple and easy to implement.