{"title":"在多速率无线局域网中按比例公平分配资源","authors":"J. Champati, P. Chaporkar","doi":"10.1109/NCC.2011.5734707","DOIUrl":null,"url":null,"abstract":"Since IEEE has standardized 802.11 protocol for WLANs, significant work has been done in developing rate adaptation algorithms. Most of the rate adaptation algorithms proposed till now are heuristic, suboptimal and are competitive in nature. Even though these algorithms have advantage of implementing in distributed fashion, their throughput performance will be low as these schemes may converge to inefficient Nash equilibrium [1]. On the other hand users may cooperatively choose their rates so that a social optimum can be achieved, but there are no known algorithms that do rate adaptation cooperatively and still be implemented in a distributed fashion. In this paper, we aim at designing a distributed algorithm that achieves a social optimum (by doing rate adaptation cooperatively) while guaranteeing proportional fairness. We also propose an efficient centralized algorithm which serves the same purpose as the distributed algorithm.","PeriodicalId":158295,"journal":{"name":"2011 National Conference on Communications (NCC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Proportionally fair resource allocation in multi-rate WLANs\",\"authors\":\"J. Champati, P. Chaporkar\",\"doi\":\"10.1109/NCC.2011.5734707\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Since IEEE has standardized 802.11 protocol for WLANs, significant work has been done in developing rate adaptation algorithms. Most of the rate adaptation algorithms proposed till now are heuristic, suboptimal and are competitive in nature. Even though these algorithms have advantage of implementing in distributed fashion, their throughput performance will be low as these schemes may converge to inefficient Nash equilibrium [1]. On the other hand users may cooperatively choose their rates so that a social optimum can be achieved, but there are no known algorithms that do rate adaptation cooperatively and still be implemented in a distributed fashion. In this paper, we aim at designing a distributed algorithm that achieves a social optimum (by doing rate adaptation cooperatively) while guaranteeing proportional fairness. We also propose an efficient centralized algorithm which serves the same purpose as the distributed algorithm.\",\"PeriodicalId\":158295,\"journal\":{\"name\":\"2011 National Conference on Communications (NCC)\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-03-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 National Conference on Communications (NCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCC.2011.5734707\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2011.5734707","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Proportionally fair resource allocation in multi-rate WLANs
Since IEEE has standardized 802.11 protocol for WLANs, significant work has been done in developing rate adaptation algorithms. Most of the rate adaptation algorithms proposed till now are heuristic, suboptimal and are competitive in nature. Even though these algorithms have advantage of implementing in distributed fashion, their throughput performance will be low as these schemes may converge to inefficient Nash equilibrium [1]. On the other hand users may cooperatively choose their rates so that a social optimum can be achieved, but there are no known algorithms that do rate adaptation cooperatively and still be implemented in a distributed fashion. In this paper, we aim at designing a distributed algorithm that achieves a social optimum (by doing rate adaptation cooperatively) while guaranteeing proportional fairness. We also propose an efficient centralized algorithm which serves the same purpose as the distributed algorithm.