基于阈值的能量约束多通道访问

Bo Yang, Yanyan Shen, M. Johansson, X. Guan
{"title":"基于阈值的能量约束多通道访问","authors":"Bo Yang, Yanyan Shen, M. Johansson, X. Guan","doi":"10.1109/ICC.2010.5502753","DOIUrl":null,"url":null,"abstract":"This paper considers multiaccess control for the uplink in orthogonal-frequency-division-multiple-access (OFDMA) wireless networks. To avoid extensive information exchange with the access point in centralized approaches, we propose a distributed threshold-based scheme, where each user accesses multiple channels simultaneously based on a comparison between measured channel gains and a channel gain threshold. Each user will adapts its channel gain threshold based on local measurements of collision on each channeland the energy consumption for channel contention. The problem is formulated as a constrained non-cooperative game. We show existence and uniqueness of the Nash equilibrium. A gradient-based algorithm is proposed to update the channel gain threshold. Furthermore, the convergence of this algorithm is proved. In addition, for heterogeneous systems, our proposed scheme can maintain multiuser diversity gains considering the time-varying channel gain and energy consumption. Compared with peer distributed OFDMA schemes and random channel selection algorithms, our proposed schemes reduce overhead and achieve a higher throughput.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Threshold-Based Multichannel Access with Energy Constraint\",\"authors\":\"Bo Yang, Yanyan Shen, M. Johansson, X. Guan\",\"doi\":\"10.1109/ICC.2010.5502753\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers multiaccess control for the uplink in orthogonal-frequency-division-multiple-access (OFDMA) wireless networks. To avoid extensive information exchange with the access point in centralized approaches, we propose a distributed threshold-based scheme, where each user accesses multiple channels simultaneously based on a comparison between measured channel gains and a channel gain threshold. Each user will adapts its channel gain threshold based on local measurements of collision on each channeland the energy consumption for channel contention. The problem is formulated as a constrained non-cooperative game. We show existence and uniqueness of the Nash equilibrium. A gradient-based algorithm is proposed to update the channel gain threshold. Furthermore, the convergence of this algorithm is proved. In addition, for heterogeneous systems, our proposed scheme can maintain multiuser diversity gains considering the time-varying channel gain and energy consumption. Compared with peer distributed OFDMA schemes and random channel selection algorithms, our proposed schemes reduce overhead and achieve a higher throughput.\",\"PeriodicalId\":6405,\"journal\":{\"name\":\"2010 IEEE International Conference on Communications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.2010.5502753\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2010.5502753","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

研究正交频分多址(OFDMA)无线网络中上行链路的多址控制问题。为了避免在集中式方法中与接入点进行大量的信息交换,我们提出了一种基于分布式阈值的方案,其中每个用户同时访问多个信道,基于测量的信道增益和信道增益阈值之间的比较。每个用户将根据每个信道的局部碰撞测量和信道争用的能量消耗来调整其信道增益阈值。该问题被表述为一个约束的非合作博弈。证明了纳什均衡的存在唯一性。提出了一种基于梯度的信道增益阈值更新算法。进一步证明了该算法的收敛性。此外,对于异构系统,考虑时变信道增益和能量消耗,该方案可以保持多用户分集增益。与对等分布式OFDMA方案和随机信道选择算法相比,我们提出的方案减少了开销,实现了更高的吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Threshold-Based Multichannel Access with Energy Constraint
This paper considers multiaccess control for the uplink in orthogonal-frequency-division-multiple-access (OFDMA) wireless networks. To avoid extensive information exchange with the access point in centralized approaches, we propose a distributed threshold-based scheme, where each user accesses multiple channels simultaneously based on a comparison between measured channel gains and a channel gain threshold. Each user will adapts its channel gain threshold based on local measurements of collision on each channeland the energy consumption for channel contention. The problem is formulated as a constrained non-cooperative game. We show existence and uniqueness of the Nash equilibrium. A gradient-based algorithm is proposed to update the channel gain threshold. Furthermore, the convergence of this algorithm is proved. In addition, for heterogeneous systems, our proposed scheme can maintain multiuser diversity gains considering the time-varying channel gain and energy consumption. Compared with peer distributed OFDMA schemes and random channel selection algorithms, our proposed schemes reduce overhead and achieve a higher throughput.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信