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...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-06-01
|
| Series: | Sensors |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1424-8220/23/13/5800 |
| _version_ | 1797590842123223040 |
|---|---|
| author | Youngju Nam Jaejeong Bang Hyunseok Choi Yongje Shin Seungmin Oh Euisin Lee |
| author_facet | Youngju Nam Jaejeong Bang Hyunseok Choi Yongje Shin Seungmin Oh Euisin Lee |
| author_sort | Youngju Nam |
| collection | DOAJ |
| 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. |
| first_indexed | 2024-03-11T01:29:13Z |
| format | Article |
| id | doaj.art-3ea556541b774f8d90f35ab9ee8dd78b |
| institution | Directory Open Access Journal |
| issn | 1424-8220 |
| language | English |
| last_indexed | 2024-03-11T01:29:13Z |
| publishDate | 2023-06-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Sensors |
| spelling | doaj.art-3ea556541b774f8d90f35ab9ee8dd78b2023-11-18T17:27:00ZengMDPI AGSensors1424-82202023-06-012313580010.3390/s23135800Multiple Precaching Vehicle Selection Scheme Based on Set Ranking in Intermittently Connected Vehicular NetworksYoungju Nam0Jaejeong Bang1Hyunseok Choi2Yongje Shin3Seungmin Oh4Euisin Lee5Research Institute for Computer and Information Communication, Chungbuk National University, Cheongju 28644, Republic of KoreaHyundai Autoever, Seoul 06179, Republic of KoreaResearch Institute for Computer and Information Communication, Chungbuk National University, Cheongju 28644, Republic of KoreaResearch Institute for Computer and Information Communication, Chungbuk National University, Cheongju 28644, Republic of KoreaDepartment of Computer Science and Engineering, Kongju National University, Cheonan 31080, Republic of KoreaSchool of Information Communication Engineering, Chungbuk National University, Cheongju 28644, Republic of KoreaIn 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.https://www.mdpi.com/1424-8220/23/13/5800vehicular ad hoc networkscontent precachingmultiple precaching vehicles |
| spellingShingle | Youngju Nam Jaejeong Bang Hyunseok Choi Yongje Shin Seungmin Oh Euisin Lee Multiple Precaching Vehicle Selection Scheme Based on Set Ranking in Intermittently Connected Vehicular Networks Sensors vehicular ad hoc networks content precaching multiple precaching vehicles |
| 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 | vehicular ad hoc networks content precaching multiple precaching vehicles |
| url | https://www.mdpi.com/1424-8220/23/13/5800 |
| work_keys_str_mv | AT youngjunam multipleprecachingvehicleselectionschemebasedonsetrankinginintermittentlyconnectedvehicularnetworks AT jaejeongbang multipleprecachingvehicleselectionschemebasedonsetrankinginintermittentlyconnectedvehicularnetworks AT hyunseokchoi multipleprecachingvehicleselectionschemebasedonsetrankinginintermittentlyconnectedvehicularnetworks AT yongjeshin multipleprecachingvehicleselectionschemebasedonsetrankinginintermittentlyconnectedvehicularnetworks AT seungminoh multipleprecachingvehicleselectionschemebasedonsetrankinginintermittentlyconnectedvehicularnetworks AT euisinlee multipleprecachingvehicleselectionschemebasedonsetrankinginintermittentlyconnectedvehicularnetworks |