To improve the quality of computation experience for mobile devices, mobile-edge computing (MEC) is a promising paradigm by providing computing capabilities in close proximity within a sliced radio access network (RAN), which supports both traditional communication and MEC services. Nevertheless, the design of computation offloading policies for a virtual MEC system remains challenging. Specifically, whether to execute a computation task at the mobile device or to offload it for MEC server execution should adapt to the time-varying network dynamics. This paper considers MEC for a representative mobile user in an ultra-dense sliced RAN, where multiple base stations (BSs) are available to be selected for computation offloading. The problem of solving an optimal computation offloading policy is modelled as a Markov decision process, where our objective is to maximize the long-term utility performance whereby an offloading decision is made based on the task queue state, the energy queue state as well as the channel qualities between MU and BSs. To break the curse of high dimensionality in state space, we first propose a double deep Q-network (DQN) based strategic computation offloading algorithm to learn the optimal policy without knowing a priori knowledge of network dynamics. Then motivated by the additive structure of the utility function, a Q-function decomposition technique is combined with the double DQN, which leads to a novel learning algorithm for the solving of stochastic computation offloading. Numerical experiments show that our proposed learning algorithms achieve a significant improvement in computation offloading performance compared with the baseline policies.

Federated learning (FL) is a distributed machine learning approach that can achieve the purpose of collaborative learning from a large amount of data that belong to different parties without sharing the raw data among the data owners. FL can sufficiently utilize the computing capabilities of multiple learning agents to improve the learning efficiency while providing a better privacy solution for the data owners. FL attracts tremendous interests from a large number of industries due to growing privacy concerns. Future vehicular Internet of Things (IoT) systems, such as cooperative autonomous driving and intelligent transport systems (ITS), feature a large number of devices and privacy-sensitive data where the communication, computing, and storage resources must be efficiently utilized. FL could be a promising approach to solve these existing challenges. In this paper, we first conduct a brief survey of existing studies on FL and its use in wireless IoT. Then, we discuss the significance and technical challenges of applying FL in vehicular IoT, and point out future research directions.

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%.

The research on indoor localization has received great interest in recent years. This has been fueled by the ubiquitous distribution of electronic devices equipped with a radio frequency (RF) interface. Analyzing the signal fluctuation on the RF-interface can, for instance, solve the still open issue of ubiquitous reliable indoor localization and tracking. Device bound and device free approaches with remarkable accuracy have been reported recently. In this paper, we present an accurate device-free passive (DfP) indoor location tracking system that adopts channel state information (CSI) readings from off-the-shelf WiFi 802.11n wireless cards. The fine-grained subchannel measurements for multiple input multiple output orthogonal frequency-division multiplexing PHY layer parameters are exploited to improve localization and tracking accuracy. To enable precise positioning in the presence of heavy multipath effects in cluttered indoor scenarios, we experimentally validate the unpredictability of CSI measurements and suggest a probabilistic fingerprint-based technique as an accurate solution. Our scheme further boosts the localization efficiency by using principal component analysis to filter the most relevant feature vectors. Furthermore, with Bayesian filtering, we continuously track the trajectory of a moving subject. We have evaluated the performance of our system in four indoor environments and compared it with state-of-the-art indoor localization schemes. Our experimental results demonstrate that this complex channel information enables more accurate localization of nonequipped individuals.

Some vehicular Internet-of-Things (IoT) applications have a strict requirement on the end-to-end delay where edge computing can be used to provide a short delay for end-users by conducing efficient caching and computing at the edge nodes. However, a fast and efficient communication route creation in multi-access vehicular environment is an underexplored research problem. In this paper, we propose a collaborative learning-based routing scheme for multi-access vehicular edge computing environment. The proposed scheme employs a reinforcement learning algorithm based on end-edge-cloud collaboration to find routes in a proactive manner with a low communication overhead. The routes are also preemptively changed based on the learned information. By integrating the “proactive” and “preemptive” approach, the proposed scheme can achieve a better forwarding of packets as compared with existing alternatives. We conduct extensive and realistic computer simulations to show the performance advantage of the proposed scheme over existing baselines.