applsci-logo

Journal Browser

Journal Browser

Data Dissemination in Vehicular Networks

A special issue of Applied Sciences (ISSN 2076-3417). This special issue belongs to the section "Electrical, Electronics and Communications Engineering".

Deadline for manuscript submissions: closed (31 October 2022) | Viewed by 7033

Special Issue Editors

Graduate School of Informatics and Engineering, The University of Electro-Communications, Tokyo 182-8585, Japan
Interests: vehicular networks; sensor networks; positioning
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
College of Engineering, Academic Institute, Shizuoka University, Hamamatsu 432-8561, Japan
Interests: mobile networking; sensor networks; mobile aplications

E-Mail Website
Guest Editor
School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
Interests: signal processing; wireless communication; video codec

Special Issue Information

Dear Colleagues,

This Special Issue is devoted to communication techniques for vehicular networks. Although research efforts mainly focus on safety applications (avoiding traffic accidents, autonomous driving, etc.), the demand for traffic of non-safety applications (computation offloading, vehicle software update, etc.) has rapidly increased in recent times. This involves communication among vehicles, pedestrians, and infrastructure. The vehicle-to-everything (V2X) communication can be realized by either cellular networks (LTE-V2X, 5G NR-V2X) or dedicated short-range communications (DSRC), such as IEEE 802.11p and its successor, IEEE 802.11bd. Communication efficiency of vehicular networks depends on several factors, such as resource allocation for avoiding interference, caching for avoiding redundant transmission, dynamic interface selection for avoiding congestion, etc. This Special Issue welcomes all submissions that help to improve data dissemination efficiency in vehicular networks, whose effectiveness is evaluated by theoretical analysis, simulation, or testbed experiments.

Dr. Suhua Tang
Prof. Dr. Susumu Ishihara
Prof. Dr. Songlin Sun
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Applied Sciences is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2400 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • resource allocation (C-V2X, NR-V2X)
  • channel access control (DSRC, IEEE 802.11bd)
  • congestion control
  • mode/interface selection/combination
  • multi-hop vehicular ad hoc network
  • distributed cache
  • vehicular content centric network
  • software-defined vehicular network
  • edge computing for assisting data dissemination in vehicular networks

Published Papers (5 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

25 pages, 8892 KiB  
Article
Communication Method Using Cellular and D2D Communication for Reverse Auction-Based Mobile Crowdsensing
by Tetsushi Matsuda, Toru Inada and Susumu Ishihara
Appl. Sci. 2022, 12(22), 11753; https://doi.org/10.3390/app122211753 - 18 Nov 2022
Cited by 1 | Viewed by 1132
Abstract
The demand for services that provide current sensing data (data) obtained at a specified location is expected to grow in the future. To realize such services with lower sensor installation and operation costs, we consider the use of a pull-type mobile crowdsensing with [...] Read more.
The demand for services that provide current sensing data (data) obtained at a specified location is expected to grow in the future. To realize such services with lower sensor installation and operation costs, we consider the use of a pull-type mobile crowdsensing with reverse auction (pull-type RevAuc) that determines the size of the incentive paid to mobile hosts that provide data. In a pull-type RevAuc, more cellular traffic between a server and mobile hosts can increase the service operation cost. In this paper, we propose a new communication method for the pull-type RevAuc that reduces cellular traffic between a server and mobile hosts by using device-to-device communication. Through simulations, we confirmed that the proposed method can reduce cellular traffic compared to the existing method for the pull-type RevAuc while selecting a successful bidder that can provide data at almost the same location for almost the same reward within almost the same amount of time as in the existing method. Full article
(This article belongs to the Special Issue Data Dissemination in Vehicular Networks)
Show Figures

Figure 1

13 pages, 1662 KiB  
Article
Information Relaying Methods in VANET: Algorithms, Standards and Tests
by Tao Cui, Chen Sun and Lantao Li
Appl. Sci. 2022, 12(21), 10748; https://doi.org/10.3390/app122110748 - 24 Oct 2022
Viewed by 1058
Abstract
This paper considers information transmission issue observed in a large scale test of cellular-based vehicular to everything (C-V2X) technology in China, which is the information blockage for the vehicle-to-vehicle (V2V) wireless communication. With such findings, we propose utilizing relaying-based information routing solutions by [...] Read more.
This paper considers information transmission issue observed in a large scale test of cellular-based vehicular to everything (C-V2X) technology in China, which is the information blockage for the vehicle-to-vehicle (V2V) wireless communication. With such findings, we propose utilizing relaying-based information routing solutions by the support of K-means-type algorithm and an on-request relay selection method in a vehicular adhoc network (VANET). From the algorithm perspective, we refine the K-means-based VANET seeding principle with considerations on the global vehicle layout. On the other hand, base station and/or core network aided relay selection associated with vehicle maneuver is introduced for waking up relays when necessary in order to address the typical non-line-of-sight (NLOS) signal attenuation by taking the power consumption into consideration. To evaluate the system performance, we conduct Matlab and network simulator (NS)-3 simualtions to justify the algorithms, and adopt Veins-based simulations to show the data packets loss gain over non-relaying scenarios of realistic V2V scenario with NLOS signal dissemination. Full article
(This article belongs to the Special Issue Data Dissemination in Vehicular Networks)
Show Figures

Figure 1

15 pages, 1839 KiB  
Article
A Packet Collision Reduction Based on Reselection for LTE V2X Mode 4
by Masashi Asano and Masahiro Fujii
Appl. Sci. 2022, 12(17), 8733; https://doi.org/10.3390/app12178733 - 31 Aug 2022
Cited by 1 | Viewed by 1346
Abstract
Vehicle to Everything (V2X) is a technology that includes communication between the vehicles and everything such as Vehicle to Vehicle (V2V), Vehicle to Infrastructure (V2I), and Vehicle to Pedestrian (V2P). Long Term Evolution (LTE) V2X based on LTE supports a sidelink communication in [...] Read more.
Vehicle to Everything (V2X) is a technology that includes communication between the vehicles and everything such as Vehicle to Vehicle (V2V), Vehicle to Infrastructure (V2I), and Vehicle to Pedestrian (V2P). Long Term Evolution (LTE) V2X based on LTE supports a sidelink communication in which User Equipment (UE) communicates with each other. In Mode 4 of the sidelink communication, the UE autonomously selects a radio resource that is not expected to be used by other UEs based on sensing information. However, a resource can be selected by simultaneous UEs and packet collisions occur because of the periodic resource reselection. In this paper, we propose two resource selection methods for the reselection using information originally included in the control information. Through computer simulations, we show that the proposed methods can improve the packet reception rate without requiring restrictions such as additional information. The main strength of this method is that it effectively utilizes the information contained in Resource Reservation Interval (RRI), which is used in the Semi-Persistent Scheduling wireless resource allocation algorithm. In this research, the value of RRI, which has been used in standards, is utilized to improve performance while maintaining compatibility. Since our method is designed under conditions that maintain compatibility with existing standards, it may or may not have a significant effect, but it does not degrade performance. Full article
(This article belongs to the Special Issue Data Dissemination in Vehicular Networks)
Show Figures

Figure 1

22 pages, 7430 KiB  
Article
Safe, Smooth, and Fair Rule-Based Cooperative Lane Change Control for Sudden Obstacle Avoidance on a Multi-Lane Road
by Shinka Asano and Susumu Ishihara
Appl. Sci. 2022, 12(17), 8528; https://doi.org/10.3390/app12178528 - 26 Aug 2022
Viewed by 1494
Abstract
When an unexpected obstacle occupies some of the lanes on a multi-lane highway, connected vehicles (CVs) may be able to avoid it cooperatively. For example, a CV that detects the obstacle first can immediately notify the following vehicles of the obstacle by using [...] Read more.
When an unexpected obstacle occupies some of the lanes on a multi-lane highway, connected vehicles (CVs) may be able to avoid it cooperatively. For example, a CV that detects the obstacle first can immediately notify the following vehicles of the obstacle by using vehicle-to-vehicle (V2V) communication. In turn, the following vehicles can take action to avoid the obstacle smoothly using wide range behind the obstacle without sacrificing safety and ride comfort. In this study, we propose a method to realize safe, smooth, and fair wide-range cooperative lane changing, reacting to a sudden obstacle on the road. The proposed method is based on the authors’ previous work, which utilizes multi-hop communication to share the obstacle position and controls the inter-vehicular distance of vehicles away from the obstacle to assist in a smooth lane changing operation, while existing lane-changing methods for CVs focus on microscopic operation around the obstacle. Though the previous work treats only a two-lane road, the proposed method is extended to work on a three- or more lane road assuming only one lane is blocked. In the proposed scheme, each vehicle approaching the obstacle selects a lane to change to in accordance with the obstacle’s location and the vehicle density in each lane estimated from the beacon messages broadcast by each CV, thereby improving traffic fairness among all lanes without degrading safety or ride comfort. We confirmed the effectiveness of the proposed scheme on realizing fairness among lanes, safety, ride comfort, and traffic throughput through comprehensive simulations of a two-lane road and a three-lane road with various traffic scenarios. Full article
(This article belongs to the Special Issue Data Dissemination in Vehicular Networks)
Show Figures

Figure 1

19 pages, 1180 KiB  
Article
Two-Level Sharing and Extraction of Sensing Information with Hybrid V2X Communications
by Rui Teng and Kenya Sato
Appl. Sci. 2022, 12(9), 4603; https://doi.org/10.3390/app12094603 - 3 May 2022
Viewed by 1216
Abstract
Vehicle-to-Everything (V2X) communications provide opportunities for information sharing among vehicles, edge servers, and cloud services. By the collection and extraction of sensing information from vehicles, such as communication quality or free space size, the edge server in V2X communications can improve its sensing [...] Read more.
Vehicle-to-Everything (V2X) communications provide opportunities for information sharing among vehicles, edge servers, and cloud services. By the collection and extraction of sensing information from vehicles, such as communication quality or free space size, the edge server in V2X communications can improve its sensing and perception coverage. However, the collection of sensing data from vehicles consumes a large amount of wireless resources and computing resources at the edge server. The objective of this study is to extract object sensing information from vehicles, including the minimum or maximum of the sensing values, with low resource consumption and with high scalability. We propose a method that transforms the extraction of sensing information into a two-level procedure that includes (1) the local sharing and extraction of sensing information among vehicles and (2) the efficient extraction of sensing information at the edge server. Moreover, hybrid communication methods are employed at vehicles, with a short range of communication between vehicles to reduce the consumption of wireless resources for the local sharing of sensing data. The evaluation results show that the proposed method highly reduces the number of reports from the vehicles to the edge server, with a small amount of network resource consumption and scalability. Full article
(This article belongs to the Special Issue Data Dissemination in Vehicular Networks)
Show Figures

Figure 1

Back to TopTop