{"title":"改进IEEE 802.11的带宽共享","authors":"Yassine Chetoui, N. Bouabdallah, J. Ben-othman","doi":"10.1109/LCN.2007.125","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a new solution to cope with the unfairness limitations of the distributed coordination function (DCF) algorithm. Our solution is based on multiple backoff windows principle. We demonstrate through simulations the efficiency of our proposal that enables fair bandwidth sharing and increase total network throughput.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Improving the Bandwidth Sharing in IEEE 802.11\",\"authors\":\"Yassine Chetoui, N. Bouabdallah, J. Ben-othman\",\"doi\":\"10.1109/LCN.2007.125\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a new solution to cope with the unfairness limitations of the distributed coordination function (DCF) algorithm. Our solution is based on multiple backoff windows principle. We demonstrate through simulations the efficiency of our proposal that enables fair bandwidth sharing and increase total network throughput.\",\"PeriodicalId\":333233,\"journal\":{\"name\":\"32nd IEEE Conference on Local Computer Networks (LCN 2007)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-10-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"32nd IEEE Conference on Local Computer Networks (LCN 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.2007.125\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2007.125","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we propose a new solution to cope with the unfairness limitations of the distributed coordination function (DCF) algorithm. Our solution is based on multiple backoff windows principle. We demonstrate through simulations the efficiency of our proposal that enables fair bandwidth sharing and increase total network throughput.