Random Multiple Access Protocol combined Binary Tree Conflict-resolving Algorithm and the 1-persistent CSMA Protocol

DOI

10.2991/icmt-13.2013.151How to use a DOI?

Keywords

1-persistent CSMA; binary tree conflict resolving algorithm; throughput; the number of time-slots; random multiple access.

Abstract

This paper presents a new random multiple access control protocol – 1-persistent CSMA control protocol based on improved binary tree conflict resolution algorithm. First, the paper gives an outline of 1-persistent CSMA and the binary tree conflict-resolving algorithm by building a mathematical model and using the average cycle method, and then respectively obtains the throughput and the number of time-slots of the protocol and the algorithm. The simulation results are given, and agree well with theoretical values. But, in a shared channel, each user independently sends information packets randomly, and it is prone to conflict and resulting in the failure. Especially to the 1-persistent CSMA control protocol, when the load is larger, it has a lower throughput and greatly increasing the probability of channel conflict. Therefore, bringing in the binary tree conflict-resolving algorithm is a good method to improve the throughput, especially the improved binary tree conflict resolution algorithm. So at last, the paper introduces the random multiple access protocol combined improved binary tree conflict resolution algorithm and 1-persistent CSMA protocol, obtains the throughput and gives the simulations of the joint protocol. Theoretical calculations and experimental results show that 1-persistent CSMA protocol with conflict-resolving has a better performance.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Zhao Yifan
AU  - Ding Hongwei
AU  - Gao Yangshui
AU  - Guo Yingying
AU  - Nan Jing
AU  - Yu Pingping
PY  - 2013/11
DA  - 2013/11
TI  - Random Multiple Access Protocol combined Binary Tree Conflict-resolving Algorithm and the 1-persistent CSMA Protocol
BT  - Proceedings of 3rd International Conference on Multimedia Technology(ICMT-13)
PB  - Atlantis Press
SP  - 1227
EP  - 1234
SN  - 1951-6851
UR  - https://doi.org/10.2991/icmt-13.2013.151
DO  - 10.2991/icmt-13.2013.151
ID  - Yifan2013/11
ER  -