{"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}
引用次数: 2
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.