The incipient vehicular applications and the explosive growth of data generally led to the increase in demand for communication, computation, and storage resources, as well as the stringent performance requirement on latency and wireless network capacity. To address these challenges, Vehicular Edge Computing is an envisioned promising solution that extends the computation capability to the edge of the vehicular network and computation offloading service is provided in the proximity of the vehicles. Vehicular edge computing (VEC) and D2D communication have been designed to benefit from proximity gain to optimize computation offloading. Software-defined network (SDN) inside the vehicular network (SDVN) is developed in this article to rectify most problems in the vehicular network. Besides, the SDVN controller handles D2D pairing of vehicles and co-ordinates with the edge cloud for flexible allocation of computing resources among vehicles and mobile users. In this article, we combine D2D communication and VEC to further enhance the computation capacity of the vehicular network. Our goal is to optimize the number of devices the vehicular network can support under communication and computational limitation. We formulate the task offloading and associated resource allocation problem as a game with mixed strategies. The players involved in the game are the SDN controller handling the computation resource allocation at the network edge and a vehicle deciding on task offloading. The existence and uniqueness of Nash equilibrium are theoretically proved.
Machine learning (ML) models are essential to securing communication networks. However, these models are vulnerable to adversarial examples (AEs), in which malicious inputs are modified by adversaries to produce the desired output. Adversarial training is an effective defense method against such attacks but relies on access to a substantial number of AEs, a prerequisite that entails significant computational resources and the inherent limitation of poor performance on clean data. To address these problems, this study proposes a novel approach to improve the robustness of ML-based network traffic classification models by integrating derived variables (DVars) into training. Unlike adversarial training, our approach focuses on enhancing training using DVars, introducing randomness into the input data. DVars are generated from the baseline dataset and significantly improve the resilience of the model to AEs. To evaluate the effectiveness of DVars, experiments were conducted using the CSE-CIC-IDS2018 dataset and three state-of-the-art ML-based models: decision tree (DT), random forest (RF), and k-neighbors (KNN). The results show that DVars can improve the accuracy of KNN under attack from 0.45% to 0.84% for low-intensity attacks and from 0.32% to 0.66% for high-intensity attacks. Furthermore, both DT and RF achieve a significant increase in accuracy when subjected to attack of different intensity. Moreover, DVars are computationally efficient, scalable, and do not require access to AEs.
Different kinds of attacks on the network have greatly increased due to the exponential increase in the number of users over the last decade. This has greatly hampered transactions online especially when they are financially based. Hence, there is every need to develop and design new cybersecurity techniques to curb these cyber-crimes. This study presents the accurate classification of the Transmission Control Protocol (TCP) and User Datagram Protocol (UDP) flows on the network using Machine Learning (ML) based on parameter optimization. The method was validated with three randomly selected Machine Learning (ML) algorithms of the Waikato Environment for Knowledge Analysis (WEKA) software with 10 folds cross-validation and chose the algorithm with the best performance. Experiments were carried out on three scenarios using the USTC-TFC2016 dataset and the results demonstrated that Random Forest (RF) achieved average performance accuracy of 99.52%, which is 0.11% higher than the the-state-of-the art approach. It was also shown that the Decision Tree (J48) achieved higher classification accuracy than Naïve Bayes (NB).
Deep learning models have enabled significant performance improvements to remote sensing image processing. Usually, a large number of training samples is required for detection models. In this study, a dynamic simulation training strategy is designed to generate samples in real time during training. The few adversarial examples are not only directly involved in the training but are also used to fit the distribution model of adversarial noise, helping the real-time generated samples to be similar to adversarial examples. The noise of the training samples is randomly generated according to the distribution model, and the random variation of training inputs reduces the overfitting phenomenon. To enhance the detectability of adversarial noise, the input model is no longer a normalized image but a JPEG error image. Experiments show that with the proposed dynamic simulation training strategy, common classification models such as ResNet and DenseNet can effectively detect adversarial examples.
1 January 2024 in European Journal of Applied Science, Engineering and Technology
Forecasting passenger flow at metro transit stations is a useful method for optimizing the organization of passenger transportation and enhancing operational safety and transportation efficiency. Aiming at the problem that the traditional ARIMA model has poor performance in predicting passenger flow, a hybrid prediction method based on ARIMA-Kalman filtering is proposed. In this regard, ARIMA model training experimental samples are integrated with Kalman filter to create a prediction recursion equation, which is then utilized to estimate passenger flow. The simulation experiment results based on the inbound passenger flow data of Nanjing metro station show that compared with the single ARIMA model, the root mean square error of the prediction results of the proposed ARIMA-Kalman filter hybrid algorithm is reduced by 257.106, and the mean absolute error decreased by 145. 675, the mean absolute percentage error dropped by 5. 655%, proving that the proposed hybrid algorithm has higher prediction accuracy. The experiment results based on the passenger flow data of Nanjing metro station show that compared to a single ARIMA model, the proposed ARIMA Kalman filtering hybrid algorithm reduces the root mean square error of the prediction results by 257.106, the average absolute error by 145.675, and the average absolute percentage error by 5.655%. It has been proven that the proposed hybrid algorithm has higher prediction accuracy.