Analysis of dual clock detection probability Random Multiple Access Protocol

Zhi Xu, Yifan Zhao, Hongwei Ding, Shengjie Zhou, Longjun Liu2016 · DOI

Abstract

In wireless sensor networks, traffic load moments for nodes are constantly changing; the basis of standard CSMA protocols for idle channels does not operate effectively under these conditions. To address this problem, this paper analyzes the deficiencies of basic CSMA protocols. To improve the utilization of idle periods, we propose a new protocol: the double clock P-detection CSMA random multiple access protocol. Using the average cycle approach for protocol analysis, we derived the mathematical expression for system throughput. Simulation results demonstrate the advantages of this dual clock protocol, showing it makes full use of channel idleness and maintains relatively stable throughput even at high loads.

Introduction

In Wireless Sensor Networks (WSNs) and emerging fields like vehicle-to-everything (V2X) networking, channel resources are a precious commodity. Most systems rely on Carrier Sense Multiple Access (CSMA) protocols, where a node "listens" to the channel before transmitting data. If the channel is busy, the node waits; if it is idle, it sends.

However, standard CSMA variants face significant efficiency challenges:

  • Non-persistent CSMA is often too cautious, leading to underutilized channels.
  • 1-persistent CSMA is overly aggressive, causing massive collisions during high-traffic periods.
  • P-persistent CSMA attempts a middle ground but often fails to optimize the "idle period"—the gaps between transmissions.

The core inefficiency lies in how these protocols handle the transition between idle and busy states, often wasting potential transmission time.

The Dual Clock P-Detection Protocol

The proposed Dual Clock P-detection CSMA protocol hybridizes continuous and discrete time-sensing to adapt to the channel's state. The "dual" nature refers to the system's timing mechanism:

  1. Busy Period (Discrete): When the channel is busy, the system operates on a slotted timeline. Nodes monitor the channel and, once it becomes idle, attempt to transmit in the next slot with a probability $P$.
  2. Idle Period (Continuous): When the channel is already idle, the system uses a continuous clock. If a packet arrives during this time, it is sent immediately with probability $P$.

By combining continuous sensing for speed and discrete slotting for collision avoidance during high traffic, the protocol minimizes the idle rate and maximizes successful transmissions.

Figure 1: Timing diagram of the average cycle approach used to analyze the protocol's mathematical throughput.

The authors utilized the average cycle approach (illustrated in Figure 1) to derive a formal mathematical expression for system throughput ($S$), grounding the logic in rigorous probability theory.

Simulation and Performance Analysis

The protocol was evaluated using a Matlab R2012b simulation environment. Packet arrivals were modeled using a Poisson distribution, with propagation delay ($a$) set to 0.1 and information packet length set to 1 unit. The new protocol was benchmarked against three standards: non-persistent, 1-persistent, and standard p-detection CSMA.

Key Results

The simulation results reveal a clear hierarchy of performance across different traffic loads (Reach $G$).

Figure 2: Throughput (S) vs. Traffic Load (G) comparison between the new dual clock agreement and standard CSMA protocols.
  • 1-persistent CSMA: Performed the worst, with throughput dropping toward zero as load increased due to constant collisions.
  • Non-persistent CSMA: Showed high initial throughput but suffered a sharp decline as the arrival rate increased.
  • Dual Clock Protocol: Outperformed all others, maintaining the highest throughput across the widest range of traffic loads. Most importantly, its performance curve declined much more slowly, proving its robustness for high-density environments like smart cities.

Conclusion

The dual clock mechanism provides a significant advantage by adapting to the immediate state of the network rather than applying a one-size-fits-all timing rule. While the current study assumes an ideal channel without background noise, the results suggest that this protocol is a strong candidate for high-load wireless environments. Future work will involve testing under non-ideal channel conditions and exploring dynamic adjustments to the probability $P$ based on real-time traffic density.

Summary updated

Abstract

In wireless sensor networks, traffic load moment node are changing ;the basis of CSMA protocol for idle channels not do effectively. To address this problem, analysis the lack of basic CSMA protocol, in order to improve the utilization of CSMA protocol idle, we come up with a new protocol which is the double clock P detection CSMA random multiple access protocol. Using the average cycle[1] approach to protocol analysis, and finally got the mathematical expression of system throughput. Final simulation results show the advantage of dual clock random probability of detection CSMA multiple access protocol , make full use of channel's idle , and this agreement can remain relatively stable throughput at a high load.
BibTeX
@misc{xu2016analysis,
  author = {Zhi Xu and Yifan Zhao and Hongwei Ding and Shengjie Zhou and Longjun Liu},
  title = {{Analysis of dual clock detection probability Random Multiple Access Protocol}},
  year = {2016},
  doi = {10.2991/mmebc-16.2016.120},
}

Loading related content...

Figure