doi: 10.18178/JACN.2016.4.2.213
Research on Time Division Multi-channel p-Persistent CSMA Based on Binary Trees Conflict Resolution Mechanism
- Yunnan University, Kunming, 650091, China.
Abstract
With the rapid growth of wireless communication networks with vary kinds of business, more and more users get a colorful, high-quality information service, which also put forward higher requirements on the quality of service of wireless communication networks. The paper proposed a time division multi-channel p-persistent CSMA based on binary trees conflict resolution mechanism, designed slotted access and combining continuous-time access control clock, using p-persistent probability selection, conducted traffic control by multi-channel priority for random access system. The study use the advantages of integrated slot-type access control and continuous-time access control, with binary trees conflict resolution mechanism which could resolve the conflict and resent the information packets in conflict, such that the system performance has been improved. By modeling analysis, the p-persistent probability can control the protocol throughput. The analytical results and simulation results show that the theoretical analysis and simulation experiments are consistent. At the same time, simulations are also given overview of the probability slotted and time division protocol.
Keywords
- Wireless sensor network
- p-persistent CSMA
- binary tree conflict resolution
- multichannel
- throughput
How to Cite
Yifan Zhao, Shengjie Zhou, Hongwei Ding, Qianlin Liu, Zhijun Yang, and Chunfen Li, "Research on Time Division Multi-channel p-Persistent CSMA Based on Binary Trees Conflict Resolution Mechanism," Journal of Advances in Computer Networks, vol. 4, no. 2, pp. 111-115, 2016. https://doi.org/ 10.18178/JACN.2016.4.2.213
Copyright & License
Copyright © 2016 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).




