基于RTS/CTS的IEEE 802.11 DCF排队理论模型

The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004. Pub Date : 2004-04-25 DOI:10.1109/LANMAN.2004.1338396

Mustafa Özdemir, A. B. McDonald

{"title":"基于RTS/CTS的IEEE 802.11 DCF排队理论模型","authors":"Mustafa Özdemir, A. B. McDonald","doi":"10.1109/LANMAN.2004.1338396","DOIUrl":null,"url":null,"abstract":"An M/MMG1/1/K queuing model is developed for the analysis of IEEE 802.11 DCF using RTS/CTS. Results are based on arbitrary contention conditions, namely, collision probabilities, transmission probabilities and contention window sizes that vary arbitrarily among nodes contending for channel access. This is fundamentally different from the earlier works. Results are presented for the fully-connected case and validated via simulation with statistical analysis. The main contributions are the analysis of DCF and the foundation for the analysis of multi-hop scenarios. A key element of the model is the effective reduction of the normally encountered complexity by effectively restoring the independence between service times and packet inter-arrivals.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"A queuing theoretic model for IEEE 802.11 DCF using RTS/CTS\",\"authors\":\"Mustafa Özdemir, A. B. McDonald\",\"doi\":\"10.1109/LANMAN.2004.1338396\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An M/MMG1/1/K queuing model is developed for the analysis of IEEE 802.11 DCF using RTS/CTS. Results are based on arbitrary contention conditions, namely, collision probabilities, transmission probabilities and contention window sizes that vary arbitrarily among nodes contending for channel access. This is fundamentally different from the earlier works. Results are presented for the fully-connected case and validated via simulation with statistical analysis. The main contributions are the analysis of DCF and the foundation for the analysis of multi-hop scenarios. A key element of the model is the effective reduction of the normally encountered complexity by effectively restoring the independence between service times and packet inter-arrivals.\",\"PeriodicalId\":245218,\"journal\":{\"name\":\"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LANMAN.2004.1338396\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LANMAN.2004.1338396","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 19

摘要

为了分析IEEE 802.11 DCF，利用RTS/CTS建立了M/MMG1/1/K排队模型。结果基于任意竞争条件，即冲突概率、传输概率和竞争窗口大小，这些条件在竞争通道访问的节点之间任意变化。这与早期的作品有着根本的不同。给出了全连通情况下的结果，并通过统计分析进行了仿真验证。主要贡献是对DCF的分析，为多跳场景的分析奠定了基础。该模型的一个关键元素是通过有效地恢复服务时间和数据包间到达之间的独立性来有效地减少通常遇到的复杂性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A queuing theoretic model for IEEE 802.11 DCF using RTS/CTS

An M/MMG1/1/K queuing model is developed for the analysis of IEEE 802.11 DCF using RTS/CTS. Results are based on arbitrary contention conditions, namely, collision probabilities, transmission probabilities and contention window sizes that vary arbitrarily among nodes contending for channel access. This is fundamentally different from the earlier works. Results are presented for the fully-connected case and validated via simulation with statistical analysis. The main contributions are the analysis of DCF and the foundation for the analysis of multi-hop scenarios. A key element of the model is the effective reduction of the normally encountered complexity by effectively restoring the independence between service times and packet inter-arrivals.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.

自引率

0.00%

发文量