协作网络中实现跨层度量的资源分配

E. Karamad, R. Adve
{"title":"协作网络中实现跨层度量的资源分配","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":"{\"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}","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

摘要

我们考虑了一个网络效用最大化(NUM)框架来分配由多个源、专用中继和单个目的地组成的合作网络中的资源。分配的目的是确保每个源的平均队列长度低于选定的需求。优化包括各节点功率分配、中继选择和中继策略。我们提出了NUM问题,并提出了实现最优分配方案的解决方案。这里的两个主要贡献是包含队列长度的公式和仅在源节点数量上具有线性复杂性的有效解决方案。此外,与以前的工作不同,它避免了对费率的强力搜索。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Resource allocation to achieve cross-layer metrics in cooperative networks
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信