A reliable merging link scheme using weighted Markov Chain Model in vehicular Ad Hoc networks

Abstract

The vehicular ad hoc network (VANET) is a potential technology for intelligent transportation systems (ITS) that aims to improve safety by allowing vehicles to communicate quickly and reliably. The rates of merging collision and hidden terminal problems, as well as the problems of picking the best match cluster head (CH) in a merged cluster, may emerge when two or more clusters are merged in the design of a clustering and cluster management scheme. In this paper, we propose an enhanced cluster‐based multi‐access channel protocol (ECMA) for high‐throughput and effective access channel transmissions while minimizing access delay and preventing collisions during cluster merging. We devised an aperiodic and acceptable merge cluster head selection (MCHS) algorithm for selecting the optimal merge cluster head (MCH) in centralized clusters where all nodes are one‐hop nodes during the merging window. We also applied a weighted Markov chain mathematical model to improve accuracy while lowering ECMA channel data access transmission delay during the cluster merger window. We presented extensive simulation data to demonstrate the superiority of the suggested approach over existing state‐of‐the‐arts. The implementation of a MCHS algorithm and a weight chain Markov model reveal that ECMA is distinct and more efficient by 64.20–69.49% in terms of average network throughput, end‐to‐end delay, and access transmission probability.