{"title":"一种具有数据包冲突的分布式吞吐量最优CSMA","authors":"T. Kim, J. Ni, N. Vaidya","doi":"10.1109/WIMESH.2010.5507899","DOIUrl":null,"url":null,"abstract":"This paper addresses a distributed throughput- optimal CSMA for wireless networks, which is called the preemptive CSMA. Distinguished from other throughput-optimal CSMAs in the literature, it achieves the optimality even with the throughput loss caused by discrete backoff time, non-zero carrier sense delay and data packet collisions. Moreover, the analysis on the preemptive CSMA provides the understanding on the relationship among the throughput-optimal CSMAs.","PeriodicalId":368847,"journal":{"name":"2010 Fifth IEEE Workshop on Wireless Mesh Networks","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Distributed Throughput-Optimal CSMA with Data Packet Collisions\",\"authors\":\"T. Kim, J. Ni, N. Vaidya\",\"doi\":\"10.1109/WIMESH.2010.5507899\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses a distributed throughput- optimal CSMA for wireless networks, which is called the preemptive CSMA. Distinguished from other throughput-optimal CSMAs in the literature, it achieves the optimality even with the throughput loss caused by discrete backoff time, non-zero carrier sense delay and data packet collisions. Moreover, the analysis on the preemptive CSMA provides the understanding on the relationship among the throughput-optimal CSMAs.\",\"PeriodicalId\":368847,\"journal\":{\"name\":\"2010 Fifth IEEE Workshop on Wireless Mesh Networks\",\"volume\":\"78 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Fifth IEEE Workshop on Wireless Mesh Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WIMESH.2010.5507899\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Fifth IEEE Workshop on Wireless Mesh Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIMESH.2010.5507899","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Distributed Throughput-Optimal CSMA with Data Packet Collisions
This paper addresses a distributed throughput- optimal CSMA for wireless networks, which is called the preemptive CSMA. Distinguished from other throughput-optimal CSMAs in the literature, it achieves the optimality even with the throughput loss caused by discrete backoff time, non-zero carrier sense delay and data packet collisions. Moreover, the analysis on the preemptive CSMA provides the understanding on the relationship among the throughput-optimal CSMAs.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
