{"title":"具有每用户带宽保证的多信道无线网络中的动态信道分配和功率分配","authors":"Xiang Luo, K. Kar","doi":"10.1109/WIOPT.2011.5930048","DOIUrl":null,"url":null,"abstract":"We address the joint channel assignment and power allocation question in a multichannel wireless (access point) network where channel states differ across channels as well as users, and vary with time. Our goal is to obtain channel assignment and power allocation solutions that can dynamically adapt to changing channel conditions, and would maximize system throughput under per-user bandwidth (QoS) constraints, in a long-term sense. Using stochastic optimization techniques, we obtain an optimal scheduling policy that operates without knowledge of arrival rates and channel statistics (depending only on the instantaneous channel states and the queue lengths), and attains the overall system throughput that is arbitrarily close to the maximum achievable value with all per-user bandwidth constraints satisfied.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Dynamic channel assignment and power allocation in multichannel wireless networks with per-user bandwidth guarantees\",\"authors\":\"Xiang Luo, K. Kar\",\"doi\":\"10.1109/WIOPT.2011.5930048\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We address the joint channel assignment and power allocation question in a multichannel wireless (access point) network where channel states differ across channels as well as users, and vary with time. Our goal is to obtain channel assignment and power allocation solutions that can dynamically adapt to changing channel conditions, and would maximize system throughput under per-user bandwidth (QoS) constraints, in a long-term sense. Using stochastic optimization techniques, we obtain an optimal scheduling policy that operates without knowledge of arrival rates and channel statistics (depending only on the instantaneous channel states and the queue lengths), and attains the overall system throughput that is arbitrarily close to the maximum achievable value with all per-user bandwidth constraints satisfied.\",\"PeriodicalId\":430755,\"journal\":{\"name\":\"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WIOPT.2011.5930048\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIOPT.2011.5930048","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Dynamic channel assignment and power allocation in multichannel wireless networks with per-user bandwidth guarantees
We address the joint channel assignment and power allocation question in a multichannel wireless (access point) network where channel states differ across channels as well as users, and vary with time. Our goal is to obtain channel assignment and power allocation solutions that can dynamically adapt to changing channel conditions, and would maximize system throughput under per-user bandwidth (QoS) constraints, in a long-term sense. Using stochastic optimization techniques, we obtain an optimal scheduling policy that operates without knowledge of arrival rates and channel statistics (depending only on the instantaneous channel states and the queue lengths), and attains the overall system throughput that is arbitrarily close to the maximum achievable value with all per-user bandwidth constraints satisfied.