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

Yifan ZhaoJournal of Advances in Computer Networks 2016 · DOI

Abstract

Wireless sensor networks (WSNs) increasingly require high-quality service to handle diverse data types. This paper proposes a time division multi-channel p-persistent CSMA protocol utilizing a binary tree conflict resolution mechanism. By integrating slotted and continuous-time access control with priority-based multi-channel allocation, the system improves throughput stability and quality of service (QoS). Analytical and simulation results confirm the protocol's effectiveness in managing high-traffic loads.

Introduction

As Wireless Sensor Networks (WSNs) grow in scale and complexity, they must support a wide range of applications, from routine environmental monitoring to time-critical control signals. Traditional Medium Access Control (MAC) protocols often suffer from performance degradation due to packet collisions and a lack of robust Quality of Service (QoS) mechanisms. When traffic increases, standard random access systems can "collapse" as backoff timers become inefficient. This research addresses these challenges by introducing a hybrid access control system designed to maintain stability and prioritize critical data.

Proposed Protocol: Methods and Architecture

The proposed protocol, Time Division Multi-channel p-Persistent CSMA, is built upon three core innovations:

  1. Hybrid Access Control: To balance latency and order, the system employs a "hybrid clock." It operates in continuous-time mode when the channel is idle to minimize access delay. Upon detecting a busy channel or the start of a transmission slot, it transitions to a slotted (discrete-time) mode, ensuring synchronized access during periods of high activity.
  2. Binary Tree Conflict Resolution: Unlike standard protocols that rely on random backoff delays, this protocol implements a binary tree algorithm. When a collision is detected, the contending nodes are systematically split into groups (branches) and retransmitted in a structured sequence until all conflicts are resolved. This prevents the exponential increase in collisions typical of high-load scenarios.
  3. Multi-channel Priority Mapping: The protocol utilizes $N$ available channels to provide QoS. Priorities are assigned from 1 to $N$, where a service with priority $i$ is granted access to channels 1 through $i$. This nested structure ensures that higher-priority traffic has a wider selection of resources, reducing its probability of blocking.
Multi-channel priority mapping architecture.

The researchers validated the protocol using the average cycle method to derive theoretical throughput formulas, which were then tested against stochastic simulations in MATLAB R2010a. Packet arrivals were modeled following a Poisson distribution, with propagation delay ($a$) and transmission probability ($p$) as key controlled variables.

Key Results and Performance Analysis

The study yielded several critical insights into the protocol's performance:

  • Stability and Throughput: The binary tree mechanism successfully stabilized the system. While traditional CSMA protocols often see throughput drop sharply as the arrival rate ($G$) increases, this protocol maintains a stable throughput level even under heavy traffic.
  • QoS Differentiation: The multi-channel priority scheme effectively separated traffic classes. As shown in the simulation results, higher-priority levels consistently achieved greater throughput compared to lower-priority levels.
  • Model Accuracy: There was a near-perfect match between the mathematically derived theoretical values and the simulation data, confirming the reliability of the analytical model.
Throughput performance across different priority levels.

Furthermore, the transmission probability $p$ was found to be a powerful "control knob," allowing network administrators to tune the protocol's performance to specific environmental requirements. As the number of channels ($N$) increased, the total system throughput scaled effectively, reaching peak values significantly higher than single-channel alternatives.

Conclusion

The proposed time division multi-channel p-persistent CSMA protocol offers a robust solution for high-traffic WSNs. By combining hybrid timing, structured conflict resolution, and priority-based resource allocation, it ensures stable throughput and clear QoS differentiation. While future work should consider non-ideal channel conditions and the energy overhead of these mechanisms on low-power hardware, the current findings provide a strong theoretical and simulation-based foundation for advanced MAC layer design.

Summary updated

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.
BibTeX
@article{zhao2016research,
  author = {Yifan Zhao},
  title = {{Research on Time Division Multi-channel p-Persistent CSMA Based on Binary Trees Conflict Resolution Mechanism}},
  journal = {Journal of Advances in Computer Networks},
  year = {2016},
  doi = {10.18178/jacn.2016.4.2.213},
}
Figure