多中继无线网络中的资源分配

K. Bakanoglu, S. Tomasin, E. Erkip
{"title":"多中继无线网络中的资源分配","authors":"K. Bakanoglu, S. Tomasin, E. Erkip","doi":"10.1109/ACSSC.2008.5074671","DOIUrl":null,"url":null,"abstract":"A cooperative network where transmission between two nodes that have no direct link, but assisted by many relays is considered. We assume a broadband system, such as OFDM, modeled by multiple parallel Gaussian subchannels between the source and each relay, and also between each relay and the destination. We formulate the optimization problem for joint power and subchannel allocation under a short term per-node power constraint to maximize the instantaneous total transmission rate between the source and the destination. To solve this optimization problem, first we find the optimal power allocation for a given subchannel allocation. Then we focus on a greedy algorithm that jointly allocates subchannels and power. Simulation results reveal that our proposed algorithm results in rates close to the optimum allocation.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"221 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Resource allocation in wireless networks with multiple relays\",\"authors\":\"K. Bakanoglu, S. Tomasin, E. Erkip\",\"doi\":\"10.1109/ACSSC.2008.5074671\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A cooperative network where transmission between two nodes that have no direct link, but assisted by many relays is considered. We assume a broadband system, such as OFDM, modeled by multiple parallel Gaussian subchannels between the source and each relay, and also between each relay and the destination. We formulate the optimization problem for joint power and subchannel allocation under a short term per-node power constraint to maximize the instantaneous total transmission rate between the source and the destination. To solve this optimization problem, first we find the optimal power allocation for a given subchannel allocation. Then we focus on a greedy algorithm that jointly allocates subchannels and power. Simulation results reveal that our proposed algorithm results in rates close to the optimum allocation.\",\"PeriodicalId\":416114,\"journal\":{\"name\":\"2008 42nd Asilomar Conference on Signals, Systems and Computers\",\"volume\":\"221 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 42nd Asilomar Conference on Signals, Systems and Computers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.2008.5074671\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 42nd Asilomar Conference on Signals, Systems and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2008.5074671","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

考虑两个节点之间没有直接链路,但有许多中继辅助的合作网络。我们假设一个宽带系统,如OFDM,由源和每个中继之间以及每个中继和目的地之间的多个并行高斯子信道建模。提出了在短期单节点功率约束下,以最大瞬时总传输速率为目标的联合功率和子信道分配优化问题。为了解决这个优化问题,我们首先找到给定子信道分配的最优功率分配。然后重点研究了一种联合分配子信道和功率的贪心算法。仿真结果表明,该算法的分配速率接近最优分配。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Resource allocation in wireless networks with multiple relays
A cooperative network where transmission between two nodes that have no direct link, but assisted by many relays is considered. We assume a broadband system, such as OFDM, modeled by multiple parallel Gaussian subchannels between the source and each relay, and also between each relay and the destination. We formulate the optimization problem for joint power and subchannel allocation under a short term per-node power constraint to maximize the instantaneous total transmission rate between the source and the destination. To solve this optimization problem, first we find the optimal power allocation for a given subchannel allocation. Then we focus on a greedy algorithm that jointly allocates subchannels and power. Simulation results reveal that our proposed algorithm results in rates close to the optimum allocation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Wavenumber domain focusing of squinted SAR data with a curved orbit geometry An automated three-dimensional visualization and classification of emphysema using neural network Analysis of voltage overscaled computer arithmetics in low power signal processing systems End-to-end antenna selection strategies for multi-hop relay channels Distributed demodulation using consensus averaging in wireless sensor 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