{"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.