• Mar 31, 2016 News!JACN Vol.3, No.3 has been indexed by EI (inspec)!   [Click]
  • Jun 24, 2016 News!JACN Vol.4, No.2 has been published with online version. 15 papres about advances in computer networks are published in this issue.   [Click]
  • Mar 31, 2016 News!JACN Vol.3, No.2 has been indexed by EI (inspec)!   [Click]
General Information
    • ISSN: 1793-8244
    • Frequency: Quarterly
    • DOI: 10.18178/JACN
    • Editor-in-Chief: Dr. Ka Wai Gary Wong
    • Executive Editor: Ms. Julia S. Ma
    • Abstracting/ Indexing: EI (INSPEC, IET), Engineering & Technology Digital Library, DOAJ, Electronic Journals Library, Ulrich's Periodicals Directory, International Computer Science Digital Library (ICSDL), ProQuest, and Google Scholar.
    • E-mail: jacn@ejournal.net
Editor-in-chief
Dr. Ka Wai Gary Wong
Department of Mathematics and Information Technology The Hong Kong Institute of Education, Hong Kong
It's a honor to serve as the editor-in-chief of JACN. I'll work together with the editors and reviewers to help the journal progress
JACN 2016 Vol.4(2): 111-115 ISSN: 1793-8244
DOI: 10.18178/JACN.2016.4.2.213

Research on Time Division Multi-channel p-Persistent CSMA Based on Binary Trees Conflict Resolution Mechanism

Yifan Zhao, Shengjie Zhou, Hongwei Ding, Qianlin Liu, Zhijun Yang, and Chunfen Li
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.

Index Terms—Wireless sensor network, p-persistent CSMA, binary tree conflict resolution, multichannel, throughput.

The authors are with Yunnan University, Kunming, 650091, China (e-mail: 814627093@qq.com, zhoushengjie@hotmail.com, dhw1964@163.com).

[PDF]

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.

Copyright © 2008-2016. Journal of Advances in Computer Networks.  All rights reserved.
E-mail: jacn@ejournal.net