Abstract
With the development of the times, in the wireless sensor networks, the increasing amount of information transmission requires more advanced transmission protocols. Especially accompanied by the arrival of the era of Big Data, the conflicts between traditional transport agreement and the sudden or large amount of data are increasingly prominent. The discrete time three-dimensional probability CSMA protocol with multichannel mechanism proposed solves these problems pretty well. By the new MAC protocol to control transmission of information, so that the agreement adapts various contingencies problems in the network better and has more controllable ability. Using simulation tool MATLAB for the accuracy of the agreement is demonstrated.
Introduction
Wireless Sensor Networks (WSNs) serve as the foundational infrastructure for diverse applications ranging from environmental monitoring to industrial automation. However, the transition into the "Big Data" era has exposed significant limitations in traditional Carrier Sense Multiple Access (CSMA) protocols. In high-traffic scenarios, standard CSMA methods—where nodes sense the channel before transmitting—often lead to excessive packet collisions, increased latency, and reduced throughput.
The core issue identified by researchers is a lack of "controllability." Most existing protocols rely on a single transmission probability ($p$), which is insufficient for managing the complex, fluctuating states of a congested network. This paper introduces a novel discrete-time three-dimensional probability CSMA protocol designed to provide granular control over network access.
Methodology
The proposed protocol integrates two primary innovations: a three-dimensional probability control mechanism and a multichannel priority structure.
Three-Dimensional Probability Control
Unlike traditional models, this protocol utilizes three distinct transmission probabilities ($P1, P2, P3$) based on the instantaneous state of the channel:
- $P1$ (Idle State): Applied when the channel is detected as idle.
- $P2$ (Post-Busy Transition): Applied during the first idle slot immediately following a busy period. This is a critical "cooldown" phase where collisions are most likely to occur as multiple nodes wait for the channel to clear.
- $P3$ (Busy State): Applied when the channel is busy, determining the persistence with which a node attempts to gain access.
Multichannel Priority Mechanism
To further optimize performance, the system employs $N$ channels and $N$ priority levels. A service with priority $i$ is granted access to any channel from 1 to $i$. This architectural mapping ensures that high-priority data has access to a wider range of resources, effectively distributing load across multiple "highways."
Analysis and Simulation
The researchers utilized the average cycle analysis method to derive mathematical formulas for system throughput. These theoretical models were then validated using MATLAB R2010a. Packet arrivals were modeled as a Poisson process with an independent arrival rate parameter $G$.
Results and Discussion
The simulation results closely aligned with the theoretical derivations, confirming the robustness of the mathematical model.
- Throughput Scaling: The multichannel approach significantly enhanced total system throughput. In configurations with 4 or 5 channels, the aggregate throughput exceeded the theoretical limits of a single-channel system.
- Probability Sensitivity: Analysis showed that increasing $P1$ generally improves throughput by maximizing efficiency during idle periods. Conversely, increasing $P3$ (busy probability) was found to decrease throughput, as it makes nodes overly aggressive, leading to higher collision rates.
- Priority Performance: The mapping mechanism successfully prioritized critical data. High-priority channels maintained stable performance even as the overall arrival rate ($G$) increased, ensuring that time-sensitive information is transmitted reliably.
Conclusion
The proposed three-dimensional probability CSMA protocol offers a significant improvement over traditional methods for high-demand WSNs. By introducing state-aware probabilities and a structural priority mechanism, the protocol achieves higher throughput and better stability.
While the study demonstrates strong theoretical and simulated performance, future work should address real-world constraints such as signal fading, environmental noise, and the energy consumption overhead of monitoring multiple channels. Implementing this protocol on hardware like ZigBee or LoRa would provide valuable insights into its practical impact on battery life in field deployments.
Summary updated