Abstract

Channel congestion is one of the major challenges for IEEE 802.11p-based vehicular networks. Unless controlled, congestion increases with vehicle density, leading to high packet loss and degraded safety application performance. We study two classes of congestion control algorithms, i.e., reactive state-based and linear adaptive. In this paper, the reactive state-based approach is represented by the decentralized congestion control framework defined in the European Telecommunications Standards Institute. The linear adaptive approach is represented by the LInear MEssage Rate Integrated Control (LIMERIC) algorithm. Both approaches control safety message transmissions as a function of channel load [i.e., channel busy percentage (CBP)]. A reactive state-based approach uses CBP directly, defining an appropriate transmission behavior for each CBP value, e.g., via a table lookup. By contrast, a linear adaptive approach identifies the transmission behavior that drives CBP toward a target channel load. Little is known about the relative performance of these approaches and any existing comparison is limited by incomplete implementations or stability anomalies. To address this, this paper makes three main contributions. First, we study and compare the two aforementioned approaches in terms of channel stability and show that the reactive state-based approach can be subject to major oscillation. Second, we identify the root causes and introduce stable reactive algorithms. Finally, we compare the performance of the stable reactive approach with the linear adaptive approach and the legacy IEEE 802.11p. It is shown that the linear adaptive approach still achieves a higher message throughput for any given vehicle density for the defined performance metrics.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.