Resource allocation to achieve cross-layer metrics in cooperative networks

E. Karamad, R. Adve
{"title":"Resource allocation to achieve cross-layer metrics in cooperative networks","authors":"E. Karamad, R. Adve","doi":"10.1109/CWIT.2011.5872156","DOIUrl":null,"url":null,"abstract":"We consider a network utility maximization (NUM) framework to allocate resources in a cooperative network comprising multiple sources, dedicated relays and a single destination. The allocation is designed to ensure the average queue length at each source is below a chosen demand. The optimization is over power allocation at all nodes, relay selection and relaying strategy. We formulate the NUM problem and propose a solution to achieve the optimal allocation scheme. The two main contributions here are the formulation including queue length and an efficient solution that has only linear complexity in the number of source nodes. Furthermore, unlike previous works, it avoids a brute-force search over rates.","PeriodicalId":250626,"journal":{"name":"2011 12th Canadian Workshop on Information Theory","volume":"54 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 12th Canadian Workshop on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CWIT.2011.5872156","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We consider a network utility maximization (NUM) framework to allocate resources in a cooperative network comprising multiple sources, dedicated relays and a single destination. The allocation is designed to ensure the average queue length at each source is below a chosen demand. The optimization is over power allocation at all nodes, relay selection and relaying strategy. We formulate the NUM problem and propose a solution to achieve the optimal allocation scheme. The two main contributions here are the formulation including queue length and an efficient solution that has only linear complexity in the number of source nodes. Furthermore, unlike previous works, it avoids a brute-force search over rates.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
协作网络中实现跨层度量的资源分配
我们考虑了一个网络效用最大化(NUM)框架来分配由多个源、专用中继和单个目的地组成的合作网络中的资源。分配的目的是确保每个源的平均队列长度低于选定的需求。优化包括各节点功率分配、中继选择和中继策略。我们提出了NUM问题,并提出了实现最优分配方案的解决方案。这里的两个主要贡献是包含队列长度的公式和仅在源节点数量上具有线性复杂性的有效解决方案。此外,与以前的工作不同,它避免了对费率的强力搜索。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Sparse space codes for multi-antenna systems Average outage and non-outage duration of selective decode-and-forward relaying Complexity-efficient detection for MIMO relay networks DMT analysis of multi-hop coherent FSO communication over atmospheric channels Optimizing wireless network resource allocation
×
引用
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