A fundamental cross-layer approach to uplink resource allocation

E. Yeh, A. Cohen
{"title":"A fundamental cross-layer approach to uplink resource allocation","authors":"E. Yeh, A. Cohen","doi":"10.1109/MILCOM.2003.1290189","DOIUrl":null,"url":null,"abstract":"The literature on multiaccess (uplink) communications has traditionally treated \"network-layer\" issues such as source burstiness and network delay apart from \"physical-layer\" issues such as channel modelling, coding, and detection. We establish a unified cross-layer framework for optimal resource allocation over multiaccess fading channels where packets arrive randomly to transmitters. Using optimal coding assumptions, we first show that the region of all stable arrival rates is the same as the information-theoretic capacity region of [D. Tse and S. Hanly, 1998]. Next, we show that a longest-queue-highest-possible-rate (LQHPR) allocation strategy stabilizes the multiaccess queueing system whenever stability is possible. Finally, we show that under symmetric conditions, the LQHPR policy also minimizes the average packet delay. Such a policy can be interpreted in the coding context as adaptive successive decoding. Since optimal coding assumptions are used, the throughput (delay) performance of the LQHPR policy provides a fundamental upper (lower) bound to the performance of all reliable multiaccess coding schemes. especially when the measurement noise is low.","PeriodicalId":435910,"journal":{"name":"IEEE Military Communications Conference, 2003. MILCOM 2003.","volume":"220 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Military Communications Conference, 2003. MILCOM 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.2003.1290189","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

The literature on multiaccess (uplink) communications has traditionally treated "network-layer" issues such as source burstiness and network delay apart from "physical-layer" issues such as channel modelling, coding, and detection. We establish a unified cross-layer framework for optimal resource allocation over multiaccess fading channels where packets arrive randomly to transmitters. Using optimal coding assumptions, we first show that the region of all stable arrival rates is the same as the information-theoretic capacity region of [D. Tse and S. Hanly, 1998]. Next, we show that a longest-queue-highest-possible-rate (LQHPR) allocation strategy stabilizes the multiaccess queueing system whenever stability is possible. Finally, we show that under symmetric conditions, the LQHPR policy also minimizes the average packet delay. Such a policy can be interpreted in the coding context as adaptive successive decoding. Since optimal coding assumptions are used, the throughput (delay) performance of the LQHPR policy provides a fundamental upper (lower) bound to the performance of all reliable multiaccess coding schemes. especially when the measurement noise is low.
一种基本的跨层上行资源分配方法
关于多址(上行)通信的文献传统上除了处理信道建模、编码和检测等“物理层”问题外,还处理“网络层”问题,如源突发和网络延迟。我们建立了一个统一的跨层框架,用于在分组随机到达发射机的多址衰落信道上进行最优资源分配。利用最优编码假设,我们首先证明了所有稳定到达率的区域与[D]的信息论容量区域相同。谢志强,1998]。接下来,我们展示了一种最长队列最高可能率(LQHPR)分配策略在尽可能稳定的情况下使多访问队列系统保持稳定。最后,我们证明了在对称条件下,LQHPR策略也能最小化平均数据包延迟。这种策略可以在编码上下文中解释为自适应连续解码。由于使用了最优编码假设,因此LQHPR策略的吞吐量(延迟)性能为所有可靠的多址编码方案的性能提供了一个基本的上(下)界。特别是在测量噪声较低的情况下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信