Handover Management in 5G Vehicular Networks

Abstract

Fifth-Generation (5G) vehicular networks support novel services with increased Quality of Service (QoS) requirements. Vehicular users need to be continuously connected to networks that fulfil the constraints of their services. Thus, the implementation of optimal Handover (HO) mechanisms for 5G vehicular architectures is deemed necessary. This work describes a scheme for performing HOs in 5G vehicular networks using the functionalities of the Media-Independent Handover (MIH) and Fast Proxy Mobile IPv6 (FPMIP) standards. The scheme supports both predictive and reactive HO scenarios. A velocity and alternative network monitoring process prepares each vehicle for both HO cases. In the case of predictive HO, each time the satisfaction grade of the vehicular user drops below a predefined threshold, the HO is initiated. On the other hand, in the case of reactive HO, the vehicle loses the connectivity with its serving network and connects to the available network that has obtained the higher ranking from the network selection process. Furthermore, the HO implementation is based on an improved version of the FPMIPv6 protocol. For the evaluation of the described methodology, a 5G vehicular network architecture was simulated. In this architecture, multiple network access technologies coexist, while the experimental results showed that the proposed scheme outperformed existing HO methods.

1. Introduction

Fifth-generation (5G) vehicular networks have emerged rapidly. In a typical 5G vehicular network architecture, vehicular equipment includes On-Board Units (OBUs) [1] and mobile User Equipment (UEs). Vehicles communicate with each other, as well as with access network infrastructures. Access networks usually construct a Fog [2] infrastructure, which interacts with a Cloud environment, offering vehicular services. Many vehicular users can be served from each vehicle, while each user can simultaneously use multiple services with different constraints with each other.

In this network environment, increased communication requirements are arising for the vehicular users and, thus, an increased number of network access resources is needed. To address this issue, the technology of Ultra-Dense Networking (UDN) [3,4] indicates that dense 5G access network infrastructures can be implemented, where an increased number of Points of Access (PoAs) can provide plenty of communication resources to users [5,6]. Regarding the operational principles of UDN, several different technologies can coexist in the network access environment. Indicatively, the Macrocells and Femtocells that construct the network access environment can implement technologies such as the IEEE 802.11p Wireless Access for Vehicular Environment (WAVE) [7], the 3GPP Long-Term Evolution Advanced (LTE-A) [8], and the IEEE 802.16 Worldwide Interoperability for Microwave Access (WiMAX) [9]. Furthermore, regarding the design principles of the 5G Core (5GC) [10], the core network of a 5G vehicular architecture applies virtualization techniques for resource manipulation, including network slicing [11] and mobility management [12]. Communication among virtual network functionalities is achieved using RESTful application programming interfaces (RESTful APIs) [13] over HTTPS-/JSON-based protocols [14]. As a result, the implementation of novel network manipulation algorithms becomes independent of the specific underlying hardware optimizing the support for heterogeneous network technologies.

The co-existence of heterogeneous wireless access technologies indicates the need for efficient manipulation of the vehicles’ mobility. This need has involved the employment of the IEEE Media Independent Handover (MIH) and the Fast Proxy Mobile IPv6 (FPMIPv6) standards [15] for the mobility transfer. Specifically, the MIH protocol defines HO operations across different access networks. Its architecture provides generic interfaces and primitives independent of the type of vehicular equipment and access networks, supporting link-layer events and network information retrieval. On the other hand, two reference HO scenarios are introduced in FPMIPv6, the predictive and the reactive scenario, depending on the vehicle’s speed. In the predictive scenario, the vehicle before disconnecting from its previous network sends a handover indication report to its Mobility Access Gateway (MAG) [16] declaring the new network, which is selected as the target for performing the HO. In case the vehicle connects to the new network without informing of its MAG in the previous network, the reactive operation of FPMIPv6 is performed.

Vehicles should always be connected to the most appropriate access network to fulfil the QoS constraints of their services. To address this issue, Multi-Attribute Decision-Making (MADM) algorithms can be applied to select the best alternative among candidate networks by taking into consideration a set of evaluation criteria. Well-known methodologies include the Analytic Hierarchy Process (AHP) [17], the Analytic Network Process (ANP) [18], Simple Additive Weighting (SAW) [17,19], Fuzzy SAW (FSAW) [20], Multiplicative Exponential Weighting (MEW) [17] and the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) [21].

This paper describes a methodology for supporting Handovers (HOs) on 5G vehicular networks. Both predictive and reactive HO modes are supported. During the vehicles movement, a velocity and alternative network monitoring process executes. This process applies the Mobility State Estimation (MSE) technique of the LTE [22], which was improved in [23], in order to facilitate the decision process by taking into consideration that both Macrocells and Femtocells can serve the territory of each vehicle. Thus, the vehicle’s velocity is continuously monitored and characterized as Normal, Medium, or High, considering the number of HOs performed by the vehicle during a sliding time window [23]. Furthermore, it ranks the candidate networks by taking into consideration the vehicle’s velocity, network characteristic criteria, provider policy criteria, and energy-aware criteria. Specifically, if the vehicle’s velocity is Normal, all the networks, including both Macrocells and Femtocells, are considered as network alternatives. On the other hand, if the vehicle’s velocity is Medium, some Femtocells along the vehicle’s trajectory are skipped, in order for the HO rate to be reduced. Finally, if the vehicle’s velocity is High, only the available Macrocells are considered as network alternatives. Moreover, in the predictive HO scenario, each time that the grade of the user satisfaction drops below a predefined threshold, the HO is initiated and the process of the network selection is performed. Correspondingly, in the reactive HO operation, whenever the vehicular user loses the connectivity with his/her serving network, it connects to the available network that obtained the higher ranking during the network selection process.

The discussed scheme implements several characteristics, including:

• The HO management services, namely the velocity and alternative network monitoring, the HO initiation, the network selection, and the HO execution are performed at the Fog and the Cloud infrastructures to reduce the workload at the vehicle;
• Both predictive and reactive HOs modes are supported for the mobility transfer;
• The vehicle’s velocity is considered in order for unnecessary HOs to short-range cells (such as Femtocells) to be avoided, since a vehicle that moves with high velocity will remain for a short time period inside their coverage area;
• HO initiation is performed by taking into consideration the user satisfaction, which is estimated using both the Signal-to-Noise-plus-Interference (SINR) and the perceived Quality of Service (QoS) parameters, due to the fact that users that perceive a good SINR may not be satisfied by the QoS that they also perceive from their current networks;
• Network selection takes into consideration contradictory criteria for different application types and users’ SLAs to satisfy the requirements of demanding services;
• The HO scheme applies an improved version of the MIH framework and the FPMIPv6 protocol.

The remainder of the paper is organized as follows: In Section 2, the related research literature is revised. Section 3 describes the proposed HO scheme, and Section 4 presents the implemented signaling process. Subsequently, Section 5 presents the simulation setup and the experimental results. Finally, Section 6 concludes the discussed work.

2. Related Work

In general, the HO process usually consists of the HO initiation, the network selection, and the HO execution subprocesses. Several HO schemes have been proposed in the research literature supporting the above network management functions.

In [24], the authors introduced the necessity of Quality of Service (QoS) and Quality of Experience (QoE) parameters in mobility management algorithms. In this approach, a QoE algorithm for video streaming in 5G vehicular networks (HoVe) is proposed in order to improve the overall handover performance. The Analytic Hierarchy Process (AHP) technique is used to identify the importance of the current metrics including radio resources, vehicle’s mobility, QoE. etc. The Structural Similarity (SSIM) is evaluated as a QoE metric estimating the corruption between the original and the transmitted video. The proposed algorithm outperforms the standard LTE RSSI-based algorithm [25] for video services.

In [26], the authors proposed an HO triggering scheme based on dynamic criteria. An important aspect of the handover process is the momentum of the trigger event, which initiates the HO. An imprecise trigger could produce service interruptions, data loss, latency, and radio-link failure. The proposed scheme benefits from the IEEE 802.21 Media Independent Handover (MIH) and its services, introducing the link going down event. A dynamic value is calculated to adjust the trigger point during the handover delivery time according to the mobile node’s current speed.

In [27], the authors presented a machine learning technique to predict the necessity of a handover so as to maintain the users’ QoE. The proposed method makes use of a support vector regression algorithm (SVR) to evaluate an HO score periodically per mobile node. The algorithm obtains the signal strength, the throughput, and the previous handover score of the node as the input criteria. The mobile node is triggered to perform the HO to a new network in case its handover cost is above a threshold specified by the system policy.

In [28], an MIH-enhanced FPMIPv6 methodology was proposed. In particular, the functionalities of the Evolved Packet Core (EPC) [29] were considered, while a scheme that implements the IEEE 802.11 MIH protocol in the EPC architecture for performing seamless HO was described. Additionally, the use of a transient flag was proposed for eliminating both the ping-pong effect and false HOs by retaining the initial and transient bindings at the LMA.

In [30], the Predictive Handover Mechanism for Video streaming in cloud-based urban VANET (PHMVV) method was proposed considering a list of alternative Points of Access (PoAs). The PHMVV takes into account parameters such as the velocity of the vehicle, its distance from each PoA, its moving direction, and the link quality of each PoA. Accordingly, when the vehicle approaches an alternative PoA with better link quality than that of its current PoA, the vehicle performs an HO to it.

In [31], the Mobility-Aware Handover scheme for Smart Cities Environment (MAH-SCE) was described. In particular, road traffic conditions were gathered from a Smart City [32] environment using sensors. An HO initiation mechanism initiates an HO considering the road traffic, as well as the SNR that the vehicle perceives from its current PoA. Additionally, in order to reduce the HO rate, Femtocells are not considered as network alternatives when the vehicle’s velocity is above 16 m/s. However, it has to be noted that the authors did not provide an adequate explanation about the selection of this specific threshold value. However, an adequate explanation about the selection of this specific threshold value was provided in [31]. Therefore, in our work, the vehicle’s velocity was also monitored and a different approach to this task was implemented by considering the operation principles of the LTE MSE technique [22].

In [33], the Mobility-Aware Handover in Ultra-Dense Vehicular Environment (MAH-UDVE) method was proposed. The direction to which each vehicle moves is considered for the most appropriate PoA to be selected. Specifically, the vehicle’s mobility is analyzed in order for a set of network alternatives to be created. Regarding the target network to perform the HO, three options were assessed including the network cell, the next cell in the same or opposite direction of the vehicle, and the cell with the lowest load.

In [34], the Context-Aware Load Balancing (HO-CALB) mobility management scheme was proposed. HO-CALB is applied to a network architecture where both WiFi and WiMAX networks coexist. When the QoS that each user perceives drops below a predefined threshold, an HO will be initiated. Thereafter, during the network selection, the data traffic load is distributed to WiMAX and WiFi PoAs by taking into consideration the available bandwidth of each one.

In [35], the Velocity-Aware Handover (VAH) technique was described. Two network tiers are defined. The first tier consists of Macrocells, while the second tier contains Femtocells. Furthermore, four HO mechanisms are employed. The first one is called the Best Connected (BC)mechanism, and it is applied to users with Low mobility or static users. In this case, all the network cells available in the area of each user, including both Macrocells and Femtocells, are considered as candidate networks. The user selects the nearest Macrocell if $P_1·B_1·R_1^{-\eta }>P_2·B_2·R_2^{-\eta }$, otherwise the nearest Femtocell is selected as the target network for the HO. The parameter P represents the transmission power. Furthermore, the parameter B represents the bias factor. R represents the user distance, and $\eta$ is the path loss exponent for each tier. The second tier is called the Femto Skipping (FS) mechanism, and it is used by vehicles with Medium mobility. In this case, some Femtocells are skipped to reduce the HO rate, when $P_1·B_1·R_1^{-\eta }<P_2·B_2·R_2^{-\eta }$. Furthermore, the third tier is called the Femto Disregard (FD) mechanism, and it is applied to vehicular users with High mobility. In this case, all the Femtocells are skipped. Finally, the fourth tier is called the Macro Skipping (MS) mechanism and is applied to users with Extremely High mobility, while in this case, all the Femtocells as well as some of the Macrocells are not considered as alternative networks.

3. Preliminaries

The proposed HO management scheme uses Interval-Valued Icosagonal Fuzzy Numbers (IVIFNs) for the representation of the criteria values considered in both the HO initiation and network selection processes. For the creation of the IVIFNs, the Equalized Universe Method (EUM) is applied. Thus, the created fuzzy numbers are equally distributed inside the predefined domain $[0,1]$. Additionally, the criteria weights for both HO initiation and network selection are estimated using the Icosagonal Fuzzy Analytic Network Process (IFANP) method.

During the HO initiation, the Mamdani Icosagonal Fuzzy Inference System (MIFIS) is used to decide when an HO must be initiated. Furthermore, during the network selection, the most appropriate network is selected by applying the Dynamic Icosagonal Fuzzy TOPSIS with Adaptive Criteria Weights (DIFT-ACW) method. In this work, criteria such as the vehicle’s velocity, the QoS constraints of vehicular user services, the user SLA, and the remaining energy of the user equipment are considered for the network selection. Furthermore, in special cases (e.g., emergency situations), the severity level of a natural disaster is also considered.

The following subsections describe the aforementioned methods, while the design of the discussed mobility management scheme is described in Section 4.

3.1. The Interval-Valued Icosagonal Fuzzy Numbers

Fuzzy logic can be used to solve problems by taking into consideration approximate information, while a fuzzy number is represented by a set of real values indicating an uncertain quantity. In this work, icosagonal fuzzy numbers were used, providing increased computational accuracy in comparison with the aforementioned ones. An icosagonal fuzzy number can be defined as a vector $x=(x_1,x_2,x_3,x_4,x_5,x_6,x_7,x_8,x_9,x_{10},x_{11},x_{12},x_{13},x_{14},x_{15},x_{16},x_{17},x_{18},x_{19},x_{20},v_{\widehat{A}},v_{\widehat{A}1},v_{\widehat{A}2},v_{\widehat{A}3},v_{\widehat{A}4},v_{\widehat{A}5},v_{\widehat{A}6},v_{\widehat{A}7},v_{\widehat{A}8})$ with membership function:

$$\mu \left(x\right)=\left\{\begin{array}{cc}{v}_{\widehat{A}1}·\frac{x-x_1}{x_2-x_1},\hfill & \mathrm{if}{x}_1⩽x<x_2;\hfill \\ v_{\widehat{A}1},\hfill & \mathrm{if}{x}_2⩽x<x_3;\hfill \\ v_{\widehat{A}2}-(v_{\widehat{A}2}-v_{\widehat{A}1})·\frac{x-x_3}{x_4-x_3},\hfill & \mathrm{if}{x}_3⩽x<x_4;\hfill \\ v_{\widehat{A}2},\hfill & \mathrm{if}{x}_4⩽x<x_5;\hfill \\ v_{\widehat{A}3}-(v_{\widehat{A}3}-v_{\widehat{A}2})·\frac{x-x_5}{x_6-x_5},\hfill & \mathrm{if}{x}_5⩽x<x_6;\hfill \\ v_{\widehat{A}3},\hfill & \mathrm{if}{x}_6⩽x<x_7;\hfill \\ v_{\widehat{A}4}-(v_{\widehat{A}4}-v_{\widehat{A}3})·\frac{x-x_7}{x_8-x_7},\hfill & \mathrm{if}{x}_7⩽x<x_8;\hfill \\ v_{\widehat{A}4},\hfill & \mathrm{if}{x}_8⩽x<x_9;\hfill \\ v_{\widehat{A}}-(v_{\widehat{A}}-v_{\widehat{A}4})·\frac{x-x_9}{x_{10}-x_9},\hfill & \mathrm{if}{x}_9⩽x<x_{10};\hfill \\ v_{\widehat{A}},\hfill & \mathrm{if}{x}_{10}⩽x<x_{11};\hfill \\ v_{\widehat{A}}-(v_{\widehat{A}}-v_{\widehat{A}5})·\frac{x-x_{12}}{x_{11}-x_{12}},\hfill & \mathrm{if}{x}_{11}⩽x<x_{12};\hfill \\ v_{\widehat{A}5},\hfill & \mathrm{if}{x}_{12}⩽x<x_{13};\hfill \\ v_{\widehat{A}5}-(v_{\widehat{A}5}-v_{\widehat{A}6})·\frac{x-x_{14}}{x_{13}-x_{14}},\hfill & \mathrm{if}{x}_{13}⩽x<x_{14};\hfill \\ v_{\widehat{A}6},\hfill & \mathrm{if}{x}_{14}⩽x<x_{15};\hfill \\ v_{\widehat{A6}}-(v_{\widehat{A}6}-v_{\widehat{A}5})·\frac{x-x_{16}}{x_{15}-x_{16}},\hfill & \mathrm{if}{x}_{15}⩽x<x_{16};\hfill \\ v_{\widehat{A}7},\hfill & \mathrm{if}{x}_{16}⩽x<x_{17};\hfill \\ v_{\widehat{A}7}-(v_{\widehat{A}7}-v_{\widehat{A}8})·\frac{x-x_{18}}{x_{17}-x_{18}},\hfill & \mathrm{if}{x}_{17}⩽x<x_{18};\hfill \\ v_{\widehat{A}8},\hfill & \mathrm{if}{x}_{18}⩽x<x_{19};\hfill \\ v_{\widehat{A}8}·\frac{x-x_{20}}{x_{19}-x_{20}},\hfill & \mathrm{if}{x}_{19}⩽x⩽x_{20};\hfill \\ 0,\hfill & \mathrm{otherwise}.\hfill \end{array}\right.$$

(1)

where $x_1⩽x_2⩽x_3⩽x_4⩽x_5⩽x_6⩽x_7⩽x_8⩽x_9⩽x_{10}⩽x_{11}⩽x_{12}⩽x_{13}⩽x_{14}⩽x_{15}⩽x_{16}⩽x_{17}⩽x_{18}⩽x_{19}⩽x_{20}$ and $v_{\widehat{A}},v_{\widehat{A}1},v_{\widehat{A}2},v_{\widehat{A}3},v_{\widehat{A}4},v_{\widehat{A}5},v_{\widehat{A}6},v_{\widehat{A}7},v_{\widehat{A}8})\in [0,1]$.

An Interval-Valued Fuzzy Number (IVFN) is defined as $A=[A^L,A^U]$, where the $A^L$ parameter denotes the lower fuzzy number and the parameter $A^U$ denotes the upper one [36]. IVFNs replace the crisp numbers by intervals in $[0,1]$. In general, they are useful for solving Multiple Attribute Decision-Making (MADM) problems due to the fact that fuzzy information is better expressed using intervals than using crisp values. Specifically, an IVFS A is defined as follows [37]:

$$\begin{array}{c}A=\left\{(x,[{\mu }_A^L\left(x\right),{\mu }_A^U\left(x\right)])\right\}\end{array}$$

(2)

$$\begin{array}{c}{\mu }_A^L\left(x\right),{\mu }_A^U\left(x\right):X\to [0,1]\forall x\in X,{\mu }_A^L\left(x\right)<{\mu }_A^U\left(x\right)\end{array}$$

(3)

$$\begin{array}{c}{\widehat{\mu }}_A\left(x\right)=[{\mu }_A^L\left(x\right),{\mu }_A^U\left(x\right)]\end{array}$$

(4)

$$\begin{array}{c}A=\left\{(x,{\widehat{\mu }}_A\left(x\right))\right\},x\in (-\infty ,\infty )\end{array}$$

(5)

The Interval-Valued Icosagonal Fuzzy Number (IVIFN) [38] is the most general IVFN case (Figure 1), defined as: $A=[A^L,A^U]=[(x_1^L,x_2^L,x_3^L,x_4^L,x_5^L,x_6^L,x_7^L,x_8^L,x_9^L,x_{10}^L,x_{11}^L,x_{12}^L,x_{13}^L,x_{14}^L,x_{15}^L,x_{16}^L,x_{17}^L,x_{18}^L,x_{19}^L,x_{20}^L,v_A^L,v_{A1}^L,v_{A2}^L,v_{A3}^L,v_{A4}^L,v_{A5}^L,v_{A6}^L,v_{A7}^L,v_{A8}^L),(x_1^U,x_2^U,x_3^U,x_4^U,x_5^U,x_6^U,x_7^U,x_8^U,x_9^U,x_{10}^U,x_{11}^U,x_{12}^U,x_{13}^U,x_{14}^U,x_{15}^U,x_{16}^U,x_{17}^U,x_{18}^U,x_{19}^U,x_{20}^U,v_A^U,v_{A1}^U,v_{A2}^U,v_{A3}^U,v_{A4}^U,v_{A5}^U,v_{A6}^U,v_{A7}^U,v_{A8}^U))]$ where: $A^L\subset A^U$, $0⩽x_1^L⩽x_2^L⩽x_3^L⩽x_4^L⩽x_5^L⩽x_6^L⩽x_7^L⩽x_8^L⩽x_9^L⩽x_{10}^L⩽x_{11}^L⩽x_{12}^L⩽x_{13}^L⩽x_{14}^L⩽x_{15}^L⩽x_{16}^L⩽x_{17}^L⩽x_{18}^L⩽x_{19}^L⩽x_{20}^L⩽1$, $0⩽x_1^U⩽x_2^U⩽x_3^U⩽x_4^U⩽x_5^U⩽x_6^U⩽x_7^U⩽x_8^U⩽x_9^U⩽x_{10}^U⩽x_{11}^U⩽x_{12}^U⩽x_{13}^U⩽x_{14}^U⩽x_{15}^U⩽x_{16}^U⩽x_{17}^U⩽x_{18}^U⩽x_{19}^U⩽x_{20}^U⩽1$, $v_A^L⩽v_A^U$, $v_{A1}^L⩽v_{A2}^L⩽v_{A3}^L⩽v_{A4}^L⩽v_A^L⩽v_{A5}^L⩽v_{A6}^L⩽v_{A7}^L⩽v_{A8}^L$, $v_{A1}^U⩽v_{A2}^U⩽v_{A3}^U⩽v_{A4}^U⩽v_A^U⩽v_{A5}^U⩽v_{A6}^U⩽v_{A7}^U⩽v_{A8}^U$ and $v_A^L,v_{A1}^L,v_{A2}^L,v_{A3}^L,v_{A4}^L,v_{A5}^L,v_{A6}^L,v_{A7}^L,v_{A8}^L,v_A^U,v_{A1}^U,v_{A2}^U,v_{A3}^U,v_{A4}^U,v_{A5}^U,v_{A6}^U,v_{A7}^U,v_{A8}^U\in [0,1]$.

$$IVIF{N}_i=\left\{\begin{array}{c}{x}_{i,1}^U=d_i-\frac{p^U}{2}-9·p^U,x_{i,1}^L=d_i-\frac{p^L}{2}-9·p^L\hfill \\ x_{i,2}^U=d_i-\frac{p^U}{2}-8·p^U,x_{i,1}^L=d_i-\frac{p^L}{2}-8·p^L\hfill \\ x_{i,3}^U=d_i-\frac{p^U}{2}-7·p^U,x_{i,1}^L=d_i-\frac{p^L}{2}-7·p^L\hfill \\ x_{i,4}^U=d_i-\frac{p^U}{2}-6·p^U,x_{i,1}^L=d_i-\frac{p^L}{2}-6·p^L\hfill \\ x_{i,5}^U=d_i-\frac{p^U}{2}-5·p^U,x_{i,1}^L=d_i-\frac{p^L}{2}-5·p^L\hfill \\ x_{i,6}^U=d_i-\frac{p^U}{2}-4·p^U,x_{i,1}^L=d_i-\frac{p^L}{2}-4·p^L\hfill \\ x_{i,7}^U=d_i-\frac{p^U}{2}-3·p^U,x_{i,1}^L=d_i-\frac{p^L}{2}-3·p^L\hfill \\ x_{i,8}^U=d_i-\frac{p^U}{2}-2·p^U,x_{i,1}^L=d_i-\frac{p^L}{2}-2·p^L\hfill \\ x_{i,9}^U=d_i-\frac{p^U}{2}-p^U,x_{i,1}^L=d_i+\frac{p^L}{2}-p^L\hfill \\ x_{i,10}^U=d_i-\frac{p^U}{2},x_{i,1}^L=d_i-\frac{p^L}{2}\hfill \\ x_{i,11}^U=d_i+\frac{p^U}{2},x_{i,1}^L=d_i+\frac{p^L}{2}\hfill \\ x_{i,12}^U=d_i+\frac{p^U}{2}+p^U,x_{i,1}^L=d_i+\frac{p^L}{2}+p^L\hfill \\ x_{i,12}^U=d_i+\frac{p^U}{2}+2·p^U,x_{i,1}^L=d_i+\frac{p^L}{2}+2·p^L\hfill \\ x_{i,14}^U=d_i+\frac{p^U}{2}+3·p^U,x_{i,1}^L=d_i+\frac{p^L}{2}+3·p^L\hfill \\ x_{i,15}^U=d_i+\frac{p^U}{2}+4·p^U,x_{i,1}^L=d_i+\frac{p^L}{2}+4·p^L\hfill \\ x_{i,16}^U=d_i+\frac{p^U}{2}+5·p^U,x_{i,1}^L=d_i+\frac{p^L}{2}+5·p^L\hfill \\ x_{i,17}^U=d_i+\frac{p^U}{2}+6·p^U,x_{i,1}^L=d_i+\frac{p^L}{2}+6·p^L\hfill \\ x_{i,18}^U=d_i+\frac{p^U}{2}+7·p^U,x_{i,1}^L=d_i+\frac{p^L}{2}+7·p^L\hfill \\ x_{i,19}^U=d_i+\frac{p^U}{2}+8·p^U,x_{i,1}^L=d_i+\frac{p^L}{2}+8·p^L\hfill \\ x_{i,20}^U=d_i+\frac{p^U}{2}+9·p^U,x_{i,1}^L=d_i+\frac{p^L}{2}+9·p^L\hfill \end{array}\right.$$

(6)

3.2. The Equalized Universe Method

In this work, the Equalized Universe Method (EUM) [39] was applied for the creation of IVIFNs by distributing their centroids equally along a predefined domain of values. In particular, the values of the ith IVIFN are calculated using Formula (6), where $d_i$ represents the centroid of the ith IVIFN, calculated using Formula (7). Furthermore, $p^U$ is the distance between consecutive intervals of the upper icosagon calculated using Formula (8) where $z^U$ is the width of the upper icosagon. Specifically, $z^U$ is calculated using Formula (9), where c represents the number of IVFNs and $\theta \in [0,c]$ is a constant factor for configuring the width of the icosagon. Similarly, $p^L$ is the distance between consecutive intervals of the lower icosagon calculated using Formula (10) where $z^L$ is the width of the lower icosagon calculated using Formula (11). Finally, the $v_A^L$, $v_{A1}^L$, $v_{A2}^L$, $v_{A3}^L$, $v_{A4}^L$, $v_{A5}^L$, $v_{A6}^L$, $v_{A7}^L$, $v_{A8}^L$, $v_A^U$, $v_{A1}^U$, $v_{A2}^U$, $v_{A3}^U$, $v_{A4}^U$, $v_{A5}^U$, $v_{A6}^U$, $v_{A7}^U$, and $v_{A8}^U$ parameters are defined by the user.

$$d_i=U_{min}+\frac{U_{max}-U_{min}}{c-1}·(i-1)$$

(7)

$$p^U=\frac{z^U}{g-1}$$

(8)

$$z^U=\frac{U_{max}-U_{min}}{c-\theta }$$

(9)

$$p^L=\frac{z^L}{g-1}$$

(10)

$$z^L=z^U·\frac{v_A^L}{v_A^U}$$

(11)

3.3. The Icosagonal Fuzzy Analytic Network Process

The Icosagonal Fuzzy Analytic Network Process (IFANP) method implements the Analytic Network Process (ANP) using IVIFNs, which usually is applied for the estimation of the weights of criteria considered in MADM problems. In particular, for the estimation of criteria weights, the considered criteria are organized into clusters. The relations between criteria that belong to the same cluster are called “inner dependences”, while the relations between criteria that belong to different clusters are called “outer dependences”. Indicatively, in this work, three clusters of criteria were considered. The first one contains the network characteristics’ criteria such as throughput, latency, jitter, and packet loss. Correspondingly, the second cluster contains operator policy criteria such as service reliability, security, and monetary cost, while the third cluster contains energy-aware criteria such as the energy consumption that occurs for a user equipment that interacts with the network.

Regarding the implementation of the IFANP method, a fuzzy pairwise comparison matrix $\tilde{A}$ is constructed for each cluster of criteria. The form of this matrix is presented in Formula (12), where n represents the number of criteria that belong to the corresponding cluster. Furthermore, Figure 2 presents the linguistic terms that can be used for the representation of the relative importance of each criterion in comparison with each one of the other criteria. It has to be noted that the aforementioned linguistic terms were created using the EUM method.

$$\tilde{A}=\begin{array}{ccccc}1\hfill & \dots \hfill & {\tilde{a}}_{1j}\hfill & \dots \hfill & {\tilde{a}}_{1n}\hfill \\ ⋮\hfill & \hspace{1em}\hfill & ⋮\hfill & \hspace{1em}\hfill & ⋮\hfill \\ 1/{\tilde{a}}_{1i}\hfill & \dots \hfill & 1\hfill & \dots \hfill & {\tilde{a}}_{in}\hfill \\ ⋮\hfill & \hspace{1em}\hfill & ⋮\hfill & \hspace{1em}\hfill & ⋮\hfill \\ 1/{\tilde{a}}_{1n}\hfill & \dots \hfill & 1/{\tilde{a}}_{jn}\hfill & \dots \hfill & 1\hfill \end{array}$$

(12)

Furthermore, Formula (13) is applied for the calculation of the geometric mean $r_{{\tilde{A}}_i}$ of each row i in the pairwise comparison matrix $\tilde{A}$. In this formula, the ⊗ operator represents the multiplication of two IVIFNs.

$$r_{{\tilde{A}}_i}={({\tilde{a}}_{i1}\otimes {\tilde{a}}_{i2}\otimes \dots \otimes {\tilde{a}}_{in})}^{\frac{1}{n}}$$

(13)

Following this, Formula (14) is applied for the construction of the priority vector ${\tilde{\mathsf{\Omega }}}_i$ of each criterion of the cluster.

$${\tilde{\mathsf{\Omega }}}_i=[{\tilde{\omega }}_1{\tilde{\omega }}_2\dots {\tilde{\omega }}_n]$$

(14)

In this priority vector, each ${\tilde{\omega }}_i=[({\omega }_1^U,{\omega }_2^U,{\omega }_3^U,{\omega }_4^U,{\omega }_5^U,{\omega }_6^U,{\omega }_7^U,{\omega }_8^U,{\omega }_9^U,{\omega }_{10}^U,{\omega }_{11}^U,{\omega }_{12}^U,{\omega }_{13}^U,{\omega }_{14}^U,{\omega }_{15}^U,{\omega }_{16}^U,{\omega }_{17}^U,{\omega }_{18}^U,{\omega }_{19}^U,{\omega }_{20}^U,v_i^U,v_{i1}^U,v_{i2}^U,v_{i3}^U,v_{i4}^U,v_{i5}^U,v_{i6}^U,v_{i7}^U,v_{i8}^U);$$({\omega }_1^L,{\omega }_2^L,{\omega }_3^L,{\omega }_4^L,{\omega }_5^L,{\omega }_6^L,{\omega }_7^L,{\omega }_8^L,{\omega }_9^L,{\omega }_{10}^L,{\omega }_{11}^L,{\omega }_{12}^L,{\omega }_{13}^L,{\omega }_{14}^L,{\omega }_{15}^L,{\omega }_{16}^L,{\omega }_{17}^L,{\omega }_{18}^L,{\omega }_{19}^L,{\omega }_{20}^L,v_i^L,v_{i1}^L,v_{i2}^L,v_{i3}^L,v_{i4}^L,v_{i5}^L,v_{i6}^L,v_{i7}^L,v_{i8}^L)]$ is calculated using Formula (15). In this formula, the ⊕ operator represents the addition operator of two IVIFNS.

$$\begin{array}{c}\hfill {\tilde{\omega }}_i=r_{{\tilde{A}}_i}/(r_{{\tilde{A}}_1}\oplus r_{{\tilde{A}}_2}\oplus \dots \oplus r_{{\tilde{A}}_i}\oplus \dots \oplus r_{{\tilde{A}}_n})\end{array}$$

(15)

Subsequently, the fuzzy supermatrix $\tilde{W}$ is created. It represents both the inner and outer dependencies of the considered clusters of criteria. In particular, the supermatrix $\tilde{W}$ is a partitioned matrix, where each matrix segment represents the relationship between two clusters of criteria. For the construction of the supermatrix, the local priority vectors $\tilde{\mathsf{\Omega }}$ are grouped and placed in the appropriate positions in the supermatrix by taking into consideration the relative importance of each cluster in comparison with each one of the other clusters. Indicatively, by assuming that there are q clusters available, with each cluster $C_k$, $k=[1,2,\dots ,q]$ containing $n_k$ criteria, denoted as $e_{k1},e_{k2},\dots ,e_{k{n}_k}$, then the supermatrix is expressed as presented in Formula (16).

$$\tilde{W}=\begin{array}{ccccccc}& & C_1& \dots & C_k& \dots & C_q\\ & & e_{11}\dots e_{1n_1}& \dots & e_{k1}\dots e_{k{n}_k}& \dots & e_{q1}\dots e_{q{n}_q}\\ & e_{11}& & & & & \\ C_1& ⋮& {\tilde{W}}_{11}& \dots & {\tilde{W}}_{1j}& \dots & {\tilde{W}}_{1q}\\ & e_{1n_1}& & & & & \\ ⋮& & ⋮& ⋮& ⋮& ⋮& ⋮\\ & e_{k1}& & & & & \\ C_k& ⋮& {\tilde{W}}_{k1}& \dots & {\tilde{W}}_{kj}& \dots & {\tilde{W}}_{kq}\\ & e_{k{n}_k}& & & & & \\ ⋮& & ⋮& ⋮& ⋮& ⋮& ⋮\\ & e_{q1}& & & & & \\ C_q& ⋮& {\tilde{W}}_{q1}& \dots & {\tilde{W}}_{qj}& \dots & {\tilde{W}}_{qq}\\ & e_{q{n}_q}& & & & & \end{array}$$

(16)

Thereafter, the Weighted Supermatrix ${\tilde{W}}^{\prime }$ is created by applying Formula (17).

$${\tilde{W}}_{k,j}^{\prime }={\tilde{W}}_{k,j}/q$$

(17)

Then, the Weighted Average method is applied to defuzzify the Weighted Supermatrix. This method applies Formula (18), where v represents the height and d represents the centroid of each ${\tilde{W}}_{k,j}^{\prime }$ icosagon, respectively. In particular, W is raised to limiting powers to produce the Limited Supermatrix, where all the columns have the same values indicating the global priority of each criterion. Thus, the overall criteria weights are estimated.

$$W_{k,j}=\frac{v^U·d^U+v^L·d^L}{d^U+d^L}$$

(18)

3.4. The Mamdani Icosagonal Fuzzy Inference System

The Mamdani Icosagonal Fuzzy Inference System (MIFIS) takes into consideration two inputs ($Inpu{t}_1$ and $Inpu{t}_2$) to calculate the value of the $Output$ using fuzzy logic. The values of both $Inpu{t}_1$ and $Inpu{t}_2$ are normalized within the range [0, 1]. Additionally, the $M{F}_{Inpu{t}_1}$, $M{F}_{Inpu{t}_2}$, $M{F}_{Output}$ Membership Functions (MFs) are created, indicating the linguistic terms and the corresponding IVIFNs for the fuzzy representation of $Inpu{t}_1$, $Inpu{t}_2$, and $Output$, respectively. As a result, for each crisp value, two membership degrees are determined in the respective MF, one for the upper icosagon and one for the lower icosagon.

Regarding the implementation of the MIFIS method, initially, the Membership Functions (MFs) for the $Inpu{t}_1$, $Inpu{t}_2$, and $Output$ parameters are determined. Furthermore, a knowledge base that contains R fuzzy rules is created. In this base, each rule $r\in R$ is a simple if–then statement with a condition and a conclusion. The rule’s condition consists of $M{F}_{Inpu{t}_1}$ and $M{F}_{Inpu{t}_2}$ membership functions, while its conclusion indicates an $M{F}_{Output}$ membership function. Subsequently, the $Inpu{t}_1$ and $Inpu{t}_2$ crisp values are converted to degrees of membership indicated as $Inpu{t}_1^{\prime }$ and $Inpu{t}_2^{\prime }$ by a lookup in the $M{F}_{Inpu{t}_1}$ and $M{F}_{Inpu{t}_2}$ membership functions, respectively. Thereafter, fuzzy operations are performed in order for the fuzzified inputs to be combined. In particular, the rule’s condition is considered a $Z_r^{\prime }$ strength of the r rule to be calculated. In addition, the fuzzy operators “AND” and “OR” can be used in multiple conditions to be combined. In this case, the “algebraic product” is applied for the “AND” operator, while the “algebraic sum” is applied for the “OR” operator. In this work, Formula (19) was used for the estimation of the “algebraic product”, while Formula (20) was used for the estimations of the “algebraic sum”.

$$Z_{u,i,r}^{\prime }=Inpu{t}_1^{\prime }\widehat{·}Inpu{t}_2^{\prime }=Inpu{t}_1^{\prime }·Inpu{t}_2^{\prime }$$

(19)

$$Z_{u,i,r}^{\prime }=(Inpu{t}_1^{\prime }+Inpu{t}_2^{\prime })-(Inpu{t}_1^{\prime }·Inpu{t}_2^{\prime })$$

(20)

Then, the consequence $M{F}_{Outpu{t}_r^c}$ of the rule conclusion is estimated by applying an implication method. Specifically, the implication method trims the $M{F}_{Outpu{t}_r}$ height by taking into consideration the $Z_r^{\prime }$ strength, by applying Formula (21), which implements the Min method.

$$M{F}_{Outpu{t}_{r_{Height}}^c}=min\{M{F}_{Outpu{t}_{r_{Height}}},Z_r^{\prime }\}$$

(21)

Subsequently, the R rules’ consequences are combined by applying an aggregation method in the $Outpu{t}^A$ fuzzy set to be calculated. In particular, the aggregation method uses Formula (22), which implements the Max method.

$$Outpu{t}^A=M{F}_{Outpu{t}_1^c}\cup M{F}_{Outpu{t}_2^c}\cup \dots \cup M{F}_{Outpu{t}_R^c}$$

(22)

Finally, defuzzification is performed. Specifically, the $Outpu{t}^A$ fuzzy set is transformed to the crisp value $Output$. In this case, the Weighted Average method is applied using Formula (23). In this formula, the ${\mu }_r$ represents the height of each rule and $h_r$ represents the centroid of each rule, as they are obtained from $Outpu{t}^A$. Moreover, the parameters U and L indicate the upper and the lower icosagon of each rule, respectively.

$$Output=\frac{{\displaystyle \sum _{r=1}^R}({\mu }_r^U·h_r^U+{\mu }_r^L·h_r^L)}{{\displaystyle \sum _{r=1}^R}(h_r^U+h_r^L)}$$

(23)

3.5. The Dynamic Icosagonal Fuzzy TOPSIS with Adaptive Criteria Weights

The Dynamic Icosagonal Fuzzy TOPSIS with Adaptive Criteria Weights (DIFT-ACW) algorithm improves the Icosagonal Fuzzy TOPSIS (IFT) methodology proposed in [40] by embedding the characteristics of the Dynamic Trapezoidal Fuzzy TOPSIS with Adaptive Criteria Weights (DTFT-ACW) algorithm described in [41]. Thus, the DIFT-ACW adapts its decisions according to specific factors such as the battery level of the user equipment. Regarding the implementations of the DIFT-ACW algorithm, suppose $C=\{C_1,C_2,\cdots ,C_m\}$ is the set of criteria and $w_1,w2,\cdots ,w_m$ are the weights of each criterion. The criteria weights are adapted by taking into consideration the fact that some services could be more important than the others. In particular, the relative importance of each service q is determined using a priority vector $\tilde{\mathsf{\Omega }}$, which is calculated using Formula (14) where each ${\omega }_{ij}\left(t\right)=[({\omega }_{ij1}^U\left(t\right),{\omega }_{ij2}^U\left(t\right),{\omega }_{ij3}^U\left(t\right),{\omega }_{ij4}^U\left(t\right),{\omega }_{ij5}^U\left(t\right),{\omega }_{ij6}^U\left(t\right),{\omega }_{ij7}^U\left(t\right),{\omega }_{ij8}^U\left(t\right),{\omega }_{ij9}^U\left(t\right),{\omega }_{ij10}^U\left(t\right),{\omega }_{ij11}^U\left(t\right),{\omega }_{ij12}^U\left(t\right),{\omega }_{ij13}^U\left(t\right),{\omega }_{ij14}^U\left(t\right),{\omega }_{ij15}^U\left(t\right),{\omega }_{ij16}^U\left(t\right),{\omega }_{ij17}^U\left(t\right),{\omega }_{ij18}^U\left(t\right),{\omega }_{ij19}^U\left(t\right),{\omega }_{ij20}^U\left(t\right),v_{ij}^U\left(t\right),v_{ij1}^U\left(t\right),v_{ij2}^U\left(t\right),v_{ij3}^U\left(t\right),v_{ij4}^U\left(t\right),v_{ij5}^U\left(t\right),v_{ij6}^U\left(t\right),v_{ij7}^U\left(t\right),v_{ij8}^U\left(t\right)),({\omega }_{ij1}^L\left(t\right),{\omega }_{ij2}^L\left(t\right),{\omega }_{ij3}^L\left(t\right),{\omega }_{ij4}^L\left(t\right),{\omega }_{ij5}^L\left(t\right),{\omega }_{ij6}^L\left(t\right),{\omega }_{ij7}^L\left(t\right),{\omega }_{ij8}^L\left(t\right),{\omega }_{ij9}^L\left(t\right),{\omega }_{ij10}^L\left(t\right),{\omega }_{ij11}^L\left(t\right),{\omega }_{ij12}^L\left(t\right),{\omega }_{ij13}^L\left(t\right),{\omega }_{ij14}^L\left(t\right),{\omega }_{ij15}^L\left(t\right),{\omega }_{ij16}^L\left(t\right),{\omega }_{ij17}^L\left(t\right),{\omega }_{ij18}^L\left(t\right),{\omega }_{ij19}^L\left(t\right),{\omega }_{ij20}^L\left(t\right),v_{ij}^L\left(t\right),v_{ij1}^L\left(t\right),v_{ij2}^L\left(t\right),v_{ij3}^L\left(t\right),v_{ij4}^L\left(t\right),v_{ij5}^L\left(t\right),v_{ij6}^L\left(t\right),v_{ij7}^L\left(t\right),v_{ij8}^L\left(t\right))]$ and Q is the number of the considered services.

$$\tilde{\mathsf{\Omega }}=[{\tilde{\omega }}_1{\tilde{\omega }}_2\dots {\tilde{\omega }}_Q]$$

(24)

Furthermore, at each time t, a list $A\left(t\right)=\{A_1\left(t\right),A_2\left(t\right),\cdots ,A_z\left(t\right)\}$ is constructed determining the current network alternatives.

In particular, initially, each $x_{ij}\left(t\right)$ element of the $n\times m$ decision matrix $D\left(t\right)$ is an IVIFN, which expresses the performance of alternative i for the criterion j, as presented to Formula (25).

$$D\left(t\right)=\begin{array}{cccc}\hfill & \hfill C_1\left(t\right)& \hfill \cdots & \hfill C_m\left(t\right)\\ \hfill A_1\left(t\right)& \hfill x_{11}\left(t\right)& \hfill \cdots & \hfill x_{1m}\left(t\right)\\ \hfill ⋮& \hfill ⋮& \hfill \ddots & \hfill ⋮\\ \hfill A_n\left(t\right)& \hfill x_{n1}\left(t\right)& \hfill \cdots & \hfill x_{nm}\left(t\right)\end{array}$$

(25)

where: $x_{ij}\left(t\right)=[(x_{ij1}^U\left(t\right),x_{ij2}^U\left(t\right),x_{ij3}^U\left(t\right),x_{ij4}^U\left(t\right),x_{ij5}^U\left(t\right),x_{ij6}^U\left(t\right),x_{ij7}^U\left(t\right),x_{ij8}^U\left(t\right),x_{ij9}^U\left(t\right),x_{ij10}^U\left(t\right),x_{ij11}^U\left(t\right),x_{ij12}^U\left(t\right),x_{ij13}^U\left(t\right),x_{ij14}^U\left(t\right),x_{ij15}^U\left(t\right),x_{ij16}^U\left(t\right),x_{ij17}^U\left(t\right),x_{ij18}^U\left(t\right),x_{ij19}^U\left(t\right),x_{ij20}^U\left(t\right),v_{ij}^U\left(t\right),v_{ij1}^U\left(t\right),v_{ij2}^U\left(t\right),v_{ij3}^U\left(t\right),v_{ij4}^U\left(t\right),v_{ij5}^U\left(t\right),v_{ij6}^U\left(t\right),v_{ij7}^U\left(t\right),v_{ij8}^U\left(t\right)),(x_{ij1}^L\left(t\right),x_{ij2}^L\left(t\right),x_{ij3}^L\left(t\right),x_{ij4}^L\left(t\right),x_{ij5}^L\left(t\right),x_{ij6}^L\left(t\right),x_{ij7}^L\left(t\right),x_{ij8}^L\left(t\right),x_{ij9}^L\left(t\right),x_{ij10}^L\left(t\right),x_{ij11}^L\left(t\right),x_{ij12}^L\left(t\right),x_{ij13}^L\left(t\right),x_{ij14}^L\left(t\right),x_{ij15}^L\left(t\right),x_{ij16}^L\left(t\right),x_{ij17}^L\left(t\right),x_{ij18}^L\left(t\right),x_{ij19}^L\left(t\right),x_{ij20}^L\left(t\right),v_{ij}^L\left(t\right),v_{ij1}^L\left(t\right),v_{ij2}^L\left(t\right),v_{ij3}^L\left(t\right),v_{ij4}^L\left(t\right),v_{ij5}^L\left(t\right),v_{ij6}^L\left(t\right),v_{ij7}^L\left(t\right),v_{ij8}^L\left(t\right))]$. In case there are Q services, the decision matrix includes the average of the performance values by applying Formula (26). Correspondingly, in this case, the criteria weights are obtained as the average of the individual weights of the considered services by applying Formula (27).

$$x_{ij}\left(t\right)=\frac{1}{Q}\sum _{k=1}^Q{x}_{ijk}\left(t\right)·{\omega }_k\left(t\right)$$

(26)

$$w_j\left(t\right)=\frac{1}{Q}\sum _{k=1}^Q{w}_{jk}\left(t\right)$$

(27)

Furthermore, for each network selection performed in time t, if $D\left(t\right)=D\left(t_{prev}\right)$, then the ranks of the candidate networks obtained at time $t_{prev}$ are considered. Thus, the proposed algorithm achieves $O\left(n\right)$ complexity in this case. Otherwise, the methods defined by the DIFT-ACW algorithm are performed. In this case, the algorithm achieves $O\left(n^2\right)$ complexity, which is also introduced by the most MADM methods proposed in the literature.

Thereafter, the decision matrix is normalized. To accomplish this task, the algorithm considers that ${\mathsf{\Omega }}_b$ is the set of benefit attributes and ${\mathsf{\Omega }}_c$ is the set of cost attributes. Subsequently, Formula (28) is applied for the estimation of the elements of the normalized decision matrix for the case of benefit attributes where $b_j\left(t\right)={max}_i{x}_{ij}^U\left(t\right)$ for each $j\in {\mathsf{\Omega }}_b$. Correspondingly, Formula (29) is applied for the estimation of the elements of the normalized decision matrix for the case of cost attributes where $c_j\left(t\right)={min}_i{x}_{ij}^L\left(t\right)$ for each $j\in {\mathsf{\Omega }}_c$.

$$\begin{array}{c}\hfill r_{ij}\left(t\right)=\left\{\begin{array}{c}{r}_{ij}\left(t_{prev}\right),\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)=\mathrm{D}(t_{prev})\hfill \\ \\ [(\frac{x_{ij1}^U\left(t\right)}{b_j\left(t\right)},\frac{x_{ij2}^U\left(t\right)}{b_j\left(t\right)},\frac{x_{ij3}^U\left(t\right)}{b_j\left(t\right)},\frac{x_{ij4}^U\left(t\right)}{b_j\left(t\right)},\frac{x_{ij5}^U\left(t\right)}{b_j\left(t\right)},\frac{x_{ij6}^U\left(t\right)}{b_j\left(t\right)},\frac{x_{ij7}^U\left(t\right)}{b_j\left(t\right)},\frac{x_{ij8}^U\left(t\right)}{b_j\left(t\right)},\frac{x_{ij9}^U\left(t\right)}{b_j\left(t\right)},\frac{x_{ij10}^U\left(t\right)}{b_j\left(t\right)},\frac{x_{ij11}^U\left(t\right)}{b_j\left(t\right)},\frac{x_{ij12}^U\left(t\right)}{b_j\left(t\right)},\hfill \\ \frac{x_{ij13}^U\left(t\right)}{b_j\left(t\right)},\frac{x_{ij14}^U\left(t\right)}{b_j\left(t\right)},\frac{x_{ij15}^U\left(t\right)}{b_j\left(t\right)},\frac{x_{ij16}^U\left(t\right)}{b_j\left(t\right)},\frac{x_{ij17}^U\left(t\right)}{b_j\left(t\right)},\frac{x_{ij18}^U\left(t\right)}{b_j\left(t\right)},\frac{x_{ij19}^U\left(t\right)}{b_j\left(t\right)},\frac{x_{ij20}^U\left(t\right)}{b_j\left(t\right)},v_{ij}^U\left(t\right),v_{ij1}^U\left(t\right),v_{ij2}^U\left(t\right),v_{ij3}^U\left(t\right),\hfill \\ v_{ij4}^U\left(t\right),v_{ij5}^U\left(t\right),v_{ij6}^U\left(t\right),v_{ij7}^U\left(t\right),v_{ij8}^U\left(t\right)),(\frac{x_{ij1}^L\left(t\right)}{b_j\left(t\right)},\frac{x_{ij2}^L\left(t\right)}{b_j\left(t\right)},\frac{x_{ij3}^L\left(t\right)}{b_j\left(t\right)},\frac{x_{ij4}^L\left(t\right)}{b_j\left(t\right)},\frac{x_{ij5}^L\left(t\right)}{b_j\left(t\right)},\frac{x_{ij6}^L\left(t\right)}{b_j\left(t\right)},\frac{x_{ij7}^L\left(t\right)}{b_j\left(t\right)},\hfill \\ \frac{x_{ij8}^L\left(t\right)}{b_j\left(t\right)},\frac{x_{ij9}^L\left(t\right)}{b_j\left(t\right)},\frac{x_{ij10}^L\left(t\right)}{b_j\left(t\right)},\frac{x_{ij11}^L\left(t\right)}{b_j\left(t\right)},\frac{x_{ij12}^L\left(t\right)}{b_j\left(t\right)},\frac{x_{ij13}^L\left(t\right)}{b_j\left(t\right)},\frac{x_{ij14}^L\left(t\right)}{b_j\left(t\right)},\frac{x_{ij15}^L\left(t\right)}{b_j\left(t\right)},\frac{x_{ij16}^L\left(t\right)}{b_j\left(t\right)},\frac{x_{ij17}^L\left(t\right)}{b_j\left(t\right)},\frac{x_{ij18}^L\left(t\right)}{b_j\left(t\right)},\frac{x_{ij19}^L\left(t\right)}{b_j\left(t\right)},\hfill \\ \frac{x_{ij20}^L\left(t\right)}{b_j\left(t\right)},v_{ij}^L\left(t\right),v_{ij1}^L\left(t\right),v_{ij2}^L\left(t\right),v_{ij3}^L\left(t\right),v_{ij4}^L\left(t\right),v_{ij5}^L\left(t\right),v_{ij6}^L\left(t\right),v_{ij7}^L\left(t\right),v_{ij8}^L\left(t\right)\left)\right],\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)\ne \mathrm{D}(t_{prev})\hfill \end{array}\right.\end{array}$$

(28)

$$\begin{array}{c}\hfill r_{ij}\left(t\right)=\left\{\begin{array}{c}{r}_{ij}\left(t_{prev}\right),\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)=\mathrm{D}(t_{prev})\hfill \\ \\ [(\frac{c_j\left(t\right)}{x_{ij1}^U\left(t\right)},\frac{c_j\left(t\right)}{x_{ij2}^U\left(t\right)},\frac{c_j\left(t\right)}{x_{ij3}^U\left(t\right)},\frac{c_j\left(t\right)}{x_{ij4}^U\left(t\right)},\frac{c_j\left(t\right)}{x_{ij5}^U\left(t\right)},\frac{c_j\left(t\right)}{x_{ij6}^U\left(t\right)},\frac{c_j\left(t\right)}{x_{ij7}^U\left(t\right)},\frac{c_j\left(t\right)}{x_{ij8}^U\left(t\right)},\frac{c_j\left(t\right)}{x_{ij9}^U\left(t\right)},\frac{c_j\left(t\right)}{x_{ij10}^U\left(t\right)},\frac{c_j\left(t\right)}{x_{ij11}^U\left(t\right)},\frac{c_j\left(t\right)}{x_{ij12}^U\left(t\right)},\hfill \\ \frac{c_j\left(t\right)}{x_{ij13}^U\left(t\right)},\frac{c_j\left(t\right)}{x_{ij14}^U\left(t\right)},\frac{c_j\left(t\right)}{x_{ij15}^U\left(t\right)},\frac{c_j\left(t\right)}{x_{ij16}^U\left(t\right)},\frac{c_j\left(t\right)}{x_{ij17}^U\left(t\right)},\frac{c_j\left(t\right)}{x_{ij18}^U\left(t\right)},\frac{c_j\left(t\right)}{x_{ij19}^U\left(t\right)},\frac{c_j\left(t\right)}{x_{ij20}^U\left(t\right)},v_{ij}^U\left(t\right),v_{ij1}^U\left(t\right),v_{ij2}^U\left(t\right)v_{ij3}^U\left(t\right),\hfill \\ v_{ij4}^U\left(t\right),v_{ij5}^U\left(t\right),v_{ij6}^U\left(t\right),v_{ij7}^U\left(t\right),v_{ij8}^U\left(t\right)),(\frac{c_j\left(t\right)}{x_{ij1}^L\left(t\right)},\frac{c_j\left(t\right)}{x_{ij2}^L\left(t\right)},\frac{c_j\left(t\right)}{x_{ij3}^L\left(t\right)},\frac{c_j\left(t\right)}{x_{ij4}^L\left(t\right)},\frac{c_j\left(t\right)}{x_{ij5}^L\left(t\right)},\frac{c_j\left(t\right)}{x_{ij6}^L\left(t\right)},\frac{c_j\left(t\right)}{x_{ij7}^L\left(t\right)},\hfill \\ \frac{c_j\left(t\right)}{x_{ij8}^L\left(t\right)},\frac{c_j\left(t\right)}{x_{ij9}^L\left(t\right)},\frac{c_j\left(t\right)}{x_{ij10}^L\left(t\right)},\frac{c_j\left(t\right)}{x_{ij11}^L\left(t\right)},\frac{c_j\left(t\right)}{x_{ij12}^L\left(t\right)},\frac{c_j\left(t\right)}{x_{ij13}^L\left(t\right)},\frac{c_j\left(t\right)}{x_{ij14}^L\left(t\right)},\frac{c_j\left(t\right)}{x_{ij15}^L\left(t\right)},\frac{c_j\left(t\right)}{x_{ij16}^L\left(t\right)},\frac{c_j\left(t\right)}{x_{ij17}^L\left(t\right)},\frac{c_j\left(t\right)}{x_{ij18}^L\left(t\right)},\frac{c_j\left(t\right)}{x_{ij19}^L\left(t\right)},\hfill \\ \frac{c_j\left(t\right)}{x_{ij20}^L\left(t\right)},v_{ij}^L\left(t\right),v_{ij1}^L\left(t\right),v_{ij2}^L\left(t\right),v_{ij3}^L\left(t\right),v_{ij4}^L\left(t\right),v_{ij5}^L\left(t\right),v_{ij6}^L\left(t\right),v_{ij7}^L\left(t\right),v_{ij8}^L\left(t\right)\left)\right],\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)\ne \mathrm{D}(t_{prev})\hfill \end{array}\right.\end{array}$$

(29)

Subsequently, each element of the normalized decision matrix $r_{ij}\left(t\right)$ is multiplied with the respective weight $w_j\left(t\right)$ according to Formula (30) in order for the weighted normalized decision matrix to be created.

$$\begin{array}{c}\hfill u_{ij}\left(t\right)=\left\{\begin{array}{c}{u}_{ij}\left(t_{prev}\right),\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)=\mathrm{D}(t_{prev})\hfill \\ \\ [({}_{ij1}^U\left(t\right)·w_j\left(t\right),r_{ij2}^U\left(t\right)·w_j\left(t\right),r_{ij3}^U\left(t\right)·w_j\left(t\right),r_{ij4}^U\left(t\right)·w_j\left(t\right),r_{ij5}^U\left(t\right)·w_j\left(t\right),r_{ij6}^U\left(t\right)·w_j\left(t\right),\hfill \\ r_{ij7}^U\left(t\right)·w_j\left(t\right),r_{ij8}^U\left(t\right)·w_j\left(t\right),r_{ij9}^U\left(t\right)·w_j\left(t\right),r_{ij10}^U\left(t\right)·w_j\left(t\right),r_{ij11}^U\left(t\right)·w_j\left(t\right),r_{ij12}^U\left(t\right)·w_j\left(t\right),\hfill \\ r_{ij13}^U\left(t\right)·w_j\left(t\right),r_{ij14}^U\left(t\right)·w_j\left(t\right),r_{ij15}^U\left(t\right)·w_j\left(t\right),r_{ij16}^U\left(t\right)·w_j\left(t\right),r_{ij17}^U\left(t\right)·w_j\left(t\right),r_{ij18}^U\left(t\right)·w_j\left(t\right),\hfill \\ r_{ij19}^U\left(t\right)·w_j\left(t\right),r_{ij20}^U\left(t\right)·w_j\left(t\right),v_{ij}^U\left(t\right),v_{ij1}^U\left(t\right),v_{ij2}^U\left(t\right),v_{ij3}^U\left(t\right),v_{ij4}^U\left(t\right),v_{ij5}^U\left(t\right),v_{ij6}^U\left(t\right),v_{ij7}^U\left(t\right),\hfill \\ v_{ij8}^U\left(t\right)),(r_{ij1}^L\left(t\right)·w_j\left(t\right),r_{ij2}^L\left(t\right)·w_j\left(t\right),r_{ij3}^L\left(t\right)·w_j\left(t\right),r_{ij4}^L\left(t\right)·w_j\left(t\right),r_{ij5}^L\left(t\right)·w_j\left(t\right),r_{ij6}^L\left(t\right)·\hfill \\ w_j\left(t\right),r_{ij7}^L\left(t\right)·w_j\left(t\right),r_{ij8}^L\left(t\right)·w_j\left(t\right),r_{ij9}^L\left(t\right)·w_j\left(t\right),r_{ij10}^L\left(t\right)·w_j\left(t\right),r_{ij11}^L\left(t\right)·w_j\left(t\right),r_{ij12}^L\left(t\right)·\hfill \\ w_j\left(t\right),r_{ij13}^L\left(t\right)·w_j\left(t\right),r_{ij14}^L\left(t\right)·w_j\left(t\right),r_{ij15}^L\left(t\right)·w_j\left(t\right),r_{ij16}^L\left(t\right)·w_j\left(t\right),r_{ij17}^L\left(t\right)·w_j\left(t\right),r_{ij18}^L\left(t\right)·\hfill \\ w_j\left(t\right),r_{ij19}^L\left(t\right)·w_j\left(t\right),r_{ij20}^L\left(t\right)·w_j\left(t\right),v_{ij}^L\left(t\right),v_{ij1}^L\left(t\right),v_{ij2}^L\left(t\right),v_{ij3}^L\left(t\right),v_{ij4}^L\left(t\right),v_{ij5}^L\left(t\right),v_{ij6}^L\left(t\right),\hfill \\ v_{ij7}^L\left(t\right),v_{ij8}^L\left(t\right)\left)\right],\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)\ne \mathrm{D}(t_{prev})\hfill \end{array}\right.\end{array}$$

(30)

Then, the positive ideal solution is determined using Formula (31), where $\underset{i}{\bigwedge }\equiv {max}_i$ if $j\in {\mathsf{\Omega }}_b$ and $\underset{i}{\bigwedge }\equiv {min}_i$ if $j\in {\mathsf{\Omega }}_c$.

$$\begin{array}{c}\hfill X^{+}\left(t\right)=\left\{\begin{array}{c}{X}^{+}\left(t_{prev}\right),\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)=\mathrm{D}(t_{prev})\hfill \\ \\ [({}_{ij1}^{+U},x_{ij2}^{+U}\left(t\right),x_{ij3}^{+U}\left(t\right),x_{ij4}^{+U}\left(t\right),x_{ij5}^{+U}\left(t\right),x_{ij6}^{+U}\left(t\right),x_{ij7}^{+U}\left(t\right),x_{ij8}^{+U}\left(t\right),x_{ij9}^{+U}\left(t\right),x_{ij10}^{+U}\left(t\right),x_{ij11}^{+U}\left(t\right),x_{ij12}^{+U}\left(t\right),\hfill \\ x_{ij13}^{+U}\left(t\right),x_{ij14}^{+U}\left(t\right),x_{ij15}^{+U}\left(t\right),x_{ij16}^{+U}\left(t\right),x_{ij17}^{+U}\left(t\right),x_{ij18}^{+U}\left(t\right),x_{ij19}^{+U}\left(t\right),x_{ij20}^{+U}\left(t\right),v_{ij}^{+U}\left(t\right),v_{ij1}^{+U}\left(t\right),v_{ij2}^{+U}\left(t\right),v_{ij3}^{+U}\left(t\right),\hfill \\ v_{ij4}^{+U}\left(t\right),v_{ij5}^{+U}\left(t\right),v_{ij6}^{+U}\left(t\right),v_{ij7}^{+U}\left(t\right),v_{ij8}^{+U})\left(t\right),(x_{ij1}^{+L}\left(t\right),x_{ij2}^{+L}\left(t\right),x_{ij3}^{+L}\left(t\right),x_{ij4}^{+L}\left(t\right),x_{ij5}^{+L}\left(t\right),x_{ij6}^{+L}\left(t\right),x_{ij7}^{+L}\left(t\right),\hfill \\ x_{ij8}^{+L}\left(t\right),x_{ij9}^{+L}\left(t\right),x_{ij10}^{+L}\left(t\right),x_{ij11}^{+L}\left(t\right),x_{ij12}^{+L}\left(t\right),x_{ij13}^{+L}\left(t\right),x_{ij14}^{+L}\left(t\right),x_{ij15}^{+L}\left(t\right),x_{ij16}^{+L}\left(t\right),x_{ij17}^{+L}\left(t\right),x_{ij18}^{+L}\left(t\right),x_{ij19}^{+L}\left(t\right),\hfill \\ x_{ij20}^{+L}\left(t\right),v_{ij}^{+L}\left(t\right),v_{ij1}^{+L}\left(t\right),v_{ij2}^{+L}\left(t\right),v_{ij3}^{+L}\left(t\right),v_{ij4}^{+L}\left(t\right),v_{ij5}^{+L}\left(t\right),v_{ij6}^{+L}\left(t\right),v_{ij7}^{+L}\left(t\right),v_{ij8}^{+L}\left(t\right)\left)\right]=\hfill \\ \underset{i}{\bigwedge }{u}_{ij1}^U\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij2}^U\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij3}^U\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij4}^U\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij5}^U\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij6}^U\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij7}^U\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij8}^U\left(t\right),\hfill \\ \underset{i}{\overset{}{\bigwedge }}{u}_{ij9}^U\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij10}^U\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij11}^U\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij12}^U\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij13}^U\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij14}^U\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij15}^U\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij16}^U\left(t\right),\hfill \\ \underset{i}{\overset{}{\bigwedge }}{u}_{ij17}^U\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij18}^U\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij19}^U\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij20}^U\left(t\right),v_{ij}^U\left(t\right),v_{ij1}^U\left(t\right),v_{ij2}^U\left(t\right),v_{ij3}^U\left(t\right),v_{ij4}^U\left(t\right),v_{ij5}^U\left(t\right),\hfill \\ v_{ij6}^U\left(t\right),v_{ij7}^U\left(t\right),v_{ij8}^U)\left(t\right),(\underset{i}{\overset{}{\bigwedge }}{u}_{ij1}^L\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij2}^L\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij3}^L\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij4}^L\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij5}^L\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij6}^L\left(t\right),\hfill \\ \underset{i}{\overset{}{\bigwedge }}{u}_{ij7}^L\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij8}^L\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij9}^L\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij10}^L\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij11}^L\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij12}^L\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij13}^L\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij14}^L\left(t\right),\hfill \\ \underset{i}{\overset{}{\bigwedge }}{u}_{ij15}^L\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij16}^L\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij17}^L\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij18}^L\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij19}^L\left(t\right),\underset{i}{\overset{}{\bigwedge }}{u}_{ij20}^L\left(t\right),v_{ij}^L\left(t\right),v_{ij1}^L\left(t\right),v_{ij2}^L\left(t\right),\hfill \\ v_{ij3}^L\left(t\right),v_{ij4}^L\left(t\right),v_{ij5}^L\left(t\right),v_{ij6}^L\left(t\right),v_{ij7}^L\left(t\right),v_{ij8}^L\left(t\right)\left)\right],\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)\ne \mathrm{D}(t_{prev})\hfill \end{array}\right.\end{array}$$

(31)

Similarly, the negative ideal solutions is calculated using Formula (32), where ${\bigvee }_i^{}\equiv {min}_i$ if $j\in {\mathsf{\Omega }}_b$ and ${\bigvee }_i^{}\equiv {max}_i$ if $j\in {\mathsf{\Omega }}_c$.

$$\begin{array}{c}\hfill X^{-}\left(t\right)=\left\{\begin{array}{c}{X}^{-}\left(t_{prev}\right),\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)=\mathrm{D}(t_{prev})\hfill \\ \\ [({}_{ij1}^{-U}\left(t\right),x_{ij2}^{-U}\left(t\right),x_{ij3}^{-U}\left(t\right),x_{ij4}^{-U}\left(t\right),x_{ij5}^{-U}\left(t\right),x_{ij6}^{-U}\left(t\right),x_{ij7}^{-U}\left(t\right),x_{ij8}^{-U}\left(t\right),x_{ij9}^{-U}\left(t\right),x_{ij10}^{-U}\left(t\right),x_{ij11}^{-U}\left(t\right),x_{ij12}^{-U}\left(t\right),\hfill \\ x_{ij13}^{-U}\left(t\right),x_{ij14}^{-U}\left(t\right),x_{ij15}^{-U}\left(t\right),x_{ij16}^{-U}\left(t\right),x_{ij17}^{-U}\left(t\right),x_{ij18}^{-U}\left(t\right),x_{ij19}^{-U}\left(t\right),x_{ij20}^{-U}\left(t\right),v_{ij}^{-U}\left(t\right),v_{ij1}^{-U}\left(t\right),v_{ij2}^{-U}\left(t\right),v_{ij3}^{-U}\left(t\right),\hfill \\ v_{ij4}^{-U}\left(t\right),v_{ij5}^{-U}\left(t\right),v_{ij6}^{-U}\left(t\right),v_{ij7}^{-U}\left(t\right),v_{ij8}^{-U})\left(t\right),(x_{ij1}^{-L}\left(t\right),x_{ij2}^{-L}\left(t\right),x_{ij3}^{-L}\left(t\right),x_{ij4}^{-L}\left(t\right),x_{ij5}^{-L}\left(t\right),x_{ij6}^{-L}\left(t\right),x_{ij7}^{-L}\left(t\right),\hfill \\ x_{ij8}^{-L}\left(t\right),x_{ij9}^{-L}\left(t\right),x_{ij10}^{-L}\left(t\right),x_{ij11}^{-L}\left(t\right),x_{ij12}^{-L}\left(t\right),x_{ij13}^{-L}\left(t\right),x_{ij14}^{-L}\left(t\right),x_{ij15}^{-L}\left(t\right),x_{ij16}^{-L}\left(t\right),x_{ij17}^{-L}\left(t\right),x_{ij18}^{-L}\left(t\right),x_{ij19}^{-L}\left(t\right),\hfill \\ x_{ij20}^{-L}\left(t\right),v_{ij}^{-L}\left(t\right),v_{ij1}^{-L}\left(t\right),v_{ij2}^{-L}\left(t\right),v_{ij3}^{-L}\left(t\right),v_{ij4}^{-L}\left(t\right),v_{ij5}^{-L}\left(t\right),v_{ij6}^{-L}\left(t\right),v_{ij7}^{-L}\left(t\right),v_{ij8}^{-L}\left(t\right)\left)\right]=\hfill \\ \underset{i}{\overset{}{\bigvee }}{u}_{ij1}^U\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij2}^U\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij3}^U\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij4}^U\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij5}^U\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij6}^U\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij7}^U\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij8}^U\left(t\right),\hfill \\ \underset{i}{\overset{}{\bigvee }}{u}_{ij9}^U\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij10}^U\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij11}^U\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij12}^U\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij13}^U\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij14}^U\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij15}^U\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij16}^U\left(t\right),\hfill \\ \underset{i}{\overset{}{\bigvee }}{u}_{ij17}^U\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij18}^U\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij19}^U\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij20}^U\left(t\right),v_{ij}^U\left(t\right),v_{ij1}^U\left(t\right),v_{ij2}^U\left(t\right),v_{ij3}^U\left(t\right),v_{ij4}^U\left(t\right),v_{ij5}^U\left(t\right),\hfill \\ v_{ij6}^U\left(t\right),v_{ij7}^U\left(t\right),v_{ij8}^U)\left(t\right),(\underset{i}{\overset{}{\bigvee }}{u}_{ij1}^L\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij2}^L\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij3}^L\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij4}^L\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij5}^L\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij6}^L\left(t\right),\hfill \\ \underset{i}{\overset{}{\bigvee }}{u}_{ij7}^L\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij8}^L\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij9}^L\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij10}^L\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij11}^L\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij12}^L\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij13}^L\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij14}^L\left(t\right),\hfill \\ \underset{i}{\overset{}{\bigvee }}{u}_{ij15}^L\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij16}^L\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij17}^L\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij18}^L\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij19}^L\left(t\right),\underset{i}{\overset{}{\bigvee }}{u}_{ij20}^L\left(t\right),v_{ij}^L\left(t\right),v_{ij1}^L\left(t\right),v_{ij2}^L\left(t\right),\hfill \\ v_{ij3}^L\left(t\right),v_{ij4}^L\left(t\right),v_{ij5}^L\left(t\right),v_{ij6}^L\left(t\right),v_{ij7}^L\left(t\right),v_{ij8}^L\left(t\right)\left)\right],\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)\ne \mathrm{D}(t_{prev})\hfill \end{array}\right.\end{array}$$

(32)

Following this, Formulas (33) and (34) are applied in order for the distances of each candidate network from the positive ideal solution to be calculated. Similarly, (35) and (36) are applied in order for the distances of each candidate network from the negative ideal solution to be calculated.

$$\begin{array}{c}\hfill d_{i1}^{+}\left(t\right)=\left\{\begin{array}{c}{d}_{i1}^{+}\left(t_{prev}\right),\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)=\mathrm{D}(t_{prev})\hfill \\ \\ \sum _{j=1}^m\left\{\frac{1}{20}\right[{(u_{ij1}^U\left(t\right)-x_{ij1}^{+U}\left(t\right))}^2+{(u_{ij2}^U\left(t\right)-x_{ij2}^{+U}\left(t\right))}^2+{(u_{ij3}^U\left(t\right)-x_{ij3}^{+U}\left(t\right))}^2+{(u_{ij4}^U\left(t\right)-x_{ij4}^{+U}\left(t\right))}^2\hfill \\ +{(u_{ij5}^U\left(t\right)-x_{ij5}^{+U}\left(t\right))}^2+{(u_{ij6}^U\left(t\right)-x_{ij6}^{+U}\left(t\right))}^2+{(u_{ij7}^U\left(t\right)-x_{ij7}^{+U}\left(t\right))}^2+{(u_{ij8}^U\left(t\right)-x_{ij8}^{+U}\left(t\right))}^2\hfill \\ +{(u_{ij9}^U\left(t\right)-x_{ij9}^{+U}\left(t\right))}^2+{(u_{ij10}^U\left(t\right)-x_{ij10}^{+U}\left(t\right))}^2+{(u_{ij11}^U\left(t\right)-x_{ij11}^{+U}\left(t\right))}^2+{(u_{ij12}^U\left(t\right)-x_{ij12}^{+U}\left(t\right))}^2\hfill \\ +{(u_{ij13}^U\left(t\right)-x_{ij13}^{+U}\left(t\right))}^2+{(u_{ij14}^U\left(t\right)-x_{ij14}^{+U}\left(t\right))}^2+{(u_{ij15}^U\left(t\right)-x_{ij15}^{+U}\left(t\right))}^2+{(u_{ij16}^U\left(t\right)-x_{ij16}^{+U}\left(t\right))}^2\hfill \\ +{(u_{ij17}^U\left(t\right)-x_{ij17}^{+U}\left(t\right))}^2+{(u_{ij18}^U\left(t\right)-x_{ij18}^{+U}\left(t\right))}^2+{(u_{ij19}^U\left(t\right)-x_{ij19}^{+U}\left(t\right))}^2+{(u_{ij20}^U\left(t\right)-x_{ij20}^{+U}\left(t\right))}^2{\left]\right\}}^{\frac{1}{2}}\hfill \\ ,\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)\ne \mathrm{D}(t_{prev})\hfill \end{array}\right.\end{array}$$

(33)

$$\begin{array}{c}\hfill d_{i2}^{+}\left(t\right)=\left\{\begin{array}{c}{d}_{i2}^{+}\left(t_{prev}\right),\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)=\mathrm{D}(t_{prev})\hfill \\ \\ \sum _{j=1}^m\left\{\frac{1}{20}\right[{(u_{ij1}^L\left(t\right)-x_{ij1}^{+L}\left(t\right))}^2+{(u_{ij2}^L\left(t\right)-x_{ij2}^{+L}\left(t\right))}^2+{(u_{ij3}^L\left(t\right)-x_{ij3}^{+L}\left(t\right))}^2+{(u_{ij4}^L\left(t\right)-x_{ij4}^{+L}\left(t\right))}^2\hfill \\ +{(u_{ij5}^L\left(t\right)-x_{ij5}^{+L}\left(t\right))}^2+{(u_{ij6}^L\left(t\right)-x_{ij6}^{+L}\left(t\right))}^2+{(u_{ij7}^L\left(t\right)-x_{ij7}^{+L}\left(t\right))}^2+{(u_{ij8}^L\left(t\right)-x_{ij8}^{+L}\left(t\right))}^2\hfill \\ +{(u_{ij9}^L\left(t\right)-x_{ij9}^{+L}\left(t\right))}^2+{(u_{ij10}^L\left(t\right)-x_{ij10}^{+L}\left(t\right))}^2+{(u_{ij11}^L\left(t\right)-x_{ij11}^{+L}\left(t\right))}^2+{(u_{ij12}^L\left(t\right)-x_{ij12}^{+L}\left(t\right))}^2\hfill \\ +{(u_{ij13}^L\left(t\right)-x_{ij13}^{+L}\left(t\right))}^2+{(u_{ij14}^L\left(t\right)-x_{ij14}^{+L}\left(t\right))}^2+{(u_{ij15}^L\left(t\right)-x_{ij15}^{+L}\left(t\right))}^2+{(u_{ij16}^L\left(t\right)-x_{ij16}^{+L}\left(t\right))}^2\hfill \\ +{(u_{ij17}^L\left(t\right)-x_{ij17}^{+L}\left(t\right))}^2+{(u_{ij18}^L\left(t\right)-x_{ij18}^{+L}\left(t\right))}^2+{(u_{ij19}^L\left(t\right)-x_{ij19}^{+L}\left(t\right))}^2+{(u_{ij20}^L\left(t\right)-x_{ij20}^{+L}\left(t\right))}^2{\left]\right\}}^{\frac{1}{2}}\hfill \\ ,\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)\ne \mathrm{D}(t_{prev})\hfill \end{array}\right.\end{array}$$

(34)

$$\begin{array}{c}\hfill d_{i1}^{-}\left(t\right)=\left\{\begin{array}{c}{d}_{i1}^{-}\left(t_{prev}\right),\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)=\mathrm{D}(t_{prev})\hfill \\ \\ \sum _{j=1}^m\left\{\frac{1}{20}\right[{(u_{ij1}^U\left(t\right)-x_{ij1}^{-U}\left(t\right))}^2+{(u_{ij2}^U\left(t\right)-x_{ij2}^{-U}\left(t\right))}^2+{(u_{ij3}^U\left(t\right)-x_{ij3}^{-U}\left(t\right))}^2+{(u_{ij4}^U\left(t\right)-x_{ij4}^{-U}\left(t\right))}^2\hfill \\ +{(u_{ij5}^U\left(t\right)-x_{ij5}^{-U}\left(t\right))}^2+{(u_{ij6}^U\left(t\right)-x_{ij6}^{-U}\left(t\right))}^2+{(u_{ij7}^U\left(t\right)-x_{ij7}^{-U}\left(t\right))}^2+{(u_{ij8}^U\left(t\right)-x_{ij8}^{-U}\left(t\right))}^2\hfill \\ +{(u_{ij9}^U\left(t\right)-x_{ij9}^{-U}\left(t\right))}^2+{(u_{ij10}^U\left(t\right)-x_{ij10}^{-U}\left(t\right))}^2+{(u_{ij11}^U\left(t\right)-x_{ij11}^{-U}\left(t\right))}^2+{(u_{ij12}^U\left(t\right)-x_{ij12}^{-U}\left(t\right))}^2\hfill \\ +{(u_{ij13}^U\left(t\right)-x_{ij13}^{-U}\left(t\right))}^2+{(u_{ij14}^U\left(t\right)-x_{ij14}^{-U}\left(t\right))}^2+{(u_{ij15}^U\left(t\right)-x_{ij15}^{-U}\left(t\right))}^2+{(u_{ij16}^U\left(t\right)-x_{ij16}^{-U}\left(t\right))}^2\hfill \\ +{(u_{ij17}^U\left(t\right)-x_{ij17}^{-U}\left(t\right))}^2+{(u_{ij18}^U\left(t\right)-x_{ij18}^{-U}\left(t\right))}^2+{(u_{ij19}^U\left(t\right)-x_{ij19}^{-U}\left(t\right))}^2+{(u_{ij20}^U\left(t\right)-x_{ij20}^{-U}\left(t\right))}^2{\left]\right\}}^{\frac{1}{2}}\hfill \\ ,\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)\ne \mathrm{D}(t_{prev})\hfill \end{array}\right.\end{array}$$

(35)

$$\begin{array}{c}\hfill d_{i2}^{-}\left(t\right)=\left\{\begin{array}{c}{d}_{i2}^{-}\left(t_{prev}\right),\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)=\mathrm{D}(t_{prev})\hfill \\ \\ \sum _{j=1}^m\left\{\frac{1}{20}\right[{(u_{ij1}^L\left(t\right)-x_{ij1}^{-L}\left(t\right))}^2+{(u_{ij2}^L\left(t\right)-x_{ij2}^{-L}\left(t\right))}^2+{(u_{ij3}^L\left(t\right)-x_{ij3}^{-L}\left(t\right))}^2+{(u_{ij4}^L\left(t\right)-x_{ij4}^{-L}\left(t\right))}^2\hfill \\ +{(u_{ij5}^L\left(t\right)-x_{ij5}^{-L}\left(t\right))}^2+{(u_{ij6}^L\left(t\right)-x_{ij6}^{-L}\left(t\right))}^2+{(u_{ij7}^L\left(t\right)-x_{ij7}^{-L}\left(t\right))}^2+{(u_{ij8}^L\left(t\right)-x_{ij8}^{-L}\left(t\right))}^2\hfill \\ +{(u_{ij9}^L\left(t\right)-x_{ij9}^{-L}\left(t\right))}^2+{(u_{ij10}^L\left(t\right)-x_{ij10}^{-L}\left(t\right))}^2+{(u_{ij11}^L\left(t\right)-x_{ij11}^{-L}\left(t\right))}^2+{(u_{ij12}^L\left(t\right)-x_{ij12}^{-L}\left(t\right))}^2\hfill \\ +{(u_{ij13}^L\left(t\right)-x_{ij13}^{-L}\left(t\right))}^2+{(u_{ij14}^L\left(t\right)-x_{ij14}^{-L}\left(t\right))}^2+{(u_{ij15}^L\left(t\right)-x_{ij15}^{-L}\left(t\right))}^2+{(u_{ij16}^L\left(t\right)-x_{ij16}^{-L}\left(t\right))}^2\hfill \\ +{(u_{ij17}^L\left(t\right)-x_{ij17}^{-L}\left(t\right))}^2+{(u_{ij18}^L\left(t\right)-x_{ij18}^{-L}\left(t\right))}^2+{(u_{ij19}^L\left(t\right)-x_{ij19}^{-L}\left(t\right))}^2+{(u_{ij20}^L\left(t\right)-x_{ij20}^{-L}\left(t\right))}^2{\left]\right\}}^{\frac{1}{2}}\hfill \\ ,\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)\ne \mathrm{D}(t_{prev})\hfill \end{array}\right.\end{array}$$

(36)

Thereafter, in a way similar to [37], the distances of the candidate networks from the positive and negative ideal solutions are expressed using intervals such as $[d_{i1}^{+},d_{i2}^{+}]$ and $[d_{i1}^{-},d_{i2}^{-}]$. Finally, the relative closeness of the distances from the ideal solutions are computed using Formulas (37) and (38).

$$R{C}_{i1}\left(t\right)=\left\{\begin{array}{c}R{C}_{i1}\left(t_{prev}\right),\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)=\mathrm{D}(t_{prev})\hfill \\ \\ \frac{d_{i1}^{-}\left(t\right)}{d_{i1}^{+}\left(t\right)+d_{i1}^{-}\left(t\right)},\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)\ne \mathrm{D}(t_{prev})\hfill \end{array}\right.$$

(37)

and:

$$R{C}_{i2}\left(t\right)=\left\{\begin{array}{c}R{C}_{i2}\left(t_{prev}\right),\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)=\mathrm{D}(t_{prev})\hfill \\ \\ \frac{d_{i2}^{-}\left(t\right)}{d_{i2}^{+}\left(t\right)+d_{i2}^{-}\left(t\right)},\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)\ne \mathrm{D}(t_{prev})\hfill \end{array}\right.$$

(38)

The compound relative closeness is obtained by calculating the average of the $R{C}_{i1}\left(t\right)$ and $R{C}_{i2}\left(t\right)$ values using Formula (39).

$$R{C}_i\left(t\right)=\left\{\begin{array}{c}R{C}_i\left(t_{prev}\right),\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)=\mathrm{D}(t_{prev})\hfill \\ \\ \frac{R{C}_{i1}^{}\left(t\right)+R{C}_{i2}^{}\left(t\right)}{2},\mathrm{if}\mathrm{D}\left(\mathrm{t}\right)\ne \mathrm{D}(t_{prev})\hfill \end{array}\right.$$

(39)

The candidate networks are ranked by taking into consideration their $R{C}_i$ values, and the one with the higher $R{C}_i$ value is considered as the best alternative.

4. The Proposed Mobility Management Scheme

During vehicles’ movement, the velocity and network monitoring process is executed, enabling the effective transmission of each vehicle to the target access network in the case of an HO event. The HO process includes the HO initiation, the network selection, and the HO execution procedures, while both predictive and reactive HO operations are supported. In the case of predictive HO, HO initiation, network selection, and HO execution are performed, while in the case of reactive HO, the HO initiation is not performed since the link between the vehicle and its previous serving network goes down unexpectedly without an indication of a potential connection loss. Figure 3 presents the workflow of the proposed methodology. The design of the discussed scheme was optimized to be applied in 5G network architectures where both Fog and Cloud infrastructures are available, while the implemented signaling combines messages of both the IEEE 802.21 Media Independent Handover (MIH) [42] and the IETF Proxy Mobile IPv6 (PMIPv6) [43] standards. Furthermore, it should be noted that the proposed scheme can be used for the mobility management of both pedestrian and vehicular users. More specifically, handling the mobility issues in dynamic vehicular environments is of paramount importance, since the vehicles may move with increased velocities and provide heterogeneous services to multiple onboard users. Thus, this paper proposes and evaluates an HO scheme that can be adopted in a challenging vehicular network.

4.1. Velocity and Alternative Network Monitoring

The Cloud/Fog infrastructure continuously monitors the velocity of each vehicle by applying the methodology described in [23]. Specifically, an improved version of the Mobility State Estimation (MSE) technique defined in 3GPP LTE Release 11 [22] was applied. This methodology categorizes the moving velocity of the vehicle as Normal, Medium, or High, by taking into consideration the number of HOs $N_{C{R}_u}$ that the vehicle has performed during a sliding time window $T_{CRmax}$.

Additionally, each vehicle maintains a set $A=\{A_1,A_2,\cdots ,A_n\}$ of candidate networks based on the SINR perceived from each one of them as specified by the Cloud/Fog environment. The set A is continuously updated, since the SINR of each network is constantly changing as the vehicle moves inside the wireless network access environment. Thereafter, in the case of predictive HO, the HO initiation will be performed, while in the case of reactive HO, the network selection is immediately executed.

4.2. HO Initiation

HO initiation is performed only in the case of predictive HO. During the HO initiation, the methodology described in [23] is applied. Specifically, the $S_{u,i}$ indicator is defined, determining the satisfaction grade of user u from his/her current network i. The value of the $S_{u,i}$ indicator is calculated using the MIFIS algorithm where the normalized values of the SINR and the QoS the vehicle perceives from its current network are used as the inputs. In this work, the MIFIS was implemented using the IVIFNs presented in Figure 4, Figure 5 and Figure 6.

During the instantiation of the system, the Satisfaction Indicators Chart (SIC) presented in Figure 7 is created at the Fog by applying the knowledge base described in [44]. The SIC chart presents the $S_{u,i}$ values obtained for each possible SINR and QoS combination. When either the SINR or the QoS drops below a predefined threshold, the vehicle sends the obtained values to the MAG of its current network using an $MIH\_Link\_Going\_down$ [45] message. Subsequently, the Fog infrastructure where the current MAG belongs uses the SIC chart, in order for the $S_{u,i}$ satisfaction grade of the user to be determined. Subsequently, the network selection process will be performed if the estimated satisfaction grade is less than a predefined $S_{th}$ threshold value.

4.3. Network Selection

During the network selection (Figure 8), the vehicle sends a $1.MIH\_Get\_Information\_-Request$ to the MIIS. This message embeds information about the services and the remaining energy of the vehicle. In the case of predictive HO, the message is transmitted by the current network of the vehicle. However, in the case of reactive HO, the vehicle chooses the network alternative with the higher SINR to transmit the message, since the connection with the current network has been lost. Subsequently, the velocity and network monitoring process considers the mobility state of each vehicle to create a subset $A^{\prime }\subset A$ of the available networks. Specifically, if the vehicle’s velocity has been characterized as Normal, then all the available networks are considered as alternatives, including both Macrocells and Femtocells in the $A^{\prime }$ subset. On the other hand, if the vehicle’s velocity has been characterized as Medium, then some Femtocells are skipped along the vehicle’s trajectory and are not included in $A^{\prime }$. In particular, the Femtocell i is considered as an alternative if the estimated residence time of the vehicle u ($t_{u,i}^{residence}$) is greater than or equal to the average residence time of the vehicle considering all the available Femtocells in its current location. It has to be noted that the $t_{u,i}^{residence}$ parameter of vehicle u for the ith cell is estimated using Formula (40) [46], where $r_f$ is the cell radius and $v_u$ is the vehicle velocity obtained by Formula (41) [47]. The ${\lambda }_u$ parameter represents the cell’s density in the location of the vehicle, as it is obtained by the Software-Defined Networking (SDN) controller. Finally, if vehicle’s velocity has been characterized as High, then only the available Macrocells are included in the $A^{\prime }$ as alternatives.

$$t_{u,i}^{residence}=\frac{\pi ·r_i}{2·v_u}$$

(40)

$$v_u=\frac{\pi ·N_{C{R}_u}}{4·T_{CRmax}·\sqrt{{\lambda }_u}}$$

(41)

Following this, the availability of the resources offered from each network of the subset $A^{\prime }$ is considered, so that a subset $A^{″}\subset A^{\prime }$ is created. Specifically, the MIIS checks the availability of the resources offered from each network alternative by exchanging $2.MIH\_N2N\_HO\_Query\_Resource\_Request$ and $3.MIH\_N2N\_HO\_Query\_Resource\_Re-sponse$ messages. Thereafter, networks included in the subset A” are ranked using the DIFT-ACW algorithm. The ranking is performed considering both network characteristics (throughput, latency, jitter, packet loss, and energy consumption) and the operator’s policy criteria (service reliability, security, and monetary cost) that each network offers for the services of the vehicle. Since the energy consumption parameter is considered during the ranking process, energy-intensive networks such as LTE-A Pro FD-MIMO, which operates with multiple antennas, obtain a low score for vehicles with low remaining energy of the user equipment. Furthermore, since the decision is made considering the vehicle’s velocity, as well as QoS and policy-related parameters, the ping-pong HO effect is eliminated. Following this, the network that obtains the higher score is selected, while the vehicle is informed about the target access network through a $4.MIH\_Get\_Information\_Response$ message.

4.4. HO Execution

An improved scheme for the HO execution is proposed based on the FPMIPv6 protocol. Furthermore, if the selected and the current network belong to different MAGs, inter-MAG HO execution is performed. On the contrary, if the two networks belong to the same MAG, intra-MAG HO execution is performed.

4.4.1. Proposed Predictive HO Scheme

In the case of predictive inter-MAG HO execution (Figure 9), the current network initially sends a $1.MIH\_N2N\_HO\_Commit\_request$ to the selected MAG to reserve the necessary resources for the upcoming handover. Following this, the selected MAG responds with a $2.MIH\_N2N\_HO\_Commit\_response$ message indicating that the required resources have been reserved. In this case, the current MAG informs the vehicle about the successful resource allocation at the selected network using a $3.MIH\_Net\_HO\_Commit\_request$ message, while the vehicle acknowledges the reception of the information using a $4.MIH\_Net\_-HO\_Commit\_response$ message.

Subsequently, the MAG of the current network sends a $5.Handover\_Initiate$ message to the MAG of the selected one, which includes the MN Identifier (MN-ID), the Home Network Prefix (HNP), and the MN Logical Link Identifier (MN-LLID). Furthermore, the Proxy (P) and the Buffering (B) flags of the message are set equal to 1 to inform the selected MAG that the buffering of data has been performed at the current MAG. By receiving this message, the MAG of the selected network replies with a $6.Handover\_Ack$ message, which acknowledges that the aforementioned information has been successfully received, while a bi-directional tunnel is established between the two MAGs. Thereafter, a copy of the buffered packets from the current MAG is transmitted through the tunnel to the selected MAG to be delivered to the vehicle when it connects to the selected network. Subsequently, the new MAG sends a $7.PBU$ message to the LMA to create a transient record in the binding cache. Once the temporal binding is established at the LMA, it sends a $8.PBA$ message to the MAG of the selected network, and a bi-directional tunnel is established between the two entities. Thus, downlink packets are forwarded from the LMA to the MAG of the selected network where they are buffered to be delivered to the vehicle when it completes its HO to the selected network. Furthermore, the bi-directional tunnel between the current MAG and the LMA remains active until the transient binding becomes permanent. Then, the transient binding introduces a smooth way for performing the handover by gradually changing the current MAG to avoid packet losses and false HOs.

Subsequently, the vehicle sends a $9.MIH\_Link\_up$ message to the selected MAG to enable the communication channel. Furthermore, the vehicle sends a $10.UNA$ message to the selected network, to complete the establishment of both the Link and Network layers. Thereafter, the MAG of the selected network exchanges the $11.PBU$ and $12.PBA$ messages with the LMA to finalize the binding. Finally, the selected network sends a $13.MIH\_N2N\_Complete\_request$ message to the previous network. By receiving this message, the previous network releases the resources that have been reserved for the vehicle and sends back a $14.MIH\_N2N\_Complete\_response$ message to finalize the HO execution.

Similar to the predictive inter-MAG HO execution, in the case of the predictive intra-MAG HO execution (Figure 10), the current network sends a $1.MIH\_N2N\_HO\_Commit\_request$ to the selected network to reserve the necessary resources for the upcoming handover. Following this, the selected network responds with a $2.MIH\_N2N\_HO\_Commit\_response$ message indicating that the required resources have been reserved. In this case, the current network informs the vehicle about the successful resource allocation at the selected network using a $3.MIH\_Net\_HO\_Commit\_request$ message, while the vehicle acknowledges the reception of the information using a $4.MIH\_Net\_HO\_Commit\_response$ message. Subsequently, the vehicle sends a $5.MIH\_Link\_up$ message to the selected network to enable the communication channel. Furthermore, the vehicle sends a $6.UNA$ message to the selected network, to complete the establishment of both the Link and Network layers. Finally, the selected network replies back with a $7.MIH\_N2N\_Complete\_request$ to the current one. By receiving this message, the MAG releases the resources that have been reserved for the current network and replies back with a $8.MIH\_N2N\_Complete\_response$ message to successfully finish the HO execution.

It has to be noted that in the case of predictive intra-MAG HO execution (Figure 10), since the involved networks are served by the same MAG, the use of $5.Handover\_Initiate$ and $6.Handover\_Ack$ messages is not necessary [48], as the MN-ID, the MN-LLID, and the Local Mobility Anchor Address (LMAA) are already known by their common MAG. Furthermore, the MAG does not exchange $7.PBU$ and $8.PBA$ messages with the LMA since it retains a Proxy Binding Update List (PBUL). Specifically, the MAG’s PB-UL stores information about the vehicle including the MN-ID, the Mobile Network Prefix (MNP), and the vehicle’s current network. Thus, when the vehicle performs an intra-MAG handover, the MNP is obtained from the PBUL. Furthermore, due to the common serving MAG, false handovers do not cause any malfunction.

4.4.2. Proposed Reactive HO Scheme

In the case of reactive inter-MAG HO execution (Figure 11), the vehicle sends a $1.MIH\_Li-nk\_up\_React$ to the selected network, which includes information about the MN-ID and the MN-LLID and enables the communication channel. Subsequently, the vehicle sends a $2.UNA$ message to the selected network, to complete the establishment of both the Link and Network layers, as well as a $3.MIH\_N2N\_HO\_Commit\_request$ message to reserve the required resources. By receiving this message, the selected network reserves the required resources and sends back a $4.MIH\_N2N\_HO\_Commit\_response$ to the vehicle.

Thereafter, the MAG of the selected network identifies that the vehicle was not previously connected to any of the networks that it manipulates. Thus, the selected network sends a $5.Handover\_Initiate$ message to the previous one through the LMA. In this message, the Proxy (P) and the Buffering (B) flags of the message are set equal to 1. By receiving this message, the previous network responds with a $6.Handover\_Ack$ message, and a bi-directional tunnel is established between the two networks. Thereafter, the buffered packets from the previous network are transmitted through the tunnel to the selected network to be delivered to the vehicle when its HO completes. Furthermore, the MAG of the selected network exchanges the $7.PBU$ and $8.PBA$ messages with the LMA to update the Binding Cache Entry (BCE) of the LMA. Consequently, the vehicle becomes ready to transmit or receive packets through the selected network.

For the intra-MAG reactive VHO execution (Figure 12), the messages after the $4.MIH\_-N2N\_HO\_Commit\_response$ of the above case are not exchanged between the vehicle and the selected network. Specifically, in this case, the MAG of the selected network identifies that the vehicle was previously connected to a network that it manipulates. Thus, the exchange of signaling messages between the MAG and the LMA is not required, and the vehicle is ready to transmit or receive packets through the selected network.

Finally, it has to be noted that after the successful execution of each of the above HO schemes, the number of handovers for the vehicle $N_{C{R}_u}$ is increased for the estimation of the vehicle’s velocity.

4.5. The Computational Complexity of the Proposed Scheme

As far as the computational complexity of the proposed methodology is concerned, the worst-case scenario is observed during the network selection process. In particular, during the first run of the DIFT-ACW algorithm, an $O\left(n^2\right)$ complexity is introduced due to the weighting and the normalization of the two-dimensional decision matrices. Nevertheless, a constant time duration is required for the algorithm execution provided that $D\left(t\right)=D\left(t_{prev}\right)$. In this case, the algorithm checks only the recent results obtained during the time period $t_{prev}$, and an $O\left(n\right)$ complexity is observed.

5. Simulation Setup and Results

In our simulation, the software-defined vehicular cloud topology presented in Figure 13 was evaluated. A mobility trace designating the map of the city of Athens along with transportation data was generated using the Open Street Map (OSM) software. Afterwards, the mobility trace was used as the input in the Simulator of Urban Mobility (SUMO), establishing a realistic mobility pattern including 77,797 vehicles driving inside Athens within a 24 h period of time. The network topology, as well as a Cloud/Fog infrastructure were created on the map using Network Simulator 3 (NS3) [49].

The Fog infrastructure consists of 28 802.11p WAVE RSUs, 5 LTE-A Pro FD-MIMO Macrocell e-Node Bs (eNBs), 8 LTE-A Macrocell eNBs, 70 LTE-A Femtocells eNBs, 8 WiMAX Macrocell Base Stations (BSs), and 41 WiMAX Femtocell BSs, equipped with additional computational and storage resources. Furthermore, the access networks are located in geographical positions based on the data available from the Hellenic Telecommunications and Post Commission (EETT) [50]. The positions and the spectrum of the base stations are presented in

Table A2. The positions and the frequencies of the simulated LTE-A Pro FD-MIMO networks.

Network	Position	Geographic Latitude	Geographic Longitude	Number of Antennas	MAG
LTE-A Pro FD-MIMO Macrocell 1	b23	37.987778	23.731667	64	1
LTE-A Pro FD-MIMO Macrocell 2	f3	37.986389	23.721111	64	3
LTE-A Pro FD-MIMO Macrocell 3	k16	37.983889	23.728056	64	6
LTE-A Pro FD-MIMO Macrocell 4	n33	37.982222	23.736111	64	7
LTE-A Pro FD-MIMO Macrocell 5	u11	37.978889	23.725278	64	11
Spectrum in MHz for each Antenna
Antenna Identifier	Downlink and Uplink Spectrum in MHz (LTE Band)
1	462.5–467.5 and 452.5–457.5 (31)
2	734–739 and 704–709 (17)
3	739–744 and 709–714 (17)
4	758–763 and 714–719 (28)
5	763–768 and 719–724 (28)
6	768–773 and 724–729 (28)
7	773–778 and 729–734 (28)
8	860–865 and 815–820 (18)
9	865–870 and 820–825 (18)
10	870–875 and 825–830 (18)
11	875–880 and 830–835 (19)
12	880–885 and 835–840 (19)
13	885–890 and 840–845 (19)
14	925–930 and 890–895 (8)
15	930–935 and 895–900 (8)
16	935–940 and 900–905 (8)
17	940–945 and 905–910 (8)
18	945–950 and 910–915 (8)
19	1475.9–1480.9 and 1427.9–1432.9 (11)
20	1480.9–1485.9 and 1432.9–1437.9 (11)
21	1485.9–1490.9 and 1437.9–1442.9 (11)
22	1490.9–1495.9 and 1442.9–1447.9 (11)
23	1495.9–1500.9 and 1447.9–1452.9 (11)
24	1525–1530 and 1625.5–1630.5 (24)
25	1530–1535 and 1630.5–1635.5 (24)
26	1535–1540 and 1635.5–1640.5 (24)
27	1540–1545 and 1640.5–1645.5 (24)
28	1545–1550 and 1645.5–1650.5 (24)
29	1550–1555 and 1650.5–1655.5 (24)
30	1805–1810 and 1710–1715 (3)
31	1810–1815 and 1715–1720 (3)
32	1815–1820 and 1720–1725 (3)
33	1820–1825 and 1725–1730 (3)
34	1825–1830 and 1730–1735 (3)
35	1830–1835 and 1735–1740 (3)
36	1835–1840 and 1740–1745 (3)
37	1840–1845 and 1745–1750 (3)
38	1845–1850 and 1750–1755 (3)
39	1850–1855 and 1755–1760 (3)
40	1855–1860 and 1760–1765 (3)
41	1860–1865 and 1765–1770 (3)
42	1865–1870 and 1770–1775 (3)
43	1870–1875 and 1775–1780 (3)
44	1875–1880 and 1780–1785 (3)
45	1930–1935 and 1880–1885 (2)
46	1935–1940 and 1885–1890 (2)
47	1940–1945 and 1890–1895 (2)
48	1945–1950 and 1895–1900 (2)
49	1950–1955 and 1900–1905 (2)
50	1955–1960 and 1905–1910 (2)
51	2600–2605 and 1910–1915 (15)
52	2605–2610 and 1915–1920 (15)
53	2110–2115 and 1960–1965 (1)
54	2115–2120 and 1965–1970 (1)
55	2120–2125 and 1970–1975 (1)
56	2125–2130 and 1975–1980 (1)
57	2180–2185 and 2000–2005 (23)
58	2185–2190 and 2005–2010 (23)
59	2190–2195 and 2010–2015 (23)
60	2195–2200 and 2015–2020 (23)
61	2595–2600 and 2020–2025 (16)
62	2350–2355 and 2305–2310 (30)
63	2355–2360 and 2310–2315 (30)
64	2620–2625 and 2500–2505 (7)

,

Table A3. The positions and the frequencies of the simulated LTE-A networks.

Network	Position	Geographic Latitude	Geographic Longitude	Downlink and Uplink Spectrum in MHz (LTE Band)	MAG
LTE Macrocell 1	e14	37.986389	23.726667	3515–3520 and 3415–3420 (22)	3
LTE Macrocell 2	i5	37.985	23.722222	2675–2690 and 2565–2570 (7)	5
LTE Macrocell 3	k26	37.983611	23.733056	3510–3515 and 3410–3415 (22)	6
LTE Macrocell 4	m21	37.982778	23.730278	3520–3525 and 3420–3425 (22)	7
LTE Macrocell 5	p9	37.981667	23.724167	3525–3530 and 3425–3430 (22)	8
LTE Macrocell 6	r2	37.980833	23.720556	3510–3515 and 3410–3415 (22)	9
LTE Macrocell 7	r25	37.980556	23.732222	2675–2690 and 2565–2570 (7)	9
LTE Macrocell 8	s17	37.979722	23.728333	3515–3520 and 3415–3420 (22)	10
LTE Femtocell 1	c13	37.987222	23.726389	3530–3535 and 3430–3435 (22)	2
LTE Femtocell 2	c19	37.987222	23.729444	3525–3530 and 3425–3430 (22)	2
LTE Femtocell 3	d11	37.986944	23.725	3520–3525 and 3420–3425 (22)	2
LTE Femtocell 4	d29	37.986944	23.734444	3525–3530 and 3425–3430 (22)	2
LTE Femtocell 5	e1	37.986667	23.720556	3520–3525 and 3420–3425 (22)	3
LTE Femtocell 6	f16	37.986389	23.728056	3535–3540 and 3435–3440 (22)	3
LTE Femtocell 7	g9	37.985833	23.724167	3530–3535 and 3430–3435 (22)	4
LTE Femtocell 8	g13	37.985833	23.726389	3540–3545 and 3440–3445 (22)	4
LTE Femtocell 9	g18	37.985833	23.728889	3545–3550 and 3445–3450 (22)	4
LTE Femtocell 10	g19	37.985556	23.729722	3550–3555 and 3450–3455 (22)	4
LTE Femtocell 11	g24	37.985833	23.731944	3540–3545 and 3440–3445 (22)	4
LTE Femtocell 12	h1	37.985278	23.720278	3545–3550 and 3445–3450 (22)	4
LTE Femtocell 13	h12	37.985	23.725833	3555–3560 and 3455–3460 (22)	4
LTE Femtocell 14	h17	37.985278	23.728333	3560–3565 and 3460–3465 (22)	4
LTE Femtocell 15	i18	37.985	23.728611	3540–3545 and 3440–3445 (22)	5
LTE Femtocell 16	i23	37.984722	23.731389	3555–3560 and 3455–3460 (22)	5
LTE Femtocell 17	i24	37.985	23.731667	3535–3540 and 3435–3440 (22)	5
LTE Femtocell 18	j8	37.984722	23.723889	3530–3535 and 3430–3435 (22)	5
LTE Femtocell 19	j9	37.984444	23.724444	3535–3540 and 3435–3440 (22)	5
LTE Femtocell 20	j12	37.984444	23.725556	3545–3550 and 3445–3450 (22)	5
LTE Femtocell 21	j16	37.984167	23.727778	3570–3575 and 3470–3475 (22)	5
LTE Femtocell 22	j27	37.984444	23.733611	3550–3555 and 3450–3455 (22)	5
LTE Femtocell 23	k8	37.983889	23.723611	3550–3555 and 3450–3455 (22)	6
LTE Femtocell 24	k14	37.984167	23.726944	3565–3570 and 3465–3470 (22)	6
LTE Femtocell 25	k16	37.983611	23.728056	3575–3580 and 3475–3480 (22)	6
LTE Femtocell 26	k17	37.983889	23.728611	3585–3590 and 3485–3490 (22)	6
LTE Femtocell 27	k22	37.984167	23.731111	3580–3585 and 3480–3485 (22)	6
LTE Femtocell 28	k23	37.983889	23.731667	3565–3570 and 3465–3470 (22)	6
LTE Femtocell 29	k29	37.983611	23.734444	3525–3530 and 3425–3430 (22)	6
LTE Femtocell 30	l10	37.983056	23.724722	3560–3565 and 3460–3465 (22)	6
LTE Femtocell 31	l15	37.983333	237.275	3550–3555 and 3450–3455 (22)	6
LTE Femtocell 32	l16	37.983056	23.727778	3540–3545 and 3440–3445 (22)	6
LTE Femtocell 33	l22	37.983611	23.730833	3545–3550 and 3445–3450 (22)	6
LTE Femtocell 34	l23	37.983333	23.731111	3560–3565 and 3460–3465 (22)	6
LTE Femtocell 35	l25	37.983333	23.732222	3575–3580 and 3475–3480 (22)	6
LTE Femtocell 36	l32	37.983056	23.736111	3530–3535 and 3430–3435 (22)	6
LTE Femtocell 37	l33	37.983333	23.736389	3570–3575 and 3470–3475 (22)	6
LTE Femtocell 38	m11	37.982778	23.725278	3555–3560 and 3455–3460 (22)	7
LTE Femtocell 39	m16	37.982778	23.728056	3580–3585 and 3480–3485 (22)	7
LTE Femtocell 40	m18	37.982778	23.728611	3535–3540 and 3435–3440 (22)	7
LTE Femtocell 41	m19	37.982778	23.729722	3590–3595 and 3490–3495 (22)	7
LTE Femtocell 42	m26	37.982778	23.732778	3585–3590 and 3485–3490 (22)	7
LTE Femtocell 43	m28	37.983056	23.733889	3540–3545 and 3440–3445 (22)	7
LTE Femtocell 44	n12	37.982222	23.725833	3595–3600 and 3495–3500 (22)	7
LTE Femtocell 45	n23	37.982222	23.731389	3530–3535 and 3430–3435 (22)	7
LTE Femtocell 46	n28	379.825	23.733889	3555–3560 and 3455–3460 (22)	7
LTE Femtocell 47	n31	379.825	23.735278	3560–3565 and 3460–3465 (22)	7
LTE Femtocell 48	o17	37.982222	23.728056	3565–3570 and 3465–3470 (22)	8
LTE Femtocell 49	o26	37.981944	237.325	3570–3575 and 3470–3475 (22)	8
LTE Femtocell 50	o28	379.825	23.734444	3580–3585 and 3480–3485 (22)	8
LTE Femtocell 51	p6	37.981667	23.722778	3520–3525 and 3420–3425 (22)	8
LTE Femtocell 52	p14	37.981389	23.726944	3530–3535 and 3430–3435 (22)	8
LTE Femtocell 53	p29	37.981667	23.734444	3585–3590 and 3485–3490 (22)	8
LTE Femtocell 54	q13	37.980833	23.726111	3540–3545 and 3440–3445 (22)	9
LTE Femtocell 55	q14	37.980833	23.726667	3550–3555 and 3450–3455 (22)	9
LTE Femtocell 56	q21	37.981111	23.730556	3540–3545 and 3440–3445 (22)	9
LTE Femtocell 57	q25	37.980833	23.732222	3535–3540 and 3435–3440 (22)	9
LTE Femtocell 58	r19	37.980278	23.728889	3560–3565 and 3460–3465 (22)	9
LTE Femtocell 59	r20	37.980278	23.729444	3575–3580 and 3475–3480 (22)	9
LTE Femtocell 60	r30	37.980556	23.734444	3590–3595 and 3490–3495 (22)	9
LTE Femtocell 61	s10	37.980278	23.724722	3535–3540 and 3435–3440 (22)	10
LTE Femtocell 62	s16	37.979722	23.727778	3580–3585 and 3480–3485 (22)	10
LTE Femtocell 63	s30	37.980278	23.734444	3525–3530 and 3425–3430 (22)	10
LTE Femtocell 64	t13	37.979722	23.726389	3520–3525 and 3420–3425 (22)	10
LTE Femtocell 65	t20	37.979444	23.729722	3550–3555 and 3450–3455 (22)	10
LTE Femtocell 66	t22	37.979722	23.730556	3570–3575 and 3470–3475 (22)	10
LTE Femtocell 67	t25	37.98	23.732222	3565–3570 and 3465–3470 (22)	10
LTE Femtocell 68	u17	37.978889	23.728333	3575–3580 and 3475–3480 (22)	11
LTE Femtocell 69	u25	37.979167	23.732222	3530–3535 and 3430–3435 (22)	11
LTE Femtocell 70	u27	37.979167	23.733333	3520–3525 and 3420–3425 (22)	11

,

Table A4. The positions and the frequencies of the simulated WiMAX networks.

Network	Position	Geographic Latitude	Geographic Longitude	Downlink and Uplink Spectrum in MHz (WiMAX Band)	MAG
WiMAX Macrocell 1	d24	37.987222	23.731944	746–757 and 778–783 (7)	2
WiMAX Macrocell 2	f31	37.986111	23.735833	2315–2320 and 2345–2350 (2)	3
WiMAX Macrocell 3	g8	37.985833	23.723889	2315–2320 and 2345–2350 (2)	4
WiMAX Macrocell 4	l14	37.983611	23.726667	810–815 and 800–805 (7)	6
WiMAX Macrocell 5	m17	37.983056	23.728333	1795–1800 and 1785–1790 (8)	7
WiMAX Macrocell 6	n12	37.982222	23.725833	1800–1805 and 1790–1795 (8)	7
WiMAX Macrocell 7	p3	37.981944	23.721111	746–757 and 778–783 (7)	8
WiMAX Macrocell 8	s26	37.980278	23.7325	1925–1930 and 1920–1925 (8)	10
WiMAX Femtocell 1	c14	37.9875	23.727222	2625–2630 and 2505–2510 (3)	2
WiMAX Femtocell 2	d20	37.986944	23.73	2630–2635 and 2510–2525 (3)	2
WiMAX Femtocell 3	d29	37.986944	23.734722	2625–2630 and 2505–2510 (3)	2
WiMAX Femtocell 4	f16	37.986111	23.728056	2635–2640 and 2525–2530 (3)	3
WiMAX Femtocell 5	g12	37.986111	23.725833	2640–2645 and 2530–2535 (3)	4
WiMAX Femtocell 6	g18	37.985833	23.728889	2645–2650 and 2535–2540 (3)	4
WiMAX Femtocell 7	g19	37.985833	23.729444	2640–2645 and 2530–2535 (3)	4
WiMAX Femtocell 8	h25	37.985556	23.7325	2630–2635 and 2510–2525 (3)	4
WiMAX Femtocell 9	i3	37.985	23.720833	2625–2630 and 2505–2510 (3)	5
WiMAX Femtocell 10	i6	37.984722	23.722778	2640–2645 and 2530–2535 (3)	5
WiMAX Femtocell 11	i23	37.984722	23.731389	2650–2655 and 2540–2545 (3)	5
WiMAX Femtocell 12	j14	37.984444	23.726667	2625–2630 and 2505–2510 (3)	5
WiMAX Femtocell 13	j16	37.984167	23.728056	2655–2660 and 2545–2550 (3)	5
WiMAX Femtocell 14	j18	37.984167	23.728611	2630–2635 and 2510–2525 (3)	5
WiMAX Femtocell 15	j25	37.984167	23.7325	2625–2630 and 2505–2510 (3)	5
WiMAX Femtocell 16	k15	37.983889	23.727222	2650–2655 and 2540–2545 (3)	6
WiMAX Femtocell 17	l10	37.983056	23.724722	2630–2635 and 2510–2525 (3)	6
WiMAX Femtocell 18	l14	37.983333	23.727222	2635–2640 and 2525–2530 (3)	6
WiMAX Femtocell 19	l16	37.983333	23.727778	2640–2645 and 2530–2535 (3)	6
WiMAX Femtocell 20	l19	37.983611	23.729444	2645–2650 and 2535–2540 (3)	6
WiMAX Femtocell 21	l22	37.983611	23.730556	2660–2665 and 2550–2555 (3)	6
WiMAX Femtocell 22	l23	37.983611	23.731389	2635–2640 and 2525–2530 (3)	6
WiMAX Femtocell 23	m14	37.983056	23.727222	2665–2670 and 2555–2560 (3)	7
WiMAX Femtocell 24	m17	37.982778	23.728333	2625–2630 and 2505–2510 (3)	7
WiMAX Femtocell 25	m20	37.983056	23.73	2670–2675 and 2560–2565 (3)	7
WiMAX Femtocell 26	m22	37.983333	23.730833	2655–2660 and 2545–2550 (3)	7
WiMAX Femtocell 27	n26	37.982222	23.732778	2650–2655 and 2540–2545 (3)	7
WiMAX Femtocell 28	n29	37.9825	23.734444	2645–2650 and 2535–2540 (3)	7
WiMAX Femtocell 29	n31	37.982222	23.735556	2635–2640 and 2525–2530 (3)	7
WiMAX Femtocell 30	o21	37.981944	23.730278	2640–2645 and 2530–2535 (3)	8
WiMAX Femtocell 31	o30	37.981944	23.734722	2625–2630 and 2505–2510 (3)	8
WiMAX Femtocell 32	q14	37.980833	23.726667	2635–2640 and 2525–2530 (3)	9
WiMAX Femtocell 33	r10	37.980556	23.724722	2625–2630 and 2505–2510 (3)	9
WiMAX Femtocell 34	r12	37.980278	23.725556	2630–2635 and 2510–2525 (3)	9
WiMAX Femtocell 35	s20	37.98	23.729167	2650–2655 and 2540–2545 (3)	10
WiMAX Femtocell 36	s22	37.98	23.730556	2630–2635 and 2510–2525 (3)	10
WiMAX Femtocell 37	s26	37.98	23.7325	2640–2645 and 2530–2535 (3)	10
WiMAX Femtocell 38	t18	37.979167	23.728333	2635–2640 and 2525–2530 (3)	10
WiMAX Femtocell 39	t21	37.979444	23.73	2625–2630 and 2505–2510 (3)	10
WiMAX Femtocell 40	t28	37.979444	23.734167	2635–2640 and 2525–2530 (3)	10
WiMAX Femtocell 41	v15	37.978333	23.726944	2630–2635 and 2510–2525 (3)	11

(Appendix A) for the LTE-A Pro, the LTE-A, as well as the WiMAX and the WAVE technologies, respectively. Furthermore, the Fog infrastructure includes an SDN controller that constantly monitors the entire topology by implementing the Mobility Management as a Service (MMaS) model. Additional components including the Fog Manager, Fog Monitor, Network Manager, Network Monitor, Topology Discovery, Joint Resource Provisioner, and Power Consumption Estimator are incorporated into the Fog and are administered by the SDN controller. Specifically, the Fog Manager, as well as the Fog Monitor control the available resources of the topology. At the same time, the Network Manager manipulates OpenFlow forwarding tables, default path settings, and QoS-aware configurations. The Network Monitor provides the status of the switches of the entire infrastructure. Furthermore, the Topology Discovery component stores information about the generated topologies and the available UEs. Moreover, the Joint Resource Provisioner is utilized as a load coordinator for the VMs, the nodes, and the network traffic. Finally, the Power Consumption Estimator identifies the energy-demanding network access elements.

The Cloud infrastructure deploys a number of Virtual Machines (VMs) providing both Non-Disaster Management (nDM) and Disaster Management (DM) services. In particular, the nDM services include Navigation Assistance (NAV), Voice over IP (VoIP), Conversational Video (CV), Buffered Streaming (BS), and Web Browsing (Web) applications. On the other hand, DM services include Disaster-Aware Navigation Assistance (DA-NAV), Disaster-Aware Voice over IP (DA-VoIP), Live Video Streaming for Emergency Manipulation (LVS-EM), and Image Transmission for Emergency Manipulation (IT-EM) systems. Furthermore, the Cloud infrastructure includes a Software-Defined Cloud (SDC) controller. The SDC controller consists of a Cloud Monitor and a Cloud Manager, which monitor and manipulate the Cloud resources, respectively.

Each access network supports at least one of the aforementioned services. Furthermore, three Service Level Agreements (SLAs) are determined. The SLA1 supports the entire service types, while at the same time, it provides the best values for both the QoS and the operator’s policy decision criteria. SLA2 does not support CV, BS, and LVS-EM services. In addition, it provides slightly worse values about the criteria in comparison with the ones provided by SLA1. Finally, SLA3 supports only the NAV, web, and DA-NAV services with satisfactory values for the considered criteria.

The specifications of the networks are expressed using linguistic terms corresponding to specific value ranges per service type according to [23], whereas

Table 1. The simulation parameters.

Parameter	Value
Simulation duration	86,400 s (24 h)
Network count	WAVE RSUs: 28 LTE-A Pro FD-MIMO Macrocell BSs: 5 LTE-A Macrocell BSs: 8 LTE-A Femtocell BSs: 70 WiMAX Macrocell BSs: 8 WiMAX Femtocell BSs: 41 Total: 160
Cell radius	WAVE RSUs: 150 m LTE-A Pro FD-MIMO Macrocells: 320 m LTE-A/WiMAX Macrocells: 400 m LTE/WiMAX Femtocells: 30 m
Networks positions	According to the Hellenic Telecommunications and Post Commission (EETT) [50] data (see Appendix A)
Networks frequencies	See Appendix A
Service Layer Agreement (SLA) count	3
HO initiation threshold per SLA	$S_{th,SLA1}$: $0.81843$ ($Q_{SLA1}$: $0.9$, $SIN{R}_{SLA1}$: $0.8$) $S_{th,SLA2}$: $0.63642$ $Q_{SLA2}$: $0.75$, $SIN{R}_{SLA2}$: $0.65$) $S_{th,SLA3}$: $0.45457$ ($Q_{SLA3}$: $0.6$, $SIN{R}_{SLA3}$: $0.5$)
Vehicle count	77,797
Average arrival rate of vehicles	0.900428241 vehicles/second
Average departure rate of vehicles	0.895439815 vehicles/s
Vehicles per SLA	SLA1: 25,933 vehicles (33.3342%) SLA2: 25,932 vehicles (33.3329%) SLA3: 25,932 vehicles (33.3329%)
Services	Navigation Assistance (NAV) Voice over IP (VoIP) Conversational Video (CV) Buffered Streaming (BS) Web Browsing (WB)
Vehicles per velocity	Normal: 25,933 vehicles (33.3342%) Medium: 25,932 vehicles (33.3329%) High: 25,932 vehicles (33.3329%)

summarizes the parameters of the simulation. Besides, the simulated network architecture uses real-world data, including the positions of the access networks and the mobility pattern of the vehicles. Hence, the proposed scheme can be easily adopted by telecommunication providers that leverage 5G key enabling technologies, such as Cloud/Fog computing and SDN.

5.1. Study of a Simulation Snapshot

In this subsection, a simulation snapshot is studied. This snapshot was taken at a simulation time equal to 43,200 s (namely a 12 h interval), while 10 of the vehicles were monitored. Each vehicle needs to be connected to a PoA that fulfills the constraints of its services and at the same time complies with its corresponding SLA agreement.

Table 2. The monitored vehicles’ status.

Vehicular User	SLA	Services	Current Position (Latitude, Longitude)	Velocity	Disaster Severity Level	Remaining Energy
1	1	NAV, VoIP, IT-EM	37.984459, 23.728205	Normal	Elevated	80%
2	1	CV, Web	37.981693, 23.734297	High	Low or No	95%
3	1	BS, Web, DA-NAV, LVS-EM	37.982949, 23.725033	Normal	Severe	4%
4	1	NAV, CV, DA-VoIP	37.986155, 23.728610	Medium	Elevated	55%
5	2	Web, DA-NAV, DA-VoIP	37.983713, 23.727900	High	High	12%
6	2	NAV, Web, IT-EM	37.981198, 23.732510	Normal	Guarded	100%
7	2	VoIP, Web, DA-NAV, IT-EM	37.985405, 23.721205	Medium	Severe	72%
8	3	DA-NAV	37.984896, 23.731628	High	Guarded	60%
9	3	Web, DA-NAV	37.982396, 23.725600	Medium	High	7%
10	3	NAV, Web	37.986878, 23.734662	High	Low or No	58%

presents the status of each monitored vehicle. Furthermore,

Table 3. The networks that are available in the area of each monitored vehicle.

Vehicle	The PoAs That Provide Network Coverage in the Current Location
1	WAVE 11, LTE-A Pro FD-MIMO Macrocell 3, LTE Macrocell 1, LTE Macrocell 4, WiMAX Macrocell 4, WiMAX Macrocell 5, WiMAX Macrocell 6, WiMAX Femtocell 13
2	WAVE 17, WAVE 19, WAVE 21, LTE-A Pro FD-MIMO Macrocell 4, LTE Macrocell 3, LTE Macrocell 4, LTE Macrocell 7, LTE Femtocell 53, WiMAX Macrocell 8
3	WAVE 13, WAVE 18, LTE-A Pro FD-MIMO Macrocell 3, LTE Macrocell 2, LTE Macrocell 5, LTE Femtocell 30, LTE Femtocell 38, WiMAX Macrocell 3, WiMAX Macrocell 4, WiMAX Macrocell 5, WiMAX Macrocell 6, WiMAX Macrocell 7, WiMAX Femtocell 17
4	WAVE 1, WAVE 7, LTE-A Pro FD-MIMO Macrocell 3, LTE Macrocell 1, WiMAX Macrocell 1, WiMAX Macrocell 4, WiMAX Macrocell 5
5	WAVE 11, WAVE 15, LTE-A Pro FD-MIMO Macrocell 3, LTE Macrocell 1, LTE Macrocell 4, LTE Macrocell 5, LTE Femtocell 25, WiMAX Macrocell 4, WiMAX Macrocell 5, WiMAX Macrocell 6
6	WAVE 20, WAVE 27, LTE-A Pro FD-MIMO Macrocell 4, LTE Macrocell 3, LTE Macrocell 4, LTE Macrocell 7, WiMAX Macrocell 8
7	WAVE 6, LTE-A Pro FD-MIMO Macrocell 2, LTE Macrocell 2, WiMAX Macrocell 3, WiMAX Macrocell 7
8	WAVE 8, LTE-A Pro FD-MIMO Macrocell 1, LTE Macrocell 3, LTE Macrocell 4, LTE Femtocell 16, LTE Femtocell 17, WiMAX Macrocell 1, WiMAX Macrocell 2, WiMAX Macrocell 5, WiMAX Femtocell 11
9	WAVE 18, LTE-A Pro FD-MIMO Macrocell 3, LTE Macrocell 5, LTE Macrocell 8, LTE Femtocell 44, WiMAX Macrocell 4, WiMAX Macrocell 5, WiMAX Macrocell 6, WiMAX Macrocell 7
10	WAVE 5, LTE-A Pro FD-MIMO Macrocell 1, LTE Macrocell 3, LTE Femtocell 4, WiMAX Macrocell 1, WiMAX Macrocell 2, WiMAX Femtocell 3

presents the PoAs that are available in the location of each vehicle.

Initially, during the HO initiation, the estimated $Q_{u,i}$ and $SIN{R}_{u,i}$ values are used to obtain the user satisfaction $S_{u,i}$ with a lookup to the Satisfaction Indicators Chart (SIC). Figure 14 presents the service weights used for the estimation of the $Q_{u,i}$ as they are obtained from the IFANP method. Furthermore,

Table 4. The results of the HO initiation process.

Vehicle	Current PoA i	${\mathit{Q}}_{\mathit{u},\mathit{i}}$	${\mathbf{SINR}}_{\mathit{u},\mathit{i}}$ (${\mathbf{SINR}}_{\mathit{u},\mathit{i}}^{\mathit{d}\mathit{B}}$)	${\mathit{S}}_{\mathit{u},\mathit{i}}$	${\mathit{S}}_{\mathit{t}\mathit{h},{\mathit{S}\mathit{L}\mathit{A}}_{\mathit{u}}}$	Handover Required
1	WiMAX Femtocell 13	0.778401	0.15 (−4.75 dB)	0.090777	0.81843	Yes
2	LTE Macrocell 4	0.703974	0.07 (−7.55 dB)	0.062243	0.81843	Yes
3	WiMAX Macrocell 5	0.781015	0.28 (−0.2 dB)	0.16270	0.81843	Yes
4	WiMAX Macrocell 4	0.825158	0.18 (−3.7 dB)	0.14235	0.81843	Yes
5	LTE Macrocell 5	0.630301	0.01 (−9.65 dB)	0.024904	0.63642	Yes
6	LTE Macrocell 7	0.982691	0.82 (18.7 dB)	0.97462	0.63642	No
7	WiMAX Macrocell 7	0.806098	0.04 (−8.6 dB)	0.025393	0.63642	Yes
8	LTE Femtocell 16	0.686169	0.31 (0.85 dB)	0.18159	0.45457	Yes
9	LTE Femtocell 44	0.72937	0.32 (1.2 dB)	0.18158	0.45457	Yes
10	LTE Macrocell 3	0.868325	0.03 (−8.95 dB)	0.025203	0.45457	Yes

includes the satisfaction grade, the SLA threshold, and the HO decision per vehicle connected to a network with specific QoS and SINR rates.

In addition, the minimum acceptable $Q_{SLA}$ and $SIN{R}_{SLA}$ values per SLA are considered in order for the $S_{th,SLA}$ thresholds to be estimated. Consequently, if the satisfaction grade $S_{u,i}$ drops below the corresponding $S_{th,SLA}$ threshold, then the vehicle should perform an HO. Thus, according to the HO initiation results, Vehicle 6 will remain connected to its current PoA, while the rest of the vehicles will perform an HO to a new PoA.

During the network selection, the weights of the corresponding criteria per service type and SLA are estimated using the IFANP method. In particular, the considered criteria are classified into three clusters. The first cluster is called “Network QoS characteristics” and contains criteria such as the throughput, the latency, the jitter, and the packet loss. Correspondingly, the second cluster is called “network policy characteristics” and contains criteria such as monetary cost, security, and service reliability. Finally, the third cluster is called “network energy-aware characteristics” and includes the energy consumption criterion, which mainly is the weight adaptation factor.

Figure 15 presents the importance of each service with respect to the disaster severity level, while the estimated weights per SLA are presented in Figure 16, Figure 17 and Figure 18. As can be observed, these weights are proportional to the requirements of each service, as well as to the agreements of each SLA. Specifically, in the case of SLA1, the weight of the monetary cost criterion is low, while in this SLA, the most important factors are the network QoS characteristics and the service reliability. On the contrary, in SLA3, the monetary cost is the most important criterion resulting in a high estimated weight value. Furthermore, intermediate values were estimated for the SLA2. Additionally, Figure 19 presents the importance of the energy consumption factor in conjunction with the remaining energy in each UE, while Figure 20 presents the final weight for each vehicle considered for the network selection process.

Furthermore, Table 2 presents the SLA of each one of the monitored vehicles, as well as the services that it uses, its position, its velocity, the disaster severity level in its location, and the remaining energy of its equipment. The appropriate network for each vehicle is selected using the DFT-ACW algorithm described in [41]. The algorithm receives as the input the specifications of the networks of the 10 vehicles outlined in

Table A5. The networks of SLA1 considered in the study of the simulation snapshot.

	Disaster Management Services of SLA1
	Disaster-Aware NAV								Disaster-Aware VoIP								Live Video Streaming for Emergency Manipulation								Image Transmission for Emergency Manipulation
Network	Throughput	Latency	Jitter	Packet Loss	Energy Consumption	Service Reliability	Security	Monetary Cost	Throughput	Latency	Jitter	Packet Loss	Energy Consumption	Service Reliability	Security	Monetary Cost	Throughput	Latency	Jitter	Packet Loss	Energy Consumption	Service Reliability	Security	Monetary Cost	Throughput	Latency	Jitter	Packet Loss	Energy Consumption	Service Reliability	Security	Monetary Cost
WAVE 1	AH	H	VH	AH	M	H	VH	L	VH	AH	AH	H	M	H	H	L	VH	VH	VH	H	M	H	VH	L	H	AH	VH	AH	M	VH	VH	ML
WAVE 7	AH	VH	H	H	MH	VH	VH	ML	AH	AH	AH	VH	MH	VH	VH	L	H	H	H	H	MH	H	VH	L	AH	AH	AH	VH	MH	H	H	ML
WAVE 11	VH	AH	AH	AH	M	H	AH	ML	AH	AH	H	VH	M	AH	H	ML	VH	VH	VH	H	M	VH	H	ML	H	AH	AH	AH	M	H	H	ML
WAVE 13	VH	AH	AH	VH	MH	AH	H	L	VH	H	VH	H	MH	AH	H	L	H	VH	VH	VH	MH	AH	AH	ML	AH	AH	H	VH	MH	H	H	ML
WAVE 17	VH	AH	VH	VH	M	AH	H	ML	H	AH	H	VH	M	AH	AH	L	VH	VH	VH	H	M	VH	AH	L	AH	AH	H	VH	M	H	AH	L
WAVE 18	VH	H	VH	H	MH	VH	AH	L	AH	H	AH	H	MH	AH	AH	ML	H	VH	VH	AH	MH	VH	AH	L	H	AH	AH	VH	MH	H	H	ML
WAVE 19	AH	H	VH	AH	M	VH	AH	L	H	AH	AH	H	M	VH	AH	ML	H	AH	VH	VH	M	VH	AH	ML	H	AH	VH	AH	M	VH	VH	L
WAVE 21	H	VH	VH	H	H	AH	H	ML	H	AH	H	H	H	AH	VH	L	AH	AH	AH	H	H	AH	AH	L	VH	VH	VH	AH	H	H	AH	ML
LTE FD-MIMO 3	AH	AH	AH	AH	AL	VH	AH	VL	AH	VH	AH	VH	AL	VH	VH	AL	AH	AH	VH	VH	AL	AH	VH	VL	VH	AH	AH	VH	AL	AH	VH	VL
LTE FD-MIMO 4	AH	VH	VH	AH	AL	VH	VH	AL	AH	VH	AH	VH	AL	VH	AH	VL	AH	AH	AH	VH	AL	VH	VH	AL	VH	AH	AH	AH	AL	AH	VH	VL
LTE Macrocell 1	AH	VH	AH	H	MH	H	H	L	VH	AH	AH	VH	MH	VH	H	ML	VH	AH	H	VH	MH	AH	VH	ML	VH	AH	H	H	MH	AH	AH	L
LTE Macrocell 2	VH	H	AH	H	H	H	AH	ML	H	AH	AH	H	H	H	VH	ML	H	VH	AH	AH	H	H	VH	ML	VH	VH	VH	VH	H	VH	VH	L
LTE Macrocell 3	VH	H	VH	AH	MH	AH	AH	L	VH	H	VH	H	MH	H	AH	L	VH	H	H	VH	MH	AH	VH	L	VH	AH	VH	H	MH	H	H	ML
LTE Macrocell 4	H	AH	H	VH	MH	H	AH	ML	H	AH	VH	VH	MH	VH	AH	L	AH	VH	AH	H	MH	VH	H	ML	H	AH	VH	H	MH	H	H	L
LTE Macrocell 5	AH	AH	H	VH	M	AH	VH	L	AH	H	AH	VH	M	AH	VH	ML	VH	VH	AH	H	M	VH	H	L	AH	VH	H	AH	M	AH	H	ML
LTE Macrocell 6	VH	AH	H	H	MH	AH	VH	L	VH	VH	AH	H	MH	VH	H	ML	VH	VH	AH	VH	MH	H	H	L	AH	VH	H	H	MH	H	AH	ML
LTE Macrocell 7	VH	AH	VH	H	H	VH	VH	L	AH	H	H	AH	H	AH	VH	L	H	VH	AH	AH	H	AH	H	L	AH	VH	AH	AH	H	AH	VH	L
LTE Femtocell 30	H	VH	VH	VH	M	H	H	ML	AH	H	H	H	M	H	AH	L	H	AH	H	H	M	AH	VH	ML	AH	AH	H	VH	M	VH	AH	L
LTE Femtocell 38	AH	AH	H	AH	M	AH	VH	ML	AH	H	H	VH	M	H	VH	L	AH	VH	VH	AH	M	VH	H	ML	AH	AH	H	VH	M	VH	VH	L
LTE Femtocell 53	AH	H	AH	AH	M	H	AH	L	H	VH	AH	AH	M	AH	AH	L	H	VH	AH	H	M	AH	VH	L	VH	AH	AH	AH	M	AH	VH	L
WiMAX Macrocell 1	H	H	VH	VH	M	H	AH	ML	VH	AH	VH	AH	M	H	VH	L	H	AH	H	AH	M	VH	VH	ML	H	AH	H	H	M	H	AH	L
WiMAX Macrocell 3	AH	H	AH	AH	MH	VH	H	L	H	VH	AH	H	MH	H	VH	ML	AH	H	VH	VH	MH	AH	H	ML	H	VH	AH	VH	MH	H	AH	L
WiMAX Macrocell 4	AH	AH	VH	VH	M	H	H	L	VH	VH	VH	H	M	H	AH	L	VH	H	AH	VH	M	AH	VH	L	AH	H	AH	VH	M	H	VH	ML
WiMAX Macrocell 5	AH	VH	AH	VH	H	H	H	ML	AH	AH	VH	AH	H	VH	AH	L	H	H	AH	VH	H	AH	VH	L	H	AH	H	H	H	AH	AH	ML
WiMAX Macrocell 6	VH	AH	VH	AH	H	VH	VH	ML	H	VH	H	AH	H	AH	AH	ML	H	H	H	H	H	AH	AH	L	AH	AH	VH	H	H	VH	VH	ML
WiMAX Macrocell 7	H	AH	H	H	M	H	AH	L	H	VH	AH	VH	M	AH	VH	L	H	AH	H	H	M	H	H	L	AH	VH	VH	AH	M	H	VH	ML
WiMAX Macrocell 8	H	H	AH	H	M	VH	H	L	H	AH	H	H	M	VH	AH	ML	AH	H	H	VH	M	AH	H	L	H	AH	VH	AH	M	AH	AH	ML
WiMAX Femtocell 13	AH	VH	VH	VH	M	AH	AH	L	AH	H	VH	VH	M	H	H	ML	H	VH	H	H	M	AH	AH	ML	H	H	VH	AH	M	AH	H	ML
WiMAX Femtocell 17	VH	VH	VH	H	H	H	VH	L	AH	VH	H	H	H	H	AH	ML	AH	H	VH	VH	H	H	H	ML	AH	VH	H	AH	H	H	AH	L
	Non-Disaster Management Services of SLA1
	NAV										VoIP											CV
Network	Throughput	Latency	Jitter	Packet Loss	Energy Consumption		Service Reliability		Security	Monetary Cost	Throughput		Latency	Jitter	Packet Loss	Energy Consumption		Service Reliability		Security	Monetary Cost	Throughput		Latency	Jitter	Packet Loss	Energy Consumption		Service Reliability		Security	Monetary Cost
WAVE 1	VH	MH	VH	H	M		AH		H	L	AH		AH	AH	VH	M		AH		H	ML	VH		VH	VH	AH	M		AH		VH	L
WAVE 7	MH	MH	MH	MH	MH		VH		H	ML	AH		AH	H	VH	MH		VH		AH	ML	VH		AH	AH	H	MH		VH		AH	ML
WAVE 11	VH	MH	VH	VH	M		H		VH	ML	H		AH	H	VH	M		AH		VH	L	VH		AH	AH	VH	M		VH		VH	L
WAVE 13	MH	VH	VH	H	MH		AH		H	L	VH		VH	H	VH	MH		VH		VH	ML	H		H	H	H	MH		VH		VH	L
WAVE 17	H	H	H	MH	M		VH		VH	ML	H		H	VH	H	M		AH		AH	L	H		VH	VH	H	M		VH		H	L
WAVE 18	H	MH	VH	H	MH		VH		AH	ML	AH		H	H	VH	MH		VH		AH	L	AH		VH	H	VH	MH		AH		VH	L
WAVE 19	MH	VH	MH	MH	M		AH		H	ML	H		VH	AH	VH	M		AH		AH	ML	H		VH	AH	VH	M		VH		VH	ML
WAVE 21	MH	H	MH	H	H		VH		VH	ML	VH		H	H	H	H		VH		H	ML	VH		H	VH	H	H		VH		AH	L
LTE FD-MIMO 3	AH	VH	VH	VH	AL		VH		VH	VL	AH		VH	AH	AH	AL		AH		VH	AL	VH		VH	AH	VH	AL		AH		AH	AL
LTE FD-MIMO 4	VH	AH	VH	AH	AL		AH		VH	AL	AH		VH	AH	AH	AL		AH		AH	AL	AH		AH	AH	AH	AL		AH		VH	AL
LTE Macrocell 1	H	VH	VH	VH	MH		VH		AH	ML	H		VH	VH	H	MH		VH		H	L	VH		H	AH	VH	MH		VH		AH	ML
LTE Macrocell 2	MH	VH	VH	VH	H		VH		VH	L	H		H	AH	VH	H		VH		AH	L	VH		AH	VH	VH	H		VH		VH	ML
LTE Macrocell 3	H	VH	H	VH	MH		VH		AH	ML	VH		VH	H	AH	MH		VH		VH	L	H		VH	VH	AH	MH		AH		AH	ML
LTE Macrocell 4	H	MH	VH	H	MH		H		VH	ML	AH		VH	VH	H	MH		H		VH	ML	AH		H	H	VH	MH		VH		VH	L
LTE Macrocell 5	MH	MH	H	MH	M		AH		H	ML	AH		H	AH	AH	M		AH		VH	ML	H		H	AH	AH	M		H		AH	ML
LTE Macrocell 6	MH	VH	H	H	MH		AH		H	L	H		H	AH	AH	MH		VH		H	L	AH		AH	H	H	MH		H		VH	L
LTE Femtocell 30	H	H	VH	VH	M		AH		VH	L	H		VH	VH	AH	M		VH		AH	ML	AH		AH	VH	VH	M		VH		H	ML
LTE Femtocell 38	MH	VH	VH	VH	M		H		VH	ML	VH		VH	VH	H	M		VH		H	ML	AH		AH	H	AH	M		H		VH	ML
LTE Femtocell 53	MH	MH	VH	H	M		H		VH	ML	AH		VH	AH	AH	M		AH		VH	L	VH		H	AH	VH	M		H		AH	ML
WiMAX Macrocell 1	MH	VH	H	VH	M		AH		AH	L	AH		AH	VH	H	M		VH		AH	ML	VH		H	AH	AH	M		AH		VH	L
WiMAX Macrocell 3	H	H	VH	VH	MH		VH		AH	ML	H		AH	H	VH	MH		AH		H	L	AH		H	AH	VH	MH		VH		H	L
WiMAX Macrocell 4	VH	H	MH	VH	M		H		VH	ML	AH		H	AH	H	M		AH		H	ML	AH		AH	AH	VH	M		AH		H	L
WiMAX Macrocell 5	H	VH	H	VH	H		AH		AH	L	AH		VH	AH	AH	H		H		H	ML	H		VH	AH	H	H		H		H	L
WiMAX Macrocell 6	H	H	H	H	H		VH		VH	L	H		H	VH	VH	H		AH		VH	L	AH		AH	H	VH	H		VH		AH	L
WiMAX Macrocell 7	MH	VH	VH	VH	M		VH		AH	L	VH		AH	H	AH	M		H		VH	ML	AH		AH	H	VH	M		AH		AH	L
WiMAX Macrocell 8	MH	MH	H	VH	M		H		H	ML	VH		AH	H	AH	M		VH		VH	ML	VH		H	VH	AH	M		VH		VH	ML
WiMAX Femtocell 13	H	H	VH	H	M		AH		VH	L	VH		AH	VH	AH	M		AH		H	ML	VH		VH	H	H	M		VH		AH	L
WiMAX Femtocell 17	VH	VH	MH	H	H		AH		VH	ML	AH		VH	H	H	H		AH		AH	L	VH		H	VH	H	H		AH		VH	ML
	NAV																VoIP
Network	Throughput		Latency		Jitter		Packet Loss		Energy Consumption		Service Reliability		Security		Monetary Cost		Throughput		Latency		Jitter		Packet Loss		Energy Consumption		Service Reliability		Security		Monetary Cost
WAVE 1	AH		H		H		VH		M		VH		AH		ML		AH		AH		VH		AH		M		H		H		ML
WAVE 7	VH		H		VH		VH		MH		VH		VH		ML		AH		VH		AH		VH		MH		H		H		ML
WAVE 11	AH		VH		VH		AH		M		AH		H		ML		H		H		AH		H		M		H		VH		L
WAVE 13	H		H		H		H		MH		VH		AH		ML		AH		H		VH		AH		MH		AH		H		ML
WAVE 17	H		VH		AH		H		M		VH		VH		ML		H		VH		H		VH		M		H		AH		ML
WAVE 18	H		H		H		VH		MH		AH		VH		ML		VH		AH		H		AH		MH		AH		AH		ML
WAVE 19	AH		AH		H		H		M		AH		VH		ML		VH		VH		AH		VH		M		AH		H		ML
WAVE 21	VH		AH		AH		AH		H		AH		AH		ML		H		AH		H		AH		H		AH		VH		L
LTE FD-MIMO 3	VH		VH		AH		VH		AL		VH		VH		VL		AH		VH		AH		AH		AL		VH		VH		AL
LTE FD-MIMO 4	VH		VH		VH		AH		AL		AH		VH		VL		VH		AH		VH		VH		AL		AH		AH		AL
LTE Macrocell 1	AH		VH		VH		AH		MH		AH		H		ML		H		AH		AH		H		MH		H		AH		L
LTE Macrocell 2	AH		VH		H		AH		H		AH		H		L		AH		AH		AH		VH		H		H		H		ML
LTE Macrocell 3	VH		H		VH		H		MH		VH		AH		ML		VH		VH		AH		VH		MH		VH		VH		L
LTE Macrocell 4	VH		AH		VH		VH		MH		H		AH		L		H		AH		AH		VH		MH		VH		AH		ML
LTE Macrocell 5	H		VH		VH		AH		M		H		AH		L		VH		H		VH		AH		M		AH		H		ML
LTE Macrocell 6	VH		AH		VH		AH		MH		H		H		ML		AH		H		H		VH		MH		H		H		ML
LTE Macrocell 7	VH		VH		VH		AH		H		H		AH		L		VH		VH		AH		H		H		H		H		L
LTE Femtocell 30	H		AH		AH		H		M		AH		AH		ML		VH		H		VH		AH		M		VH		VH		ML
LTE Femtocell 38	AH		H		H		H		M		VH		VH		ML		H		H		H		H		M		AH		H		ML
LTE Femtocell 53	VH		AH		AH		H		M		AH		AH		L		H		VH		H		VH		M		AH		AH		ML
WiMAX Macrocell 1	VH		H		VH		AH		M		H		H		L		VH		AH		H		VH		M		AH		H		ML
WiMAX Macrocell 3	AH		AH		H		AH		MH		H		AH		ML		H		VH		AH		AH		MH		VH		H		ML
WiMAX Macrocell 4	AH		AH		VH		AH		M		AH		H		ML		VH		AH		H		VH		M		H		H		L
WiMAX Macrocell 5	AH		VH		VH		H		H		VH		VH		ML		H		VH		VH		H		H		H		VH		L
WiMAX Macrocell 6	VH		VH		AH		AH		H		AH		H		ML		H		VH		AH		AH		H		H		VH		ML
WiMAX Macrocell 7	H		AH		VH		AH		M		VH		AH		L		VH		H		H		AH		M		H		H		ML
WiMAX Macrocell 8	H		H		AH		H		M		VH		VH		L		VH		H		H		AH		M		AH		H		L
WiMAX Femtocell 13	H		VH		H		AH		M		H		H		ML		H		VH		VH		AH		M		VH		H		ML
WiMAX Femtocell 17	VH		H		VH		AH		H		AH		H		L		H		AH		VH		VH		H		AH		H		ML

and

Table A6. The networks of SLA2 and SLA3 considered in the study of the simulation snapshot.

	Disaster Management Services of SLA2
	Disaster-Aware NAV								Disaster-Aware VoIP								Image Transmission for Emergency Manipulation
Network	Throughput	Latency	Jitter	Packet Loss	Energy Consumption	Service Reliability	Security	Monetary Cost	Throughput	Latency	Jitter	Packet Loss	Energy Consumption	Service Reliability	Security	Monetary Cost	Throughput	Latency	Jitter	Packet Loss	Energy Consumption	Service Reliability	Security	Monetary Cost
WAVE 6	H	H	M	VH	MH	H	MH	MH	H	H	MH	VH	MH	H	H	H	VH	VH	MH	VH	MH	M	MH	H
WAVE 11	H	VH	H	H	M	M	H	H	H	VH	MH	H	M	VH	M	H	M	H	VH	VH	M	M	MH	VH
WAVE 15	H	M	H	H	M	MH	M	VH	MH	MH	MH	H	M	MH	M	MH	H	H	VH	MH	M	H	MH	MH
WAVE 20	VH	H	H	H	M	MH	MH	VH	MH	MH	MH	VH	M	MH	MH	MH	H	MH	M	MH	M	M	MH	H
WAVE 27	MH	VH	MH	MH	H	VH	H	H	H	MH	H	H	H	MH	MH	H	M	MH	H	H	H	M	H	VH
LTE FD-MIMO 2	VH	VH	H	H	AL	VH	VH	M	AH	AH	VH	VH	AL	AH	H	ML	VH	VH	VH	AH	AL	VH	VH	M
LTE FD-MIMO 3	VH	AH	AH	VH	AL	H	VH	M	AH	VH	VH	VH	AL	VH	H	M	H	AH	AH	H	AL	AH	VH	MH
LTE FD-MIMO 4	VH	H	H	VH	AL	VH	VH	ML	AH	H	VH	H	AL	H	AH	M	VH	AH	AH	AH	AL	AH	VH	ML
LTE Macrocell 1	VH	H	H	M	MH	MH	M	MH	MH	H	H	MH	MH	H	M	VH	MH	H	MH	M	MH	H	H	VH
LTE Macrocell 2	H	M	H	M	H	MH	H	VH	MH	VH	VH	MH	H	M	MH	VH	MH	H	MH	H	H	H	MH	H
LTE Macrocell 3	MH	MH	H	H	MH	H	VH	MH	H	MH	MH	M	MH	MH	VH	MH	MH	H	MH	MH	MH	MH	MH	MH
LTE Macrocell 4	M	H	MH	H	MH	MH	VH	VH	M	VH	H	H	MH	H	H	MH	MH	H	MH	MH	MH	MH	MH	H
LTE Macrocell 5	VH	H	M	MH	M	VH	MH	MH	VH	M	VH	H	M	H	H	H	H	MH	M	VH	M	VH	M	H
LTE Macrocell 7	MH	H	H	MH	H	MH	MH	MH	VH	M	M	VH	H	H	H	H	H	H	VH	H	H	H	MH	MH
LTE Femtocell 25	M	H	H	VH	M	H	VH	VH	VH	H	VH	MH	M	MH	VH	VH	VH	M	H	H	M	H	MH	VH
WiMAX Macrocell 3	VH	MH	H	VH	MH	H	M	H	M	H	VH	MH	MH	MH	MH	VH	M	H	H	H	MH	M	VH	H
WiMAX Macrocell 4	VH	VH	MH	H	M	M	MH	H	MH	MH	MH	MH	M	M	VH	H	H	MH	H	H	M	M	MH	H
WiMAX Macrocell 5	VH	MH	VH	H	H	MH	M	VH	H	VH	H	H	H	H	VH	MH	MH	VH	MH	MH	H	VH	VH	H
WiMAX Macrocell 6	MH	H	MH	VH	H	H	H	VH	M	H	M	VH	H	H	VH	H	VH	H	MH	MH	H	MH	MH	H
WiMAX Macrocell 7	M	H	MH	M	M	MH	H	MH	M	H	VH	MH	M	H	MH	MH	VH	MH	H	H	M	MH	MH	H
WiMAX Macrocell 8	MH	MH	VH	M	M	H	MH	MH	M	VH	M	M	M	H	H	VH	MH	VH	MH	VH	M	VH	VH	H
	NAV								VoIP								Web
Network	Throughput	Latency	Jitter	Packet Loss	Energy Consumption	Service Reliability	Security	Monetary Cost	Throughput	Latency	Jitter	Packet Loss	Energy Consumption	Service Reliability	Security	Monetary Cost	Throughput	Latency	Jitter	Packet Loss	Energy Consumption	Service Reliability	Security	Monetary Cost
WAVE 6	MH	M	H	MH	MH	AH	M	H	MH	VH	VH	M	MH	MH	AH	VH	MH	VH	VH	MH	MH	M	H	H
WAVE 11	MH	ML	H	H	M	H	VH	H	MH	AH	M	H	M	AH	H	H	M	MH	VH	MH	M	MH	H	MH
WAVE 15	MH	H	H	H	M	VH	VH	MH	H	MH	VH	H	M	MH	M	VH	M	H	M	H	M	H	VH	H
WAVE 20	M	H	M	VH	M	H	H	VH	VH	M	MH	H	M	H	MH	MH	VH	M	MH	H	M	VH	MH	H
WAVE 27	VH	MH	MH	MH	H	MH	MH	VH	H	VH	MH	M	H	H	H	H	VH	H	M	MH	H	H	H	MH
LTE FD-MIMO 2	AH	VH	AH	AH	AL	AH	MH	ML	VH	VH	VH	AH	AL	VH	AH	M	H	H	VH	VH	AL	VH	AH	ML
LTE FD-MIMO 3	VH	H	H	H	AL	H	H	ML	VH	VH	AH	AH	AL	AH	H	L	VH	VH	VH	AH	AL	H	VH	M
LTE FD-MIMO 4	VH	AH	H	VH	AL	AH	VH	ML	AH	H	AH	VH	AL	VH	VH	ML	H	AH	H	H	AL	VH	AH	M
LTE Macrocell 1	M	MH	MH	H	MH	MH	VH	MH	MH	MH	H	MH	MH	MH	M	MH	MH	VH	H	MH	MH	M	VH	H
LTE Macrocell 2	ML	MH	MH	H	H	MH	H	M	MH	M	VH	H	H	MH	VH	MH	VH	VH	VH	MH	H	MH	M	H
LTE Macrocell 3	MH	MH	M	MH	MH	MH	VH	MH	H	MH	MH	H	MH	MH	MH	M	H	H	VH	MH	MH	MH	H	H
LTE Macrocell 4	M	M	MH	M	MH	M	H	MH	VH	MH	MH	MH	MH	M	MH	MH	M	H	H	H	MH	MH	H	VH
LTE Macrocell 5	M	M	M	ML	M	VH	M	MH	H	M	H	H	M	H	H	H	H	M	H	H	M	VH	M	H
LTE Macrocell 7	H	M	MH	MH	H	VH	MH	MH	H	MH	MH	M	H	H	H	H	H	H	H	MH	H	MH	MH	MH
LTE Femtocell 25	ML	H	M	MH	M	MH	H	M	H	VH	VH	H	M	H	MH	MH	H	H	H	MH	M	H	MH	H
WiMAX Macrocell 3	M	M	VH	H	MH	VH	VH	H	MH	AH	M	VH	MH	AH	M	MH	MH	MH	H	H	MH	H	M	VH
WiMAX Macrocell 4	MH	M	M	VH	M	H	VH	H	AH	M	H	M	M	AH	M	H	H	H	M	H	M	MH	MH	MH
WiMAX Macrocell 5	M	MH	H	MH	H	H	H	H	H	VH	VH	H	H	MH	H	VH	MH	MH	MH	M	H	MH	MH	MH
WiMAX Macrocell 6	MH	M	MH	H	H	MH	MH	MH	MH	MH	H	H	H	AH	VH	MH	MH	MH	VH	VH	H	MH	MH	H
WiMAX Macrocell 7	ML	H	H	H	M	H	VH	H	VH	H	H	H	M	M	H	H	MH	M	M	H	M	MH	M	VH
WiMAX Macrocell 8	MH	ML	MH	VH	M	MH	H	VH	VH	AH	M	H	M	VH	MH	VH	H	MH	MH	H	M	VH	MH	MH
	Non-Disaster Management Services																Disaster Management Services
	NAV								Web								Disaster-Aware NAV
Network	Throughput	Latency	Jitter	Packet Loss	Energy Consumption	Service Reliability	Security	Monetary Cost	Throughput	Latency	Jitter	Packet Loss	Energy Consumption	Service Reliability	Security	Monetary Cost	Throughput	Latency	Jitter	Packet Loss	Energy Consumption	Service Reliability	Security	Monetary Cost
WAVE 5	M	H	ML	M	MH	MH	M	AH	H	M	M	MH	MH	H	M	AH	ML	ML	MH	H	MH	ML	M	VH
WAVE 8	VL	M	M	MH	M	MH	H	AH	MH	MH	MH	M	M	MH	M	AH	ML	L	M	MH	M	M	L	AH
WAVE 18	L	L	ML	MH	MH	H	VH	AH	ML	MH	M	H	MH	MH	MH	AH	M	ML	M	ML	MH	M	MH	VH
LTE FD-MIMO 1	H	H	M	H	AL	M	MH	M	MH	MH	H	MH	AL	H	MH	M	H	M	H	H	AL	H	VH	VH
LTE FD-MIMO 3	H	M	MH	MH	AL	M	M	M	H	MH	MH	H	AL	MH	H	H	H	H	H	MH	AL	M	H	VH
LTE FD-MIMO 4	H	H	MH	H	AL	H	H	M	M	VH	M	MH	AL	MH	H	MH	MH	MH	M	H	AL	MH	H	MH
LTE Macrocell 3	ML	M	L	ML	MH	ML	H	VH	M	M	H	M	MH	ML	M	VH	M	M	MH	M	MH	M	H	VH
LTE Macrocell 4	L	L	M	ML	MH	L	MH	AH	L	MH	M	M	MH	M	M	AH	ML	MH	M	MH	MH	M	MH	AH
LTE Macrocell 5	L	ML	ML	VL	M	MH	ML	AH	M	ML	MH	MH	M	MH	L	AH	MH	M	ML	ML	M	MH	M	VH
LTE Macrocell 8	VL	ML	ML	ML	M	ML	H	AH	M	MH	M	H	M	ML	MH	VH	H	ML	L	ML	M	H	MH	VH
LTE Femtocell 4	H	H	MH	H	MH	ML	ML	AH	H	ML	M	H	MH	MH	MH	AH	ML	M	M	M	MH	H	MH	VH
LTE Femtocell 16	ML	M	M	M	MH	MH	ML	VH	MH	M	M	MH	MH	H	MH	VH	MH	L	M	L	MH	ML	MH	AH
LTE Femtocell 17	MH	L	L	M	MH	ML	MH	AH	M	H	H	ML	MH	MH	ML	VH	MH	ML	ML	M	MH	M	L	AH
LTE Femtocell 44	ML	MH	M	VL	MH	L	H	VH	ML	MH	L	ML	MH	ML	MH	AH	L	ML	MH	MH	MH	MH	H	VH
WiMAX Macrocell 1	VL	ML	ML	M	M	MH	M	VH	MH	M	M	M	M	MH	ML	VH	ML	L	ML	M	M	ML	H	AH
WiMAX Macrocell 2	M	L	MH	H	MH	ML	M	AH	MH	ML	MH	ML	MH	MH	MH	AH	L	H	M	MH	MH	M	L	VH
WiMAX Macrocell 4	M	ML	ML	MH	M	MH	H	AH	MH	MH	ML	M	M	M	M	VH	H	H	M	M	M	L	ML	VH
WiMAX Macrocell 5	ML	M	MH	ML	H	M	MH	VH	M	M	ML	ML	H	M	ML	VH	MH	M	MH	MH	H	M	ML	AH
WiMAX Macrocell 6	M	L	M	M	H	ML	M	VH	M	M	H	H	H	M	ML	VH	M	M	M	H	H	M	M	AH
WiMAX Macrocell 7	VL	MH	MH	M	M	MH	MH	AH	ML	ML	ML	M	M	M	ML	AH	L	MH	M	L	M	ML	M	VH
WiMAX Femtocell 3	VL	M	MH	M	MH	M	M	AH	MH	M	M	H	MH	ML	M	VH	M	M	MH	ML	MH	MH	M	VH
WiMAX Femtocell 11	ML	MH	ML	ML	MH	MH	ML	AH	MH	MH	ML	MH	MH	H	MH	AH	M	M	H	MH	MH	M	M	AH

(Appendix B). As follows, the network that each vehicle selects is given in

Table 5. The network that each vehicle selects.

Vehicle	Selected Network
1	LTE-A Pro FD-MIMO Macrocell 3
2	LTE-A Pro FD-MIMO Macrocell 4
3	LTE-A Pro FD-MIMO Macrocell 3
4	WiMAX Macrocell 5
5	WiMAX Macrocell 6
6	LTE Macrocell 7
7	LTE-A Pro FD-MIMO Macrocell 2
8	LTE-A Pro FD-MIMO Macrocell 1
9	WiMAX Macrocell 5
10	WAVE 5

. The always best connected principle is ensured since the required satisfaction grade per vehicle based on its mobility pattern and services is maintained.

In addition, the signaling transmission cost of the discussed methodology was compared with the one obtained from the FMIPv6 [51] and the eFPMIPv6 [52] schemes. For the latter two schemes, the algorithms considered for the HO initiation and the network selection processes were the Velocity-Aware Handover (VAH) [35], the Fuzzy AHP TOPSIS (FAT) [53], the Fuzzy AHP SAW (FAS) [53], the Fuzzy AHP MEW (FAM) [53], and the Fuzzy AHP ELECTRE (FAE) [54]. The number of hops that each signaling message performs (

Table 6. The hops between the components of the considered topology.

Communicating Components	Number of Hops
$H_{MN,MAG}$	1
$H_{MAG,LMA}$	1
$H_{MAG,MIIS}$	1
$H_{MAG,MAG}$	2

), as well as the size in bytes of each message (

Table 7. The cost of each message exchanged during the signaling process.

Message Name	Size (Bytes)	Abbreviation
MIH_Link_Going_down	78	$M_1$
MIH_GET_Information_request	1500	$M_2$
MIH_GET_Information_response	1500	$M_3$
MIH_Net_HO_Candidate_Query_request	63 + 11·n + 8·m·n	$M_4$
MIH_Net_HO_Candidate_Query_response	77 + 101·m	$M_5$
MIH_N2N_HO_Query_Resource_request	150 + 11·m	$M_{5b}$
MIH_N2N_HO_Query_Resource_response	165	$M_{5c}$
MIH_N2N_HO_Commit_request	213	$M_6$
MIH_N2N_HO_Commit_request (Extended)	264	$M_{6e}$
MIH_N2N_HO_Commit_response	92	$M_7$
MIH_N2N_HO_Commit_response (Extended)	92	$M_{7e}$
MIH_Net_HO_Commit_request	122	$M_8$
MIH_Net_HO_Commit_response	103	$M_9$
Handover_Initiate	72	$M_{10}$
Handover_Ack	32	$M_{11}$
PBU	76	$M_{12,16}$
PBA	52	$M_{13,17}$
MIH_Link_up	95	$M_{14}$
UNA	52	$M_{15}$
MIH_N2N_HO_Complete_request	109	$M_{18}$
MIH_N2N_HO_Complete_response	112	$M_{19}$
RS	16	$M_{20}$
RA	64	$M_{21}$

) according to [55] were considered for the evaluation.

In particular, the signaling cost of the discussed methodology was estimated using Formula (42). In this formula, the $P_f$ parameter indicates the connection failure probability, which is supposed to be equal to $0.5$ [55]. Furthermore, the n parameter indicates the number of available PoAs.

$$\begin{array}{cc}\hfill Cos{t}_{proposed}& =\frac{P_f}{1-P_f}·H_{MN,MAG}·(M_1+M_8+M_9+M_{14}+M_{15})\hfill \\ & +2·H_{MAG,LMA}·(M_{12,16}+M_{13,17})\hfill \\ & +H_{MAG,MIIS}·(M_2+M_3)+H_{MAG,MAG}·(n·(M_4\hfill \\ & +M_5)+M_6+M_7+M_{10}+M_{11}+M_{18}+M_{19}\left)\right)\hfill \end{array}$$

(42)

Similarly, the signaling cost of the FMIPv6 was estimated using Formula (43), while the corresponding cost of the eFPMIPv6 was estimated using Formula (44).

$$\begin{array}{cc}\hfill Cos{t}_{FMIPv6}& =\frac{P_f}{1-P_f}·H_{MN,MAG}·(M_1+M_4+M_5+M_8+M_9\hfill \\ & +M_{20}+M_{21})+3·H_{MAG,LMA}·(M_{12,16}+M_{13,17})\hfill \\ & +H_{MAG,MIIS}·(M_2+M_3)+H_{MAG,MAG}·(n·(M_{5b}\hfill \\ & +M_{5c})+M_6+M_7+M_{10}+M_{11}+M_{18}+M_{19})\hfill \end{array}$$

(43)

$$\begin{array}{cc}\hfill Cos{t}_{eFPMIPv6}& =\frac{P_f}{1-P_f}·H_{MN,MAG}·(M_1+M_4+M_5+M_8+M_9\hfill \\ & +M_{14}+M_{15})+2·H_{MAG,LMA}·(M_{12,16}+M_{13,17})\hfill \\ & +H_{MAG,MIIS}·(M_2+M_3)+H_{MAG,MAG}·(n·(M_{5b}\hfill \\ & +M_{5c})+M_{6e}+M_{7e}+M_{18}+M_{19})\hfill \end{array}$$

(44)

The signaling costs obtained from each scheme are presented in Figure 21. In particular, the proposed scheme achieved a lower signaling cost than the one achieved from the FMIPv6 and eFPMIPv6 schemes, since these schemes exchange additional signaling messages during the HO execution.

5.2. Twenty-Four-Hour Evaluation Results

In this scenario, the efficiency of the proposed scheme was evaluated during a 24 h simulation. Specifically, the number of HOs and the respective signaling cost were studied. According to the obtained results, the discussed scheme achieved better performance than the other schemes, since it performed fewer HOs, while at the same time, its signaling cost per HO was lower than the ones observed from the other schemes for both inter-MAG and intra-MAG predictive and reactive HOs. Specifically, the proposed scheme performed 372,170 HOs in total. Furthermore, the VAH scheme accomplished acceptable HO counts, which were equal to 533,590, by considering the vehicle’s velocity for the handover process. However, it performed the network selection considering only the strength of the perceived signal, providing worse results than the proposed scheme. The rest of the schemes accomplished HO counts equal to 805,751, since they were based on the perceived RSS per user for the HO initiation process.

Finally, Figure 22 presents the total signaling cost observed for each scheme during the 24 h simulation by taking into consideration the number of HOs that each scheme performed, as well as the respective signaling cost. As shown, the proposed scheme achieved a lower signaling cost for both inter-MAG and intra-MAG predictive and reactive HOs.

6. Conclusions

In this paper, an HO management methodology for 5G vehicular networks was described supporting both predictive and reactive HO scenarios. Four HO subprocesses complemented the system’s functionality, namely the velocity and network monitoring, the HO initiation, the network selection, and the HO execution. The velocity and network monitoring module estimates the velocity of each vehicle and provides the alternative access networks to the HO operation. If the user satisfaction grade becomes less than a predefined threshold, then predictive HO is performed. In such a case, the HO is initiated and network selection is performed. Reactive HO is performed whenever the vehicle unexpectedly loses the connectivity with its serving network. In such a case, network selection is immediately executed. Furthermore, the HO execution phase includes several improvements in the operation of the FPMIPv6 protocol. The proposed scheme was evaluated in a 5G vehicular network architecture, while the performance evaluation showed that it outperformed existing HO schemes, maintaining the user satisfaction at acceptable levels and reducing the HO signaling cost.