20 August 2021 in IEEE Transactions on Intelligent Transportation Systems
AVAthanasios V. Vasilakos
+3
With recent developments in communication technologies, vehicular networks have become a reality with various applications. However, the cybersecurity aspect of vehicular networks is still an open issue that needs to be addressed with novel defence mechanisms against attacks. This paper first presents the state-of-the-art communication technologies in vehicular networks (either inter-vehicle networking or in-vehicle networking) along with their applications. Then we explore novel technologies including machine learning and blockchain as cybersecurity defence mechanisms in vehicular networks. Based on the extensive survey, we highlight some insights for future research to secure vehicular networks.
8 October 2020 in IEEE Transactions on Vehicular Technology
It is important to transmit data reliably and efficiently in vehicular networks. Existing works usually study routing strategies and cooperative scheduling to improve the efficiency of transmission. However, the data transmission remains inefficient because of the lack of full use of communication resources. The transmission is unreliable because information cannot be completely transmitted to the destination vehicles. Moreover, the increasing number of connected vehicles and the limitation of available communication resources make task scheduling challenging in vehicular networks. In this work, we propose Cluster-enabled Cooperative Scheduling based on Reinforcement Learning(CCSRL) to improve the communication efficiency and reliability of vehicular networks, with the goal of maximizing the information capacity. In particular, we leverage the stability to select a cluster head vehicle to enhance data transmission efficiency, and a reinforcement learning-based auxiliary transmission is further designed to guarantee the reliable communication among vehicles. The experimental results demonstrate that the performance of the proposed scheduling algorithm, especially the performance of the packet delivery ratio and node packet loss ratio, is better than that of the state-of-the-art algorithm.
6 June 2018 in IEEE Access
The stable and fair data transmission of vehicular networks can improve transport efficiency and reduce traffic accident. It is challenging to ensure the stability and fairness of data transmission in dynamic vehicular networks. However, existing works based on opportunistic scheduling cannot support reliable transmission since stability and fairness are difficult to be guaranteed at the same time. In this paper, we propose a stable scheduling scheme for dynamic vehicular networks based on fair allocation of available channel resources. We formulate the problem of stability and fairness as network utility maximization, and propose an algorithm, called SF-NUM, to solve it. SF-NUM uses the stability scheduling method based on back pressure vector for the first time in vehicular networks. In order to achieve the fairness distribution of channel resources of the vehicular networks in the distributed computing way, multiple factors are considered in the SF-NUM algorithm. The experimental results show that the proposed algorithm outperforms other algorithms.
15 June 2022 in IEEE Internet of Things Journal
Data dissemination of vehicles is critical for vehicular networks because of the extensive impact of traffic information. The existing works for data dissemination in vehicular networks mainly use data scheduling algorithms to transmit data among vehicles. However, it is challenging to meet the ultrareliable and low-latency requirements of data transmission among vehicular networks due to the intrinsic movement characteristic of vehicles. To promote the data dissemination of vehicular networks, a data dissemination algorithm with trajectory privacy protection is proposed in this article, which leverages the cooperative distribution of key tasks and distance deviation. Specifically, the key tasks are disseminated to vehicles first, and the trajectory privacy protection scheme is further developed to guarantee the security of data transmission by the exploration of distance deviation and pseudonym entropy. Simulation results indicate that the proposed adaptive data dissemination algorithm is approximately 60%, 69%, and 50% better than the state-of-the-art scheduling algorithms in terms of connectivity degree, transmission delay, and average distance deviation for the vehicular network.
20 June 2023 in IEEE Transactions on Emerging Topics in Computing
Collaborative filtering (CF) is a pivotal building block in commercial recommender systems due to its strength and utility in user interest modeling. Recently, many researchers have turned to deep learning as a way to capture richer collaborative signals from user-item feature interactions. However, most deep-based methods only consider nonlinear, high-order interactions while ignoring the explicit collaborative signals in low-order interactions. They also typically ignore the quality of the user and item profiles. These are cornerstones in item recommendation that, we argue, must be considered for high-quality recommendations. Hence, we propose Deep Attentive Interest Collaborative Filtering (DAICF) to overcome these limitations. DAICF profiles users based on their interactive items, i.e., user neighborhood information. Similarly, item profiles are based on users who had interacted with it, i.e., item neighborhood information. Given a user's profile varies over different items, DAICF accurately models his attentive interests based on the specific target item. Low-order collaborative signals are captured by a shallow component, and high-order collaborative signals are captured by a deep component. These two complementary collaborative signals are then fused to provide rich recommendations that cut through today's information overload. By designing a personalized feature extraction method based on bilateral neighborhood information to solve the data sparsity problem in recommender systems, DAICF can dynamically distinguish the importance of a user's historical interaction items for predicting user preferences for a specific target item. A set of experiments against four real-world datasets validate that DAICF outperforms the most recent state-of-the-art recommendation algorithms and justifies the effectiveness and interpretability of our method.