分布式DTX与内存对齐

Hauke Holtkamp, G. Dietl, H. Haas
{"title":"分布式DTX与内存对齐","authors":"Hauke Holtkamp, G. Dietl, H. Haas","doi":"10.1109/ICC.2014.6883860","DOIUrl":null,"url":null,"abstract":"This paper addresses the assignment of transmission and sleep time slots between interfering transmitters with the objective of minimal power consumption. In particular, we address the constructive alignment of Discontinuous Transmission (DTX) time slots under link rate constraints. Due to the complexity of the combinatorial optimization problem at hand, we resort to heuristic assignment strategies. We derive four time slot alignment solutions (sequential alignment, random alignment, p-persistent ranking and DTX alignment with memory) and identify trade-offs. One of the proposed solutions, namely, DTX alignment with memory addresses identified issues of the other three solutions by maintaining memory of past alignment and channel quality to buffer short term changes in channel quality. All strategies are found to exhibit similar convergence behavior, but different power consumption and retransmission probabilities. DTX alignment with memory is shown to achieve up to 40% savings in power consumption and more than 20% lower retransmission probability than the State-Of-The-Art (SotA).","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Distributed DTX alignment with memory\",\"authors\":\"Hauke Holtkamp, G. Dietl, H. Haas\",\"doi\":\"10.1109/ICC.2014.6883860\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses the assignment of transmission and sleep time slots between interfering transmitters with the objective of minimal power consumption. In particular, we address the constructive alignment of Discontinuous Transmission (DTX) time slots under link rate constraints. Due to the complexity of the combinatorial optimization problem at hand, we resort to heuristic assignment strategies. We derive four time slot alignment solutions (sequential alignment, random alignment, p-persistent ranking and DTX alignment with memory) and identify trade-offs. One of the proposed solutions, namely, DTX alignment with memory addresses identified issues of the other three solutions by maintaining memory of past alignment and channel quality to buffer short term changes in channel quality. All strategies are found to exhibit similar convergence behavior, but different power consumption and retransmission probabilities. DTX alignment with memory is shown to achieve up to 40% savings in power consumption and more than 20% lower retransmission probability than the State-Of-The-Art (SotA).\",\"PeriodicalId\":444628,\"journal\":{\"name\":\"2014 IEEE International Conference on Communications (ICC)\",\"volume\":\"103 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE International Conference on Communications (ICC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.2014.6883860\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2014.6883860","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文讨论了以最小功耗为目标的干扰发射机之间的传输和睡眠时隙的分配。特别是,我们解决了链路速率约束下的不连续传输(DTX)时隙的建设性对齐问题。由于组合优化问题的复杂性,我们采用启发式分配策略。我们推导了四种时隙对齐解决方案(顺序对齐、随机对齐、p-persistent排序和DTX与内存对齐),并确定了权衡。提出的解决方案之一,即DTX与内存对齐,通过维护过去对齐和信道质量的内存来缓冲信道质量的短期变化,从而解决了其他三种解决方案所确定的问题。所有策略都表现出相似的收敛行为,但功耗和重传概率不同。与最先进的(SotA)相比,DTX与内存对齐可以节省高达40%的功耗,并且重传概率降低20%以上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Distributed DTX alignment with memory
This paper addresses the assignment of transmission and sleep time slots between interfering transmitters with the objective of minimal power consumption. In particular, we address the constructive alignment of Discontinuous Transmission (DTX) time slots under link rate constraints. Due to the complexity of the combinatorial optimization problem at hand, we resort to heuristic assignment strategies. We derive four time slot alignment solutions (sequential alignment, random alignment, p-persistent ranking and DTX alignment with memory) and identify trade-offs. One of the proposed solutions, namely, DTX alignment with memory addresses identified issues of the other three solutions by maintaining memory of past alignment and channel quality to buffer short term changes in channel quality. All strategies are found to exhibit similar convergence behavior, but different power consumption and retransmission probabilities. DTX alignment with memory is shown to achieve up to 40% savings in power consumption and more than 20% lower retransmission probability than the State-Of-The-Art (SotA).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Distributed DTX alignment with memory Throughput maximization with channel acquisition in energy harvesting systems Energy exchange among base stations in a Cellular Network through the Smart Grid Smart grid enabled mobile networks: Jointly optimizing BS operation and power distribution Distance-based energy-efficient opportunistic forwarding in mobile delay tolerant networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1