{"title":"Transmission control policy for data services over a time-varying wireless channel","authors":"Bang Wang, K. Chua","doi":"10.1109/ICON.2003.1266259","DOIUrl":null,"url":null,"abstract":"In this paper, we study the transmission control prohlem for data services over a time-varying wireless channel. A data user with general arrival statistics needs to decide from time to time whether or not to transmit a packet based on its buffer occupancy and observed channel state. Each decision incurs Some rewarddcosts representing different QoS aspects. Our objective is to find an optimal transmission policy (if it exists) that maximizes the expected average reward per unit time. We discuss the existence of a stationary optimal policy and its structural properties. Simulation results suggest that different balance points can he easily achieved by simply adjusting the reward parameters.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICON.2003.1266259","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we study the transmission control prohlem for data services over a time-varying wireless channel. A data user with general arrival statistics needs to decide from time to time whether or not to transmit a packet based on its buffer occupancy and observed channel state. Each decision incurs Some rewarddcosts representing different QoS aspects. Our objective is to find an optimal transmission policy (if it exists) that maximizes the expected average reward per unit time. We discuss the existence of a stationary optimal policy and its structural properties. Simulation results suggest that different balance points can he easily achieved by simply adjusting the reward parameters.