基于FSMC衰落信道的S-ALOHA网络延迟最优分布式功率和传输阈值控制

Huang Huang, V. Lau
{"title":"基于FSMC衰落信道的S-ALOHA网络延迟最优分布式功率和传输阈值控制","authors":"Huang Huang, V. Lau","doi":"10.1109/ISIT.2009.5205689","DOIUrl":null,"url":null,"abstract":"This paper considers the delay-optimal power and transmission threshold control design in S-ALOHA network with FSMC fading channels. The random access system consists of an access point with K competing users, each has access to the local channel state information (CSI) and queue state information (QSI) as well as the common feedback (ACK/NAK/Collision) from the access point. We seek to derive the delay-optimal control policy (composed of threshold and power control) in symmetric network. The optimization problem belongs to the special memoryless policy case of K-agent infinite horizon decentralized Markov decision process (DEC-MDP), and finding the optimal memoryless policy is shown to be computationally challenging. To obtain a feasible and low complexity solution, we recast the optimization problem into two subproblems, namely the power control problem and the threshold control problem. For a given threshold control policy, the power control problem is decomposed into a reduced state MDP for single user so that the overall complexity is O(NJ), where N and J are the buffer size and the cardinality of the CSI states. For the threshold control problem, we exploit some special structure of the collision channel and common feedback information to derive a low complexity solution. The delay performance of the proposed design is shown to have substantial gain relative to conventional throughput optimal approaches for S-ALOHA.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Delay-optimal distributed power and transmission threshold control for S-ALOHA network with FSMC fading channels\",\"authors\":\"Huang Huang, V. Lau\",\"doi\":\"10.1109/ISIT.2009.5205689\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the delay-optimal power and transmission threshold control design in S-ALOHA network with FSMC fading channels. The random access system consists of an access point with K competing users, each has access to the local channel state information (CSI) and queue state information (QSI) as well as the common feedback (ACK/NAK/Collision) from the access point. We seek to derive the delay-optimal control policy (composed of threshold and power control) in symmetric network. The optimization problem belongs to the special memoryless policy case of K-agent infinite horizon decentralized Markov decision process (DEC-MDP), and finding the optimal memoryless policy is shown to be computationally challenging. To obtain a feasible and low complexity solution, we recast the optimization problem into two subproblems, namely the power control problem and the threshold control problem. For a given threshold control policy, the power control problem is decomposed into a reduced state MDP for single user so that the overall complexity is O(NJ), where N and J are the buffer size and the cardinality of the CSI states. For the threshold control problem, we exploit some special structure of the collision channel and common feedback information to derive a low complexity solution. The delay performance of the proposed design is shown to have substantial gain relative to conventional throughput optimal approaches for S-ALOHA.\",\"PeriodicalId\":412925,\"journal\":{\"name\":\"2009 IEEE International Symposium on Information Theory\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2009.5205689\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2009.5205689","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

研究了具有FSMC衰落信道的S-ALOHA网络的时延最优功率和传输阈值控制设计。随机访问系统由一个具有K个竞争用户的接入点组成,每个用户都可以访问本地信道状态信息(CSI)和队列状态信息(QSI)以及来自接入点的公共反馈(ACK/NAK/Collision)。我们寻求在对称网络中推导延迟最优控制策略(由门限和功率控制组成)。该优化问题属于K-agent无限水平去中心化马尔可夫决策过程的无记忆策略的特殊情况,寻找最优的无记忆策略在计算上具有挑战性。为了得到一个可行且低复杂度的解,我们将优化问题重构为两个子问题,即功率控制问题和阈值控制问题。对于给定的阈值控制策略,将功率控制问题分解为单个用户的简化状态MDP,从而使总体复杂度为O(NJ),其中N和J是缓冲区大小和CSI状态的基数。对于阈值控制问题,我们利用一些特殊的碰撞通道结构和常见的反馈信息,得到了一个低复杂度的解决方案。与传统的S-ALOHA吞吐量优化方法相比,所提出设计的延迟性能显示出实质性的增益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Delay-optimal distributed power and transmission threshold control for S-ALOHA network with FSMC fading channels
This paper considers the delay-optimal power and transmission threshold control design in S-ALOHA network with FSMC fading channels. The random access system consists of an access point with K competing users, each has access to the local channel state information (CSI) and queue state information (QSI) as well as the common feedback (ACK/NAK/Collision) from the access point. We seek to derive the delay-optimal control policy (composed of threshold and power control) in symmetric network. The optimization problem belongs to the special memoryless policy case of K-agent infinite horizon decentralized Markov decision process (DEC-MDP), and finding the optimal memoryless policy is shown to be computationally challenging. To obtain a feasible and low complexity solution, we recast the optimization problem into two subproblems, namely the power control problem and the threshold control problem. For a given threshold control policy, the power control problem is decomposed into a reduced state MDP for single user so that the overall complexity is O(NJ), where N and J are the buffer size and the cardinality of the CSI states. For the threshold control problem, we exploit some special structure of the collision channel and common feedback information to derive a low complexity solution. The delay performance of the proposed design is shown to have substantial gain relative to conventional throughput optimal approaches for S-ALOHA.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信