首页 | 期刊大全 | 知识经纪人 | 在线阅览室 | 学者空间 | 学术机构 | 热点专题 | 学术论坛 | 论文发表 | EI检索会议 | 教育培训
高级搜索 | 专业检索
您的位置:网站首页 > 《中文科技期刊数据库》 > 工程技术 > 电子电信 > 通信 > 摘要

RWBO(pd, w): A Novel Backoff Algorithm for IEEE 802.11 DCF

YunLi Ke-PingLong Feng-RuiYang   SpecialResearchCentreforOpticalInternetandWirelessInformationNetworksChongqingUniversityofPostsandTelecommunications Chongqing400065 P.R.China//NationalDefenseKeyLabofAnti-InterferenceCommunicationTechnology SpecialResearchCentreforOpticalInternetandWirelessInformationNetworksChongqingUniversityofPostsandTelecommunications Chongqing400065 P.R.China
摘要:The Probability Distribution of Slot Selection (PDoSS) of IEEE 802.11 DCF is extremely uneven, which makes the packet collision probability very high. In this paper, the authors explore how to make the stations select the slots uniformly, and give an RWBO(pd,w) algorithm for 802.11 DCF to make the PDoSS even and decrease the packet collision probability. A Markov model is given to analyze the PDoSS of RWBO(pa, w). The performance of RWBO(pd, w) is evaluated by simulation in terms of saturation throughput and packet collision probability. The simulation results indicate that RWBO(pa, w) can decrease the packet contention probability to a large extent, and utilize the channel more efficiently as compared to the 802.11 DCF. Moreover, the relation between saturation throughput and walking probability (pd), the relation between saturation throughput and contention windows (w), the relation between packet collision probability and walking probability (pal), and the relation between packet collision probability and contention windows (w) are analyzed. The analysis indicates that RWBO(pd, w) has some remarkable features: its saturation throughout keeps high and packet collision probability keeps very low (under 0.1) in a large range of pd and w, which allow users to configure Pd and w more flexibly.
格式:PDF     页数:6 页     页码范围:276-281页
学科分类:
关 键 词:RWBO IEEE802.11 DCF PDoSS 马尔可夫链 随机补偿
来源期刊:《计算机科学技术学报:英文版》2005年 第2期
收录数据库:中文科技期刊数据库
评论该作品 收藏到我的维普