{"title":"On Routing of Multiple Concurrent User Requests in Multi-Radio Multi-Channel Wireless Mesh Networks","authors":"Zhanmao Cao, C. Wu, M. Berry","doi":"10.1109/PDCAT.2016.021","DOIUrl":null,"url":null,"abstract":"Multiple-radio multiple-channel (MRMC) wireless mesh networks (WMNs) generally serve as wireless backbones for ubiquitous Internet access. These networks often face a challenge to satisfy multiple user traffic requests simultaneously between different source-destination pairs with different data transfer requirements. We construct analytical network models and formulate such multi-pair routing as a rigorous optimization problem. We design a cooperative routing and scheduling algorithm with channel assignment, in which, a primary path is built upon the selection of appropriate link patterns. The performance of the proposed algorithm is illustrated by simulation-based combinatorial experiments.","PeriodicalId":203925,"journal":{"name":"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2016.021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Multiple-radio multiple-channel (MRMC) wireless mesh networks (WMNs) generally serve as wireless backbones for ubiquitous Internet access. These networks often face a challenge to satisfy multiple user traffic requests simultaneously between different source-destination pairs with different data transfer requirements. We construct analytical network models and formulate such multi-pair routing as a rigorous optimization problem. We design a cooperative routing and scheduling algorithm with channel assignment, in which, a primary path is built upon the selection of appropriate link patterns. The performance of the proposed algorithm is illustrated by simulation-based combinatorial experiments.