With the emerging vehicular applications such as real-time situational awareness and cooperative lane change, there exist huge demands for sufficient computing resources at the edge to conduct time-critical and data-intensive tasks. This paper proposes Folo, a novel solution for latency and quality optimized task allocation in Vehicular Fog Computing (VFC). Folo is designed to support the mobility of vehicles, including vehicles that generate tasks and the others that serve as fog nodes. Considering constraints on service latency, quality loss, and fog capacity, the process of task allocation across stationary and mobile fog nodes is formulated into a joint optimization problem. This task allocation in VFC is known as a non-deterministic polynomial-time hard (NP-hard) problem. In this paper, we present the task allocation to fog nodes as a bi-objective minimization problem, where a trade-off is maintained between the service latency and quality loss. Specifically, we propose an event-triggered dynamic task allocation (DTA) framework using Linear Programming based Optimization (LBO) and Binary Particle Swarm Optimization (BPSO). To assess the effectiveness of Folo, we simulated the mobility of fog nodes at different times of a day based on real-world taxi traces and implemented two representative tasks, including video streaming and real-time object recognition. Simulation results show that the task allocation provided by Folo can be adjusted according to actual requirements of the service latency and quality, and achieves higher performance compared with naive and random fog node selection. To be more specific, Folo shortens the average service latency by up to 27% while reducing the quality loss by up to 56%.
Emerging vehicular applications, such as real-time situational awareness and cooperative lane change, demand for sufficient computing resources at the edge to conduct time-critical and data-intensive tasks. This paper proposes Fog Following Me (Folo), a novel solution for latency and quality balanced task allocation in vehicular fog computing. Folo is designed to support the mobility of vehicles, including ones generating tasks and the others serving as fog nodes. We formulate the process of task allocation across stationary and mobile fog nodes into a joint optimization problem, with constraints on service latency, quality loss, and fog capacity. As it is a NP-hard problem, we linearize it and solve it using Mixed Integer Linear Programming. To evaluate the effectiveness of Folo, we simulate the mobility of fog nodes at different times of day based on real-world taxi traces, and implement two representative tasks, including video streaming and real-time object recognition. Compared with naive and random fog node selection, the latency and quality balanced task allocation provided by Folo achieves higher performance. More specifically, Folo shortens the average service latency by up to 41\% while reducing the quality loss by up to 60\%.
2 July 2018 in IEEE Transactions on Vehicular Technology
This paper presents a low-rank tensor model for vehicular traffic volume data. Contrarily to previous works, we capitalize on a definition of rank, called the tensor train, that is as effective as possible; so that it exploits all the correlation between local structures that are present in the multiple modes, but practical enough that efficient optimization algorithms still hold. From our model, a formulation to find balanced (higher-order) tensors is derived. The resulting optimally-balanced tensor improves the imputation accuracy of the tensor train rank. Then, we design specific experiments which are numerically evaluated using real-world traffic data from Tampere city, Finland. The experimental results are promising, our proposed approach outperforms existing algorithms in both imputation accuracy and, in some instances, computation time.
Fifth-generation (5G) mobile networks aim to be qualified as the core connectivity infrastructures to address connected automated mobility (CAM), both from a technological and from a business perspective, for the higher automation levels defined by the automotive industry. Specifically, in some territories such as the European Union the cross-border corridors have relevance, as they are the cohesive paths for terrestrial transport. Therefore, 5G for CAM applications is planned to be deployed there first. However, cross-border contexts imply paramount communication challenges, such as seamless roaming, not addressed by current technology. This paper identifies relevant future 5G enhancements, specifically those specified by Third-Generation Partnership Project (3GPP) releases beyond Release 15, and outlines how they will support the ambitions of highly automated driving in cross-border corridors. In order to conduct this study, a set of representative use cases and the related communication requirements were identified. Then, for each use case, the most relevant 5G features were proposed. Some open issues are described at the end.
The Method of Moments (MoM) and Method of Log-cumulants (MoLC) estimate the distribution parameters in terms of First Kind Statistics (FKS) and Second Kind Statistics (SKS), respectively. Although SKS offer a suitable framework to analyze heavy-tailed (and asymmetric) distributions, which are commonly-found in aggregate interference modeling, statistical methods developed within this framework has been understudied. For networks following point processes of varying regularity, this paper evaluates the MoM and MoLC methods to estimate the distribution parameters of interference under Rayleigh fading and log-normal shadowing. The results confirm that the gamma and log-normal models offer accurate approximations only when the interference does not present a heavy-tail. For heavy-tailed interference, the MoLC allows an accurate and fast estimation for the α-stable model.
9 October 2020 in IEEE Transactions on Knowledge and Data Engineering
This paper presents a rigorous but tractable study of sparsity. We postulate a definition of sparsity that is as broad as possible, so that it generates all the various measures that are useful in practice, but narrow enough that the fundamental properties of generalized sparsity still hold. As we work through the various ways of demonstrating the advantageous properties of sparsity, we illustrate its meaning from geometrical and operational perspectives. Thereafter, we construct specific measures of sparsity which are successfully qualified in complexity analysis and sparse optimization scenarios. Overall, our main objective is to construct measures of sparsity that will facilitate and enhance the design of the next innovative sensing technologies.