On Reliability Bound and Improvement of Sensing-Based Semipersistent Scheduling in LTE-V2X

After the sensing-based semipersistent scheduling (SPS) is introduced in the media access control layer of the long-term evolution vehicle-to-everything (LTE-V2X) Mode 4, many tests have been conducted to measure its performance. However, until now, there is still no clear mathematical expression for the reliability of this scheduling. To this end, in this article, we attempt to provide the lower and upper bounds of the reliability and propose a distributed algorithm for improving reliability. First, we give a mathematical description of sensing-based SPS and apply packet pass rate (PPR) to represent its reliability. Then, we analyze the SPS without sensing and present a theoretical expression of the reliability, which is described as a function of channel busy rate (CBR). Second, an iterative approach is applied to analyze the sensing-based SPS, and the mathematical expressions of lower and upper-reliability bounds are derived. Third, based on the existing condition of the upper bound, we propose a reliability improvement solution, which utilizes a distributed algorithm to process added information, such as the counter and the offset for the remaining storage space. Finally, this solution is applied to LTE-V2X, and simulation shows that the proposed scheme can significantly improve the scheduling reliability.

Automated summary

This article aims to provide lower and upper bounds of the reliability of sensing-based semipersistent scheduling (SPS), and proposes a distributed algorithm for improving reliability.