Analysis of Improved Contention Resolution Algorithms and Throughput over RAC

Gao Fei; Guo Yanping; Zhao Dongfeng

PDF
Cite
Share

facebook

twitter

google

linkedin

Volume 30 Issue 2

Jan. 2018

Article Contents

Article Navigation > Journal of University of Electronic Science and Technology of China > 2001 > 30(2): 124-128,133

Gao Fei, Guo Yanping, Zhao Dongfeng. Analysis of Improved Contention Resolution Algorithms and Throughput over RAC[J]. Journal of University of Electronic Science and Technology of China, 2001, 30(2): 124-128,133.

Citation:

Gao Fei, Guo Yanping, Zhao Dongfeng. Analysis of Improved Contention Resolution Algorithms and Throughput over RAC[J]. Journal of University of Electronic Science and Technology of China, 2001, 30(2): 124-128,133.

Analysis of Improved Contention Resolution Algorithms and Throughput over RAC

1.
Department of Info. and E & E.,Yunnan Institute of The Nationalities Kunming 650031;
2.
Department of Communication Eng,Yunnan University Kunming 650091

Received Date: 2000-08-29
Publish Date: 2001-04-15

Abstract

This paper suggestes a new algorithm model of binary & ternary-tree contention resolution algorithm, and derives the mean slots formula used in resoluting collision. Comparing with basic contention resolution algorithm, this result gets a high efficiency. The throughput character of blocked access channel is also analyzed through computer simulation.
- random multiaccess channel,
- contention resolution algorithms,
- blocked access,
- time slot,
- throughput,
- computer simulation
References
Proportional views

通讯作者: 陈斌, bchen63@163.com

1.
沈阳化工大学材料科学与工程学院沈阳 110142

Get Citation

PDF

XML

Article Metrics

Article views(3672) PDF downloads(83) Cited by()

Proportional views