End-to-End Resource Allocation in OFDM Based Linear Multi-Hop Networks

Xiaolu Zhang, Wenhua Jiao, M. Tao
{"title":"End-to-End Resource Allocation in OFDM Based Linear Multi-Hop Networks","authors":"Xiaolu Zhang, Wenhua Jiao, M. Tao","doi":"10.1109/INFOCOM.2008.140","DOIUrl":null,"url":null,"abstract":"We study the end-to-end resource allocation in an OFDM based multi-hop network consisting of a one-dimensional chain of nodes including a source, a destination, and multiple relays. The problem is to maximize the end-to-end average transmission rate under a long-term total power constraint by adapting the transmission power on each subcarrier over each hop and the transmission time used by each hop in every time frame. The solution to the problem is derived by decomposing it into two subproblems: short-term time and power allocation given an arbitrary total power constraint for each channel realization, and total power distribution over all channel realizations. We show that the optimal solution has the following features: the power allocation on subcarriers over each hop has the water-filling structure and a higher water level is given to the hop with relatively poor channel condition; meanwhile, the fraction of transmission time allocated to each hop is adjusted to keep the instantaneous rates over all hops equal. To tradeoff between performance, computational complexity and signalling overhead, three suboptimal resource allocation algorithms are also proposed. Numerical results are illustrated under different network settings and channel environments.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFOCOM.2008.140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 22

Abstract

We study the end-to-end resource allocation in an OFDM based multi-hop network consisting of a one-dimensional chain of nodes including a source, a destination, and multiple relays. The problem is to maximize the end-to-end average transmission rate under a long-term total power constraint by adapting the transmission power on each subcarrier over each hop and the transmission time used by each hop in every time frame. The solution to the problem is derived by decomposing it into two subproblems: short-term time and power allocation given an arbitrary total power constraint for each channel realization, and total power distribution over all channel realizations. We show that the optimal solution has the following features: the power allocation on subcarriers over each hop has the water-filling structure and a higher water level is given to the hop with relatively poor channel condition; meanwhile, the fraction of transmission time allocated to each hop is adjusted to keep the instantaneous rates over all hops equal. To tradeoff between performance, computational complexity and signalling overhead, three suboptimal resource allocation algorithms are also proposed. Numerical results are illustrated under different network settings and channel environments.
基于OFDM的线性多跳网络的端到端资源分配
研究了基于OFDM的多跳网络的端到端资源分配问题,该网络由包含源、目的和多个中继的一维节点链组成。问题是在长期总功率约束下,通过调整每跳子载波上的传输功率和每跳在每个时间帧内使用的传输时间,最大化端到端平均传输速率。将该问题分解为两个子问题,即在给定任意总功率约束下对每个信道实现的短期时间和功率分配问题,以及在所有信道实现上的总功率分配问题。结果表明,该最优解具有以下特点:各跳子载波上的功率分配具有充水结构,信道条件相对较差的跳被赋予较高的水位;同时,调整分配给每一跳的传输时间的比例,以保持所有跳的瞬时速率相等。为了权衡性能、计算复杂度和信号开销,提出了三种次优资源分配算法。在不同的网络设置和信道环境下给出了数值结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信