TY - GEN
T1 - An Efficient Rescheduling Scheme for Prioritizing Safety Messages in VANETs
AU - Kumar, Virender
AU - Gupta, Nishu
AU - Gottapu, Srinivasa Kiran
N1 - Publisher Copyright:
© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2026.
PY - 2026
Y1 - 2026
N2 - The growing demand among users of mobile devices to swiftly access information items, coupled with the swift creation of new services and applications in automotive environments has led to the introduction of road side units (RSUs) along the roads. These RSUs facilitate the broadcasting of data during communication between the infrastructure and the vehicle. Vehicular Ad-hoc Networks (VANETs) face challenges such as frequent connection changes, a sizeable topological region, location variations, and varying speed of vehicles. In vehicular scenarios, messages are typically categorized into safety and non-safety messages. Efficient broadcasting of safety messages in vehicular scenarios requires message scheduling, with the highest priority given to crucial messages. This paper proposes an Optimum efficient scheme for organizing messages in VANETs. This scheme reschedules messages based on parameters such as data size, quantity of data sought, speed of vehicle, and message deadline. To differentiate messages pertaining to safety with those from non-safety messages, a message factor is taken into consideration. Priorities for service requests or messages are established using these parameters, and messages are rescheduled accordingly. Simulation results demonstrate the superior performance of the proposed algorithm compared to recent and relevant schemes.
AB - The growing demand among users of mobile devices to swiftly access information items, coupled with the swift creation of new services and applications in automotive environments has led to the introduction of road side units (RSUs) along the roads. These RSUs facilitate the broadcasting of data during communication between the infrastructure and the vehicle. Vehicular Ad-hoc Networks (VANETs) face challenges such as frequent connection changes, a sizeable topological region, location variations, and varying speed of vehicles. In vehicular scenarios, messages are typically categorized into safety and non-safety messages. Efficient broadcasting of safety messages in vehicular scenarios requires message scheduling, with the highest priority given to crucial messages. This paper proposes an Optimum efficient scheme for organizing messages in VANETs. This scheme reschedules messages based on parameters such as data size, quantity of data sought, speed of vehicle, and message deadline. To differentiate messages pertaining to safety with those from non-safety messages, a message factor is taken into consideration. Priorities for service requests or messages are established using these parameters, and messages are rescheduled accordingly. Simulation results demonstrate the superior performance of the proposed algorithm compared to recent and relevant schemes.
KW - Message deadline
KW - Message factor
KW - RSUs
KW - V2I
KW - V2V
KW - VANETs
UR - https://www.scopus.com/pages/publications/105014424684
U2 - 10.1007/978-3-031-94280-8_2
DO - 10.1007/978-3-031-94280-8_2
M3 - Conference article in proceedings
AN - SCOPUS:105014424684
SN - 978-3-03-194279-2
T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
SP - 14
EP - 26
BT - Advanced Technologies in Electronics, Communications and Signal Processing - 1st EAI International Conference, ICATECS 2024
A2 - Koganti, Krishna Kishore
A2 - E., Sreenivasa Rao
A2 - Gupta, Nishu
PB - Springer
T2 - 1st EAI International Conference on Advanced Technologies in Electronics, Communications, and Signal Processing, ICATECS 2024
Y2 - 26 July 2024 through 27 July 2024
ER -