Resource Allocation in Multi-Radio Multi-Channel Multi-Hop Wireless Networks

S. Merlin, N. Vaidya, M. Zorzi
{"title":"Resource Allocation in Multi-Radio Multi-Channel Multi-Hop Wireless Networks","authors":"S. Merlin, N. Vaidya, M. Zorzi","doi":"10.1109/INFOCOM.2008.110","DOIUrl":null,"url":null,"abstract":"A joint congestion control, channel allocation and scheduling algorithm for multi-channel multi-interface multi- hop wireless networks is discussed. The goal of maximizing a utility function of the injected traffic, while guaranteeing queue stability, is defined as an optimization problem where the input traffic intensity, channel loads, interface to channel binding and transmission schedules are jointly optimized by a dynamic algorithm. Due to the inherent NP-Hardness of the scheduling problem, a simple centralized heuristic is used to define a lower bound for the performance of the whole optimization algorithm. The behavior of the algorithm for different numbers of channels, interfaces and traffic flows is shown through simulations.","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":"102","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.110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 102

Abstract

A joint congestion control, channel allocation and scheduling algorithm for multi-channel multi-interface multi- hop wireless networks is discussed. The goal of maximizing a utility function of the injected traffic, while guaranteeing queue stability, is defined as an optimization problem where the input traffic intensity, channel loads, interface to channel binding and transmission schedules are jointly optimized by a dynamic algorithm. Due to the inherent NP-Hardness of the scheduling problem, a simple centralized heuristic is used to define a lower bound for the performance of the whole optimization algorithm. The behavior of the algorithm for different numbers of channels, interfaces and traffic flows is shown through simulations.
多无线电多信道多跳无线网络中的资源分配
讨论了一种多通道多接口多跳无线网络的联合拥塞控制、信道分配和调度算法。以注入流量的效用函数最大化为目标,在保证队列稳定性的前提下,将其定义为通过动态算法对输入流量强度、信道负载、接口到信道绑定和传输调度进行联合优化的优化问题。由于调度问题固有的np -硬度,我们使用一个简单的集中式启发式来定义整个优化算法的性能下界。仿真显示了该算法在不同信道数、接口数和交通流情况下的行为。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信