马尔可夫信道下的在线最优数据传输策略

Zikuan Liu, J. Almhana, V. Choulakian, R. McGorman
{"title":"马尔可夫信道下的在线最优数据传输策略","authors":"Zikuan Liu, J. Almhana, V. Choulakian, R. McGorman","doi":"10.1109/PERSER.2005.1506560","DOIUrl":null,"url":null,"abstract":"The challenges of providing data services over wireless networks come from, their high reliability requirement under noisy wireless channels. In this paper, we model the noisy channel by a continuous-time Markov process and propose a dynamical packet transmission strategy for data service. The transmission strategy optimization is formulated as a Markov decision process. We establish that the optimal strategy has a threshold structure and develop a single sample path-based optimization algorithm to tune the thresholds. Since only a single sample path is involved, the proposed algorithm can be implemented online.","PeriodicalId":375822,"journal":{"name":"ICPS '05. Proceedings. International Conference on Pervasive Services, 2005.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Online optimal data transmission strategy under Markov channel\",\"authors\":\"Zikuan Liu, J. Almhana, V. Choulakian, R. McGorman\",\"doi\":\"10.1109/PERSER.2005.1506560\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The challenges of providing data services over wireless networks come from, their high reliability requirement under noisy wireless channels. In this paper, we model the noisy channel by a continuous-time Markov process and propose a dynamical packet transmission strategy for data service. The transmission strategy optimization is formulated as a Markov decision process. We establish that the optimal strategy has a threshold structure and develop a single sample path-based optimization algorithm to tune the thresholds. Since only a single sample path is involved, the proposed algorithm can be implemented online.\",\"PeriodicalId\":375822,\"journal\":{\"name\":\"ICPS '05. Proceedings. International Conference on Pervasive Services, 2005.\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICPS '05. Proceedings. International Conference on Pervasive Services, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PERSER.2005.1506560\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICPS '05. Proceedings. International Conference on Pervasive Services, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PERSER.2005.1506560","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

通过无线网络提供数据服务的挑战来自于无线信道噪声下的高可靠性要求。本文利用连续时间马尔可夫过程对噪声信道进行建模,提出了一种用于数据服务的动态分组传输策略。传输策略优化是一个马尔可夫决策过程。我们建立了具有阈值结构的最优策略,并开发了基于单样本路径的优化算法来调整阈值。由于只涉及单个采样路径,因此该算法可以在线实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Online optimal data transmission strategy under Markov channel
The challenges of providing data services over wireless networks come from, their high reliability requirement under noisy wireless channels. In this paper, we model the noisy channel by a continuous-time Markov process and propose a dynamical packet transmission strategy for data service. The transmission strategy optimization is formulated as a Markov decision process. We establish that the optimal strategy has a threshold structure and develop a single sample path-based optimization algorithm to tune the thresholds. Since only a single sample path is involved, the proposed algorithm can be implemented online.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信