DocumentCode :
2615440
Title :
Delay analysis of tree algorithms with different additional of feedback information
Author :
Wattanamongkhol, Norrarat
Author_Institution :
Dept. of Electr. Eng., Burapha Univ., Chonburi, Thailand
fYear :
2012
fDate :
15-17 Oct. 2012
Firstpage :
458
Lastpage :
461
Abstract :
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.
Keywords :
access protocols; delays; multi-access systems; trees (mathematics); access delay; adaptive frame size schemes; adaptive frame size strategy; collision resolution process; contention tree algorithm; contention-based medium access; delay analysis; different additional; feedback information; optimum tree algorithm; skipped slots; system performance evaluation; tree algorithms; Algorithm design and analysis; Base stations; Binary trees; Delay; Protocols; System performance; Wireless communication; Contention-based medium access; MAC protocol; delay analysis; wireless communication system;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
ICT Convergence (ICTC), 2012 International Conference on
Conference_Location :
Jeju Island
Print_ISBN :
978-1-4673-4829-4
Electronic_ISBN :
978-1-4673-4827-0
Type :
conf
DOI :
10.1109/ICTC.2012.6387175
Filename :
6387175
Link To Document :
بازگشت