By Topic

Delay analysis of tree algorithms with different additional of feedback information

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

1 Author(s)
Wattanamongkhol, N. ; Dept. of Electr. Eng., Burapha Univ., Chonburi, Thailand

This paper proposes three algorithms based on the contention tree algorithm to improve the system performance by utilizing the different additional of feedback information. These three algorithms are derived from adding of skipped slots and/or adaptive frame size strategies. Average access delay is analyzed to evaluate the system performance which is measured in term of the number of used slots in the collision resolution process. Numerical results show that the tree algorithm in conjunction with skipped slots and adaptive frame size schemes is superior to the other proposed algorithms and the optimum tree algorithm.

Published in:

ICT Convergence (ICTC), 2012 International Conference on

Date of Conference:

15-17 Oct. 2012