[Keyword: Wireless LAN] AND [All Categories: Bioinformatics & Computational Biology] : Search

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Advanced Search

SEARCH GUIDE

Results: 1 - 1of1

Follow results:

per page:

Sort: Relevance

Context for search term 1Search term 1*

All Dates

LastSelect static range

Custom Range

Select starting monthSelect starting year

Select ending monthSelect ending year

Search name	Searched On	Run search
[Keyword: Biomechanics] AND [All Categories: Nanofabrication & Nanomanipulation] (2)	29 Mar 2025	Run
[Keyword: Wireless LAN] AND [All Categories: Bioinformatics & Computational Bio... (1)	29 Mar 2025	Run
[Keyword: Biomechanics] AND [All Categories: Computer Science] (10)	29 Mar 2025	Run
[Keyword: Transparency] AND [All Categories: Mathematical Finance / Quantitative Fi... (4)	29 Mar 2025	Run
[Keyword: Crookes Tube] AND [All Categories: Biochemistry] (1)	29 Mar 2025	Run

chapterNo Access
A Novel Adaptive Backoff Scheme for IEEE 802.11 Wireless Networks
- J. Fan,
- F. Gao,
- Y. B. Cheng, and
- W. S. Wang
Information Computing and Automation01 Apr 2008
Preview Abstract
In this paper, a new adaptive minimum contention window binary exponential backoff algorithm (referred to as AWBEB algorithm) is proposed to improve the performance of IEEE 802.11 Distributed Coordination Function (DCF) scheme, which is widely used for Ad Hoc networks and wireless LAN. We model the AWBEB algorithm scheme via establishing a bidimensional discrete-time Markov Chain, and the stationary distribution probabilities of AWBEB algorithm are derived. The performance of AWBEB algorithm is analyzed, and then AWBEB algorithm is simulated by computer programming. The analytical and numerical results show that the system saturation throughput and medium access delay of a packet for a given number of nodes N are better than the DCF algorithm.

1