2019
DOI: 10.1109/jiot.2018.2875750
|View full text |Cite
|
Sign up to set email alerts
|

Deployment and Dimensioning of Fog Computing-Based Internet of Vehicle Infrastructure for Autonomous Driving

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
29
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 76 publications
(29 citation statements)
references
References 26 publications
0
29
0
Order By: Relevance
“…In this section, we propose an optimal method for low-traffic scenarios, the pseudo code of which is given in Algorithm 1. Our method is composed of two stages: in stage 1, we find all candidates from VC graph G S by analyzing the adjacency matrices of graph jobs and related VCs shown in step 2 and step 3; in stage 2, we select one candidate that can minimize the value of the objective function given in (4). In this method, going through all possible candidates ensures identification of the optimal solution for the graph job allocation; however, the computational complexity will be O(n!C(K, n)), where n represents the number of components in the graph job, K = sj |κ j | indicates the number of available slots in the related VC, and C(K, n) stands for the K-choose-n operation.…”
Section: Optimal Graph Job Allocation Mechanismmentioning
confidence: 99%
“…In this section, we propose an optimal method for low-traffic scenarios, the pseudo code of which is given in Algorithm 1. Our method is composed of two stages: in stage 1, we find all candidates from VC graph G S by analyzing the adjacency matrices of graph jobs and related VCs shown in step 2 and step 3; in stage 2, we select one candidate that can minimize the value of the objective function given in (4). In this method, going through all possible candidates ensures identification of the optimal solution for the graph job allocation; however, the computational complexity will be O(n!C(K, n)), where n represents the number of components in the graph job, K = sj |κ j | indicates the number of available slots in the related VC, and C(K, n) stands for the K-choose-n operation.…”
Section: Optimal Graph Job Allocation Mechanismmentioning
confidence: 99%
“…Meanwhile, the vehicle's fog ability was utilized to compensate the vehicle's service cost through monetary reward, thus helping to delay the sensitive computing service. Yu et al [6] discussed the optimal deployment and dimensionality (ODD) of fog computing-based IoV infrastructure for autonomous driving. Two different architectural patterns, namely, coupling pattern and decoupling pattern, were proposed, and the ODD problem was transformed into two integer linear programming formulas to reduce the deployment cost.…”
Section: Related Work a Fog Computing In Iovmentioning
confidence: 99%
“…In particular, VFC utilizes a large number of cooperative enduser clients or near-user edge devices to perform huge amounts of communication and computation [3], which differs from other existing technologies in its proximity to end users, dense geographic distribution, and support for mobility [4], [5]. In order to enhance the computing and storage capabilities of the network edge, recently, a new network structure, named fog computing-based IoV (FC-IoV) [6], is proposed, which deploys fog servers at downtown intersections and accidentprone roads to enhance the computing and storage capabilities of the network edge.…”
Section: Introductionmentioning
confidence: 99%
“…For such large test campaigns projects, efficiently and effectively dealing with data is of paramount importance. The scientific literature has already provided an account of data management in large-scale automotive research projects (e.g., [7]), however, this information needs to be updated in the light of the evolution of the automated functions and of the data processing and management tools and architectures (e.g., cloud computing [8]). In this context, we are particularly interested in understanding how to design and develop a data management toolchain for automotive test data (both qualitative and quantitative, both vehicular and subjective), with a goal to support a wide spectrum research investigation.…”
Section: Introductionmentioning
confidence: 99%