Performance of Binary Tree Collision Resolution Algorithm of Random Access Channels

【Author】

Huang Huawei;Zhao Dongfeng;

【Abstract】

<正>This paper employs average cycle analysis method and binary tree collision resolution algorithm to analyze the performance of random access system.It studies the packet collision resolution in random multiple access system.The formula which the colliding packets are resoluted successfully is obtained.Also,the formula of throughput of two systems are given, one is the system employs binary tree collision resolution basic algorithm,the other is the system employs binary tree collision resolution advanced algorithm.Furthermore,the computer simulation results of packets collision resolution are given in this paper.We can obtain,compare to binary tree collision resolution basic algorithm,binary tree collision resolution advanced algorithm make a remarkable improvement for system. This paper employs average cycle analysis method and binary tree collision resolution algorithm to analyze the performance of random access system.It studies the packet collision resolution in random multiple access system.The formula which the colliding packets are resoluted successfully is obtained.Also,the formula of throughput of two systems are given, one is the system employs binary tree collision resolution basic algorithm,the other is the system employs binary tree collision resolution advanced algorithm.Furthermore,the computer simulation results of packets collision resolution are given in this paper.We can obtain,compare to binary tree collision resolution basic algorithm,binary tree collision resolution advanced algorithm make a remarkable improvement for system.

【Keywords】

Random multiple access;;Binary tree collision resolution;;The average cycle method;;Throughput

References

To explore the background and basis of the node document

Springer Journals Database

Total: 6 articles

• [1] Zhao Dongfeng;Li Bihai;Zheng Sumin(Department of Information and Electronics,Yunnan University Kunming 650091), Study on Two-Ary Trees Algorithms of Packet Conflict Resolution for Random Access Channels, JOURNAL OF UNIVERSITY OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA,
• [2] Zhao Dongfeng Li Bihai Zheng Sumin (Department of Information and Electronic Science, Yunnan University, Kunming 650091), STUDY ON A NEW METHOD FOR THE SLOTTED ACCESS CHANNEL, 电子科学学刊,
• [3] Huang Jiancheng,Xie Hai, Xu Bingzheng(South China Institute of Technology), Pretested Random Tree Protocols for Packet Conflict Resolution, Journal of China Institute of Communications,
• [4] Gliwicz ZW, Pijanowska J, The role of predation in zooplankton succession, Plankton Ecology: Succession in Plankton Communities,

More>>

Similar documents

Documents that have the similar content to the node document

Springer Journals Database

Total: 309 articles

More>>