Cover Image

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

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 m...

Full description

Saved in:
Bibliographic Details
Main Authors: Emmanuel, Siman, Isnin, Ismail Fauzi, Mohamad, Mohd. Murtadha
Format: Article
Language:English
Published: MDPI 2022
Subjects:
QA75 Electronic computers. Computer science
Online Access:http://eprints.utm.my/104021/1/SimanEmmanuel2022_AReliableMergingLinkScheme.pdf
http://eprints.utm.my/104021/
http://dx.doi.org/10.3390/s22134861
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.104021
record_format eprints
spelling my.utm.1040212024-01-14T00:42:13Z http://eprints.utm.my/104021/ A reliable merging link scheme using weighted Markov Chain Model in vehicular Ad Hoc networks Emmanuel, Siman Isnin, Ismail Fauzi Mohamad, Mohd. Murtadha QA75 Electronic computers. Computer science 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. MDPI 2022-07-01 Article PeerReviewed application/pdf en http://eprints.utm.my/104021/1/SimanEmmanuel2022_AReliableMergingLinkScheme.pdf Emmanuel, Siman and Isnin, Ismail Fauzi and Mohamad, Mohd. Murtadha (2022) A reliable merging link scheme using weighted Markov Chain Model in vehicular Ad Hoc networks. Sensors, 22 (13). pp. 1-17. ISSN 1424-8220 http://dx.doi.org/10.3390/s22134861 DOI:10.3390/s22134861
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
language English
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Emmanuel, Siman
Isnin, Ismail Fauzi
Mohamad, Mohd. Murtadha
A reliable merging link scheme using weighted Markov Chain Model in vehicular Ad Hoc networks
description 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.
format Article
author Emmanuel, Siman
Isnin, Ismail Fauzi
Mohamad, Mohd. Murtadha
author_facet Emmanuel, Siman
Isnin, Ismail Fauzi
Mohamad, Mohd. Murtadha
author_sort Emmanuel, Siman
title A reliable merging link scheme using weighted Markov Chain Model in vehicular Ad Hoc networks
title_short A reliable merging link scheme using weighted Markov Chain Model in vehicular Ad Hoc networks
title_full A reliable merging link scheme using weighted Markov Chain Model in vehicular Ad Hoc networks
title_fullStr A reliable merging link scheme using weighted Markov Chain Model in vehicular Ad Hoc networks
title_full_unstemmed A reliable merging link scheme using weighted Markov Chain Model in vehicular Ad Hoc networks
title_sort reliable merging link scheme using weighted markov chain model in vehicular ad hoc networks
publisher MDPI
publishDate 2022
url http://eprints.utm.my/104021/1/SimanEmmanuel2022_AReliableMergingLinkScheme.pdf
http://eprints.utm.my/104021/
http://dx.doi.org/10.3390/s22134861
_version_ 1789424366884225024
score 13.211869

Similar Items