With the continued evolution of autonomous driving, the communication demand for in-vehicle networks (IVNs) has dramatically increased, and the traditional IVN solutions have become ineligible for the needs of new in-vehicle applications. Time-sensitive network (TSN) with the characteristics of determinism, low latency, high reliability, large bandwidth, and open industry standards, has been considered as the most promising technology for the next-generation IVNs. This article summarizes the current state and methodologies of in-vehicle TSN research through the following five aspects: 1) Quality of Service (QoS) strategy; 2) reliability; 3) clock synchronization; 4) network planning; and 5) network management. The corresponding research priorities and technical challenges are also addressed, respectively.
The Internet of Vehicles (IoV) connects a massive amount of smart vehicles for inter/intra-vehicle information sharing. Data privacy issues, such as privacy leakage and privacy cost, are the key challenges that hinder vehicle operators from sharing their data safely. Traditional privacy-preserving techniques, including federated learning (FL) and differential privacy (DP) techniques, can protect data privacy and security, but the high-privacy cost severely limits learning performance. In addition, the IoV services place high demands on low-communication latency, which can be obtained by reducing the communication bits, but it also limits the learning performance. Thus, how to solve the communication-privacy-accuracy tradeoffs to achieve low latency, high-privacy preservation and model performance has been a complicated issue in IoV. In this article, a privacy-enhancement differentially private FL framework (FedSDP) is proposed based on the shuffle model to ensure secure and efficient data sharing under the constraint of low latency in IoV. In our proposed framework, four privacy enhancement methods are proposed, including data subsampling, vehicle sampling, shuffle model, and dummy points, to amplify the privacy and obtain higher learning performance. Then, a Top-K sparsification mechanism of the vehicle training process is proposed to reduce communication bits. Finally, the experimental results indicate that our approach can reduce the communication latency by 31.66%, enhance the privacy $\epsilon _{c}$ by 30.77% and improve the test accuracy by 48.56%, compared with the traditional SDP mechanism.
With services becoming increasingly complex and network scales expanding, hybrid network architectures that combine bus and switch networks while supporting deterministic transmission will play a crucial role in future networks. Time-Triggered Protocol (TTP) and Time-Sensitive Networking (TSN), as key protocols currently ensuring time determinism in bus and switch networks, respectively, are of significant importance for research on hybrid network architectures and ensuring deterministic communication across protocols. In this paper, firstly, we analyzed the causes of latency in TTP–TSN hybrid networks. To reduce latency, we designed a cross-protocol time-synchronization algorithm. And, based on network-wide time synchronization, we constructed a joint TTP–TSN low-latency scheduling model, using Integer Linear Programming (ILP), which was then solved by an ILP solver. Based on this scheduling model, we proposed a heuristic fast scheduling algorithm and proofs of its schedulability and approximation ratio. Finally, we designed simulation and prototype systems for verification. Our experimental results demonstrate that the time-synchronization algorithm proposed in this paper achieves a synchronization error of no more than 1 µs. Compared to the case without applying the joint scheduling model, the fast heuristic algorithm can reduce end-to-end latency by at least 50%, and shorten the solving time by thousands of times compared to an ILP solver, all while ensuring schedulability.
3 December 2021 in IEEE Internet of Things Journal
Multiaccess edge computing (MEC) allows terminal devices (TDs) with limited energy and computing capabilities to offload tasks to edge servers, which have more energy and computing capabilities to provide better service. In order to accommodate more users, an edge server can be divided into many virtual machines (VMs), but the interference among VMs could cause decreased service quality. At the same time, due to server hardware and software errors, there are random temporary failures regardless of whether a virtual machine is serving or not. This article uses a multidimensional Markov chain to establish a unified performance analysis model that jointly considers multiple types of terminals, different local service capabilities, different request arrival traffic, different virtual machine numbers, and different virtual machine failure rates. The statistical models of access blocking probability, resource availability, capacity, forced dropping probability, and retainability are presented. Furthermore, we analyze whether and how the local service should be performed when the virtual machine used fails and propose a backward offloading scheme. Analysis results show that some of quality is not monotonous. The model in this article provides a powerful and accurate analytical method for the preperformance simulation of actual engineering design.