基础无线网状网络端到端按需带宽分配的跨层设计

Hong Lu, S. Liu, Anxiao Jiang
{"title":"基础无线网状网络端到端按需带宽分配的跨层设计","authors":"Hong Lu, S. Liu, Anxiao Jiang","doi":"10.1109/WASA.2007.133","DOIUrl":null,"url":null,"abstract":"Wireless mesh networks have gained significant academic and industry attentions in the recent years. Supporting quality of service in wireless mesh networks is an important and challenging task which involves both medium access control and network layer design. In this paper, we investigate the problem of end-to-end on-demand bandwidth allocation in infrastructure wireless mesh networks. We formulate it as a combinatorial optimization problem, and prove that it is NP- hard. We present a polynomial time 2-approximation algorithm, MCRS (minimum consumption routing and scheduling), based on the concepts of consumption level for routing and bottom set for scheduling. Comprehensive simulation results show that MCRS achieves better performance than traditional methods based on minimum hop routing.","PeriodicalId":316831,"journal":{"name":"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Cross-Layer Design for End-to-End On-Demand Bandwidth Allocation in Infrastructure Wireless Mesh Network\",\"authors\":\"Hong Lu, S. Liu, Anxiao Jiang\",\"doi\":\"10.1109/WASA.2007.133\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wireless mesh networks have gained significant academic and industry attentions in the recent years. Supporting quality of service in wireless mesh networks is an important and challenging task which involves both medium access control and network layer design. In this paper, we investigate the problem of end-to-end on-demand bandwidth allocation in infrastructure wireless mesh networks. We formulate it as a combinatorial optimization problem, and prove that it is NP- hard. We present a polynomial time 2-approximation algorithm, MCRS (minimum consumption routing and scheduling), based on the concepts of consumption level for routing and bottom set for scheduling. Comprehensive simulation results show that MCRS achieves better performance than traditional methods based on minimum hop routing.\",\"PeriodicalId\":316831,\"journal\":{\"name\":\"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)\",\"volume\":\"114 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WASA.2007.133\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WASA.2007.133","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

近年来,无线网状网络得到了学术界和工业界的广泛关注。支持无线网状网络的服务质量是一项重要而富有挑战性的任务,它涉及到介质访问控制和网络层设计。本文研究了基础无线网状网络中端到端按需带宽分配问题。我们将其表述为一个组合优化问题,并证明了它是NP困难的。基于路由的消耗水平和调度的底集概念,提出了一种多项式时间2逼近算法——最小消耗路由和调度(MCRS)。综合仿真结果表明,MCRS比基于最小跳路由的传统方法具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Cross-Layer Design for End-to-End On-Demand Bandwidth Allocation in Infrastructure Wireless Mesh Network
Wireless mesh networks have gained significant academic and industry attentions in the recent years. Supporting quality of service in wireless mesh networks is an important and challenging task which involves both medium access control and network layer design. In this paper, we investigate the problem of end-to-end on-demand bandwidth allocation in infrastructure wireless mesh networks. We formulate it as a combinatorial optimization problem, and prove that it is NP- hard. We present a polynomial time 2-approximation algorithm, MCRS (minimum consumption routing and scheduling), based on the concepts of consumption level for routing and bottom set for scheduling. Comprehensive simulation results show that MCRS achieves better performance than traditional methods based on minimum hop routing.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信