Proceedings of 3rd International Conference on Multimedia Technology(ICMT-13)

Study on a New Type of Discrete Random Contention System based on Binary Tree Conflict Resolution Algorithm

Authors
Guo Yingying, Ding Hongwei, Zhao Yifan, Nan Jing, Song Donghuan, Yu Pingping
Corresponding Author
Guo Yingying
Available Online November 2013.
DOI
https://doi.org/10.2991/icmt-13.2013.210How to use a DOI?
Keywords
Kew type of discrete random contention system, isolated binary tree conflict resolution algorithm, throughput, system performance.
Abstract
This paper proposed a new type of discrete random contention system based on the literature [1], researched it using the average cycle method, then get the formula of the systemic throughput for the new random access protocol by building mathematical modeling; but the uncertainty of random multiple access on frequency and time resulting in the conflict probability increases as the higher loading, therefore, introducing binary tree conflict resolution algorithm is very important to improve the channel utilization. The paper analyzed the isolated binary tree conflict resolution algorithm and then got the average length of timeslot of the algorithm; on the basis, the paper puts forward a new type of discrete random contention system based on binary tree conflict resolution algorithm. Analytic formulate for throughput of the new discrete random contention system and the system based on the conflict resolution algorithm are derived by building mathematical model and using the average cycle method. Finally, the computer simulation experiments show that the correctness of the theoretical, at the same time, show that the new discrete random contention system protocol based on binary tree conflict resolution algorithm is effective to further improve the system performance.
Open Access
This is an open access article distributed under the CC BY-NC license.

Download article (PDF)

Proceedings
3rd International Conference on Multimedia Technology(ICMT-13)
Part of series
Advances in Intelligent Systems Research
Publication Date
November 2013
ISBN
978-90-78677-89-5
ISSN
1951-6851
DOI
https://doi.org/10.2991/icmt-13.2013.210How to use a DOI?
Open Access
This is an open access article distributed under the CC BY-NC license.

Cite this article

TY  - CONF
AU  - Guo Yingying
AU  - Ding Hongwei
AU  - Zhao Yifan
AU  - Nan Jing
AU  - Song Donghuan
AU  - Yu Pingping
PY  - 2013/11
DA  - 2013/11
TI  - Study on a New Type of Discrete Random Contention System based on Binary Tree Conflict Resolution Algorithm
BT  - 3rd International Conference on Multimedia Technology(ICMT-13)
PB  - Atlantis Press
SP  - 1728
EP  - 1735
SN  - 1951-6851
UR  - https://doi.org/10.2991/icmt-13.2013.210
DO  - https://doi.org/10.2991/icmt-13.2013.210
ID  - Yingying2013/11
ER  -