The classification of services in 5G/B5G (Beyond 5G) networks has become important for telecommunications service providers, who face the challenge of simultaneously offering a better Quality of Service (QoS) in their networks and a better Quality of Experience (QoE) to users. Service classification allows 5G service providers to accurately select the network slices for each service, thereby improving the QoS of the network and the QoE perceived by users, and ensuring compliance with the Service Level Agreement (SLA). Some projects have developed systems for classifying these services based on the Key Performance Indicators (KPIs) that characterize the different services. However, Key Quality Indicators (KQIs) are also significant in 5G networks, although these are generally not considered. We propose a service classifier that uses a Machine Learning (ML) approach based on Supervised Learning (SL) to improve classification and to support a better distribution of resources and traffic over 5G/B5G based networks. We carry out simulations of our proposed scheme using different SL algorithms, first with KPIs alone and then incorporating KQIs and show that the latter achieves better prediction, with an accuracy of 97% and a Matthews correlation coefficient of 96.6% with a Random Forest classifier.

Modern algorithms for symmetric and asymmetric encryptions are not suitable to provide security of data that needs data processing. They cannot perform calculations over encrypted data without first decrypting it when risks are high. Residue Number System (RNS) as a homomorphic encryption allows ensuring the confidentiality of the stored information and performing calculations over encrypted data without preliminary decoding but with unacceptable time and resource consumption. An important operation for encrypted data processing is a number comparison. In RNS, it consists of two steps: the computation of the positional characteristic of the number in RNS representation and comparison of its positional characteristics in the positional number system. In this paper, we propose a new efficient method to compute the positional characteristic based on the approximate method. The approximate method as a tool to compare numbers does not require resource-consuming non-modular operations that are replaced by fast bit right shift operations and taking the least significant bits. We prove that in case when the dynamic range of RNS is an odd number, the size of the operands is reduced by the size of the module. If one of the RNS moduli is a power of two, then the size of the operands is less than the dynamic range. We simulate proposed method in the ISE Design Suite environment on the FPGA Xilinx Spartan-6 SP605 and show that it gains 31% in time and 37% in the area on average with respect to the known approximate method. It makes our method efficient for hardware implementation of cryptographic primitives constructed over a prime finite field.

Vehicular Ad Hoc Networks (VANETs) are considered by car manufacturers and the research community as the enabling technology to radically improve the safety, efficiency and comfort of everyday driving. However, before VANET technology can fulfill all its expected potential, several difficulties must be addressed. One key issue arising when working with VANETs is the complexity of the networking protocols compared to those used by traditional infrastructure networks. Therefore, proper design of the routing strategy becomes a main issue for the effective deployment of VANETs. In this paper, a reliable freestanding position-based routing algorithm (FPBR) for highway scenarios is proposed. For this scenario, several important issues such as the high mobility of vehicles and the propagation conditions may affect the performance of the routing strategy. These constraints have only been partially addressed in previous proposals. In contrast, the design approach used for developing FPBR considered the constraints imposed by a highway scenario and implements mechanisms to overcome them. FPBR performance is compared to one of the leading protocols for highway scenarios. Performance metrics show that FPBR yields similar results when considering freespace propagation conditions, and outperforms the leading protocol when considering a realistic highway path loss model.

Vehicular ad hoc networks have been identified as a key technology for enabling safety and infotainment applications in the context of smart and connected vehicles. In this sense, diverse approaches of multi-hop broadcast protocols have been proposed to collect and disseminate context information through the network. However, before vehicular ad hoc networks applications fulfill their expected potential to connect smart vehicles, several issues must be addressed. Among these issues, those related to security are of particular importance. In this article, the main security issues of broadcast message dissemination in vehicular ad hoc networks are discussed. Moreover, a review of the most relevant threats and proposed solutions to secure broadcast message dissemination in vehicular ad hoc networks is presented and discussed. As mentioned, security is an important topic which has not been fully addressed in vehicular ad hoc networks; therefore, the aim of this article is to introduce security issues and proposed solutions related to three main security concerns associated with the message dissemination process in vehicular ad hoc networks: network access, data consistency, and broadcast protocols.

This paper presents a quantitative study of the effects of using arbitrary-order operators in Neural Networks. It is based on a Recurrent Wavelet First-Order Neural Network (RWFONN), which can accurately identify several chaotic systems (measured by the mean square error and the coefficient of determination, also known as R-Squared, $r^2$) under a fixed parameter scheme in the neural algorithm. Using fractional operators, we analyze whether the identification capabilities of the RWFONN are improved, and whether it can identify signals from fractional-order chaotic systems. The results presented in this paper show that using a fractional-order Neural Network does not bring significant advantages in the identification process, compared to an integer-order RWFONN. Nevertheless, the neural algorithm (modeled with an integer-order derivative) proved capable of identifying fractional-order dynamical systems, whose behavior ranges from periodic and multi-stable to chaotic oscillations. That is, the performances of the Neural Network model with an integer-order derivative and the fractional-order network are practically identical, making the use of fractional-order RWFONN-type networks meaningless. The results deepen the work previously published by the authors, and contribute to developing structures based on robust and generic neural algorithms to identify more than one chaotic oscillator without retraining the Neural Network.