Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

Logarithm increase-linear decrease backoff algorithm based on self-adaptive optimal contention window

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Shi Suming ; Dept. of Inf. & Eng., Jiangxi Normal Univ., Nanchang, China ; Yang Zhi ; Deng Mingxing ; Peng Yali

According to different sizes of wireless sensor network (WSN), we propose a novel backoff algorithm of self-adaptive optimal contention window (SA-LL). The algorithm uses the number of nodes of competitive channel as logarithm function parameter, it not only dynamically adjusts contention window to optimal value but also makes the trend of backoff more reasonable. At the same time, the algorithm uses probability of transmission for linear parameter. It not only effectively resolves the disadvantages of BEB algorithm that it doesn't record the current congestion and backoff times but also improves the problem of slowly linear change of MILD algorithm. Simulation results show that the algorithm can accurately estimate the congestion of the network and can improve the performances of the throughput, delay and fair.

Published in:

Computer Application and System Modeling (ICCASM), 2010 International Conference on  (Volume:10 )

Date of Conference:

22-24 Oct. 2010