{"title":"Achievable rate region and optimality of multi-hop wireless 802.11-scheduled networks","authors":"A. Jindal, K. Psounis","doi":"10.1109/ITA.2008.4601059","DOIUrl":null,"url":null,"abstract":"This paper describes a methodology to find the achievable rate region for any static wireless multi-hop network with 802.11 scheduling. To do so, we first characterize the achievable edge-rate region, that is, the set of edge rates that are achievable on the given topology. This requires a careful consideration of the inter-dependence among nearby edges, since neighboring edges collide with and affect the idle time perceived by the edge under study. We use our results to study the optimality of IEEE 802.11 scheduling by comparing the achievable rate region of IEEE 802.11 and optimal scheduling for different scenarios and find that 802.11 is able to achieve more than 80% of the throughput as compared to optimal scheduling for all the scenarios considered. To explain this result, we then characterize the local topologies for which 802.11 scheduling results in a significant drop in throughput as compared to optimal scheduling.","PeriodicalId":345196,"journal":{"name":"2008 Information Theory and Applications Workshop","volume":"178 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Information Theory and Applications Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITA.2008.4601059","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14
Abstract
This paper describes a methodology to find the achievable rate region for any static wireless multi-hop network with 802.11 scheduling. To do so, we first characterize the achievable edge-rate region, that is, the set of edge rates that are achievable on the given topology. This requires a careful consideration of the inter-dependence among nearby edges, since neighboring edges collide with and affect the idle time perceived by the edge under study. We use our results to study the optimality of IEEE 802.11 scheduling by comparing the achievable rate region of IEEE 802.11 and optimal scheduling for different scenarios and find that 802.11 is able to achieve more than 80% of the throughput as compared to optimal scheduling for all the scenarios considered. To explain this result, we then characterize the local topologies for which 802.11 scheduling results in a significant drop in throughput as compared to optimal scheduling.