Sourav Pal, Sumantra R. Kundu, Amin R. Mazloom, Sajal K. Das
{"title":"Channel State Estimation and Scheduling Algorithms for Multi-Rate Wireless Systems","authors":"Sourav Pal, Sumantra R. Kundu, Amin R. Mazloom, Sajal K. Das","doi":"10.1109/LCN.2007.155","DOIUrl":null,"url":null,"abstract":"Emerging multi-rate wireless systems both cellular (cdma2000, high data rate (HDR)) and Wi-Fi like systems demand that the currently used channel estimation and scheduling techniques be revisited. Not only the channel estimation, prediction algorithms, and protocols need to be modified, the premise for evaluating their performance needs to be changed. Current techniques comprise of scheduling algorithms based on existing channel state. We recommend that for enhanced performance in terms of user satisfaction and system throughput not only channel state but also the demand rate needed for satisfying the user needs to be considered. In this paper, we devise new mechanisms to estimate the varying channel conditions using information theoretic techniques for multi-rate wireless systems. We utilized a non-parametric estimator of Renyi's entropy using the Parzen widowing technique to estimate the probability density function of the channel rate variation as experienced by every user in the system. Scheduling algorithms are proposed based on the channel conditions estimated by the proposed technique as well as the data rate needed for satisfying each user . The proposed mechanism ensures the highest number of satisfied users by maintaining the stipulated QoS requirements and fairness amonst users. We also demonstrate that maximizing the throughput does not necessarily result in maximizing the number of satisfied users. Results demonstrate that the proposed estimation techniques perform better than existing schemes both in terms of number of satisfied user and throughput.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2007.155","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Emerging multi-rate wireless systems both cellular (cdma2000, high data rate (HDR)) and Wi-Fi like systems demand that the currently used channel estimation and scheduling techniques be revisited. Not only the channel estimation, prediction algorithms, and protocols need to be modified, the premise for evaluating their performance needs to be changed. Current techniques comprise of scheduling algorithms based on existing channel state. We recommend that for enhanced performance in terms of user satisfaction and system throughput not only channel state but also the demand rate needed for satisfying the user needs to be considered. In this paper, we devise new mechanisms to estimate the varying channel conditions using information theoretic techniques for multi-rate wireless systems. We utilized a non-parametric estimator of Renyi's entropy using the Parzen widowing technique to estimate the probability density function of the channel rate variation as experienced by every user in the system. Scheduling algorithms are proposed based on the channel conditions estimated by the proposed technique as well as the data rate needed for satisfying each user . The proposed mechanism ensures the highest number of satisfied users by maintaining the stipulated QoS requirements and fairness amonst users. We also demonstrate that maximizing the throughput does not necessarily result in maximizing the number of satisfied users. Results demonstrate that the proposed estimation techniques perform better than existing schemes both in terms of number of satisfied user and throughput.