Title :
Performance of the improved Q-ary contention resolution algorithm over blocked random multi-access channel
Author :
Fei, Gao ; Dongfeng, Zhao
Author_Institution :
Dept. of Inform. & Electr. Eng., Yunnan Inst. of the Nationalities, Kunming, China
Abstract :
The tree-based algorithm is an important contention resolution mechanism that was applied to the random multi-access channel. This paper reported an improved Q-ary tree algorithms (ITAQ) scheme. The theoretical analyses and computer simulation indicate that the performance of ITAQ is better than the basic binary and ternary tree algorithm at throughput and access delay
Keywords :
access protocols; multi-access systems; multiuser channels; queueing theory; random processes; trees (mathematics); access delay; binary tree algorithm; blocked random multi-access channel; channel access protocol; computer simulation; improved Q-ary contention resolution algorithm; improved Q-ary tree algorithms; random multi-access channel; random-access system; ternary tree algorithm; throughput; Algorithm design and analysis; Artificial satellites; Computer networks; Computer simulation; Delay; Radio network; Radio transmitters; Satellite broadcasting; State feedback; Throughput;
Conference_Titel :
Info-tech and Info-net, 2001. Proceedings. ICII 2001 - Beijing. 2001 International Conferences on
Conference_Location :
Beijing
Print_ISBN :
0-7803-7010-4
DOI :
10.1109/ICII.2001.983588
