• Feb 07, 2023 News!JACN will adopt Article-by-Article Work Flow. The benefit of article-by-article workflow is that a delay with one article may not delay the entire issue. Once a paper steps into production, it will be published online soon.   [Click]
  • May 30, 2022 News!JACN Vol.10, No.1 has been published with online version.   [Click]
  • Dec 24, 2021 News!Volume 9 No 1 has been indexed by EI (inspec)!   [Click]
General Information
    • ISSN: 1793-8244 (Print)
    • Abbreviated Title:  J. Adv. Comput. Netw.
    • Frequency: Semiyearly
    • DOI: 10.18178/JACN
    • Editor-in-Chief: Professor Haklin Kimm
    • Executive Editor: Ms. Cherry Chan
    • Abstracting/ Indexing: EBSCO, ProQuest, and Google Scholar.
    • E-mail: jacn@ejournal.net
Editor-in-chief
Professor Haklin Kimm
East Stroudsburg University, USA
I'm happy to take on the position of editor in chief of JACN. We encourage authors to submit papers on all aspects of computer networks.

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-2024. Journal of Advances in Computer Networks.  All rights reserved.
E-mail: jacn@ejournal.net