Cargando…

Multiple Precaching Vehicle Selection Scheme Based on Set Ranking in Intermittently Connected Vehicular Networks

In vehicular networks, vehicles download vehicular information for various applications, including safety, convenience, entertainment, and social interaction, from the corresponding content servers via stationary roadside units. Since sufficient RSUs might be difficult to deploy due to rough geograp...

Descripción completa

Detalles Bibliográficos
Autores principales: Nam, Youngju, Bang, Jaejeong, Choi, Hyunseok, Shin, Yongje, Oh, Seungmin, Lee, Euisin
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2023
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10347265/
https://www.ncbi.nlm.nih.gov/pubmed/37447654
http://dx.doi.org/10.3390/s23135800
_version_ 1785073509518540800
author Nam, Youngju
Bang, Jaejeong
Choi, Hyunseok
Shin, Yongje
Oh, Seungmin
Lee, Euisin
author_facet Nam, Youngju
Bang, Jaejeong
Choi, Hyunseok
Shin, Yongje
Oh, Seungmin
Lee, Euisin
author_sort Nam, Youngju
collection PubMed
description In vehicular networks, vehicles download vehicular information for various applications, including safety, convenience, entertainment, and social interaction, from the corresponding content servers via stationary roadside units. Since sufficient RSUs might be difficult to deploy due to rough geographical conditions or high deployment costs, vehicular networks can feature uncovered outage zones between two neighboring RSUs. In these outage zones, vehicles cannot download content, and thus the vehicle networks are defined as intermittently connected vehicular networks. In intermittently connected vehicular networks, the download delay and traffic overhead on the backhaul links are increased due to the large size of the content requested by vehicle users and the long distances between RSUs. Using the mobility information of vehicles, several schemes have been proposed to solve this issue by precaching and relaying content via multiple relaying vehicles in the outage zone. However, because they involved the individual ranking of vehicles for precaching and allocated all of the available precaching amounts to the top-ranking vehicles, they decreased the success rate of content requests and the fairness of vehicle precaching. To overcome the problem of these previous schemes, this paper proposes a multiple precaching vehicle selection (MPVS) scheme that efficiently selects a content-precaching vehicle group with multiple precaching vehicles to precache relayed content in outage zones. To achieve this, we first designed numerical models to decide the necessity and the amount of precaching and to calculate the available precaching amounts of vehicles. Next, MPVS calculates all available vehicle sets and ranks each set based on the available precaching amount. Then, the content-precaching vehicle group is identified from the sets by considering both set rankings and vehicle communication overheads. MPVS also provides a content downloading process through the content-precaching vehicle group in the outage zone. Simulation results conducted in various environments with a content request model and a highway mobility model verified that MPVS was superior to a representative previous scheme.
format Online
Article
Text
id pubmed-10347265
institution National Center for Biotechnology Information
language English
publishDate 2023
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-103472652023-07-15 Multiple Precaching Vehicle Selection Scheme Based on Set Ranking in Intermittently Connected Vehicular Networks Nam, Youngju Bang, Jaejeong Choi, Hyunseok Shin, Yongje Oh, Seungmin Lee, Euisin Sensors (Basel) Article In vehicular networks, vehicles download vehicular information for various applications, including safety, convenience, entertainment, and social interaction, from the corresponding content servers via stationary roadside units. Since sufficient RSUs might be difficult to deploy due to rough geographical conditions or high deployment costs, vehicular networks can feature uncovered outage zones between two neighboring RSUs. In these outage zones, vehicles cannot download content, and thus the vehicle networks are defined as intermittently connected vehicular networks. In intermittently connected vehicular networks, the download delay and traffic overhead on the backhaul links are increased due to the large size of the content requested by vehicle users and the long distances between RSUs. Using the mobility information of vehicles, several schemes have been proposed to solve this issue by precaching and relaying content via multiple relaying vehicles in the outage zone. However, because they involved the individual ranking of vehicles for precaching and allocated all of the available precaching amounts to the top-ranking vehicles, they decreased the success rate of content requests and the fairness of vehicle precaching. To overcome the problem of these previous schemes, this paper proposes a multiple precaching vehicle selection (MPVS) scheme that efficiently selects a content-precaching vehicle group with multiple precaching vehicles to precache relayed content in outage zones. To achieve this, we first designed numerical models to decide the necessity and the amount of precaching and to calculate the available precaching amounts of vehicles. Next, MPVS calculates all available vehicle sets and ranks each set based on the available precaching amount. Then, the content-precaching vehicle group is identified from the sets by considering both set rankings and vehicle communication overheads. MPVS also provides a content downloading process through the content-precaching vehicle group in the outage zone. Simulation results conducted in various environments with a content request model and a highway mobility model verified that MPVS was superior to a representative previous scheme. MDPI 2023-06-21 /pmc/articles/PMC10347265/ /pubmed/37447654 http://dx.doi.org/10.3390/s23135800 Text en © 2023 by the authors. https://creativecommons.org/licenses/by/4.0/Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
Nam, Youngju
Bang, Jaejeong
Choi, Hyunseok
Shin, Yongje
Oh, Seungmin
Lee, Euisin
Multiple Precaching Vehicle Selection Scheme Based on Set Ranking in Intermittently Connected Vehicular Networks
title Multiple Precaching Vehicle Selection Scheme Based on Set Ranking in Intermittently Connected Vehicular Networks
title_full Multiple Precaching Vehicle Selection Scheme Based on Set Ranking in Intermittently Connected Vehicular Networks
title_fullStr Multiple Precaching Vehicle Selection Scheme Based on Set Ranking in Intermittently Connected Vehicular Networks
title_full_unstemmed Multiple Precaching Vehicle Selection Scheme Based on Set Ranking in Intermittently Connected Vehicular Networks
title_short Multiple Precaching Vehicle Selection Scheme Based on Set Ranking in Intermittently Connected Vehicular Networks
title_sort multiple precaching vehicle selection scheme based on set ranking in intermittently connected vehicular networks
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10347265/
https://www.ncbi.nlm.nih.gov/pubmed/37447654
http://dx.doi.org/10.3390/s23135800
work_keys_str_mv AT namyoungju multipleprecachingvehicleselectionschemebasedonsetrankinginintermittentlyconnectedvehicularnetworks
AT bangjaejeong multipleprecachingvehicleselectionschemebasedonsetrankinginintermittentlyconnectedvehicularnetworks
AT choihyunseok multipleprecachingvehicleselectionschemebasedonsetrankinginintermittentlyconnectedvehicularnetworks
AT shinyongje multipleprecachingvehicleselectionschemebasedonsetrankinginintermittentlyconnectedvehicularnetworks
AT ohseungmin multipleprecachingvehicleselectionschemebasedonsetrankinginintermittentlyconnectedvehicularnetworks
AT leeeuisin multipleprecachingvehicleselectionschemebasedonsetrankinginintermittentlyconnectedvehicularnetworks