A Novel Group Mobility Model for Software Dened Future Mobile Networks

Nowadays, a massive amount of data leads to cause network traffic and inflexible mobility in future mobile networks. A new Group Mobility Model (GMM) named MoMo is introduced that addresses the issue of the aforementioned problems. Even though, software defined network (SDN) is functional with network-rooted mobility protocols that enhance the network efficiency. Some existing network-rooted mobility administration methods still undergo handover delay, packet loss, and high signaling cost through handover processing. In this research work, SDN-based fast handover for GMM is proposed. Here, the neighbor number of evolving node transition probabilities of the mobile node (MN) and their obtainable resource probabilities are estimated. This makes a mathematical framework to decide the preeminent number of the evolving nodes and then allot these to mobile nodes virtually with all associations finished by the exploit of Open-Flow tables. The performance examination demonstrates that the proposed SDN rooted GMM technique has the enhanced performance than the conventional handover process and further technique by handover latency, signaling cost, network throughput, and packet loss.

Ultra dense network, a dense coverage model which supports high bandwidth in future mobile network (5G/6G) [4][5][6]. However, the dense network is not suitably able to perform the handover process using the conventional mobility model. Thus the network is required to change the mobility model to enhance the network performance. This effectiveness not only improves the handover process but also maintains high on-demand resource allocation and better QoS. To improve handover efficiency, mobility model selection plays an essential role in it. A Beam forming concept is a flexible operation meant to increase the available resources usage to sustain QoS [7].
However, the aforementioned technologies such as SDN and ultra-dense network perform data forwarding task with centralized mobility management (CMM), i.e., mobile anchor (MA) for home agent and local mobile anchor (LMA) for network routing respectively [8]. It is a central agent, that serves to sustain MN locations and redirect the traffic to them. CMM approaches handles some obstacles such as low scalability, high overhead, single node failure, etc. The following issue have been resolved using a new paradigm named as Distribution Mobility Management (DMM) [9]. DMM is a distributed through the mobility agent to overcome the single node failure because if a mobility agent is failed to perform their job, then the other mobility agent within the network will take over the job of the failed node. This arrangement is being reduced the mobile data traffic by improving the handover delay, scalability, etc. More investigation was performed to confirm the SDN based DMM technology and it is noted in several literatures [10][11][12].
In a general viewpoint, the mobility model is categorized as individual and group mobility model [13].These two agents are continuously making a handover service to mobile nodes (MN). Group mobility model (GMM) is a mobility pattern described to predict the movement of the mobile node in terms of continuous changeover time such as velocity, location, and acceleration [14]. In this model, each of the mobile nodes moves randomly together within the group using Random Waypoint approach [15] and Reference Point Group Mobility Pattern (RPGP) [16].Both group mobility and individual mobility are used DynnaMo approach which provides a memory related model. The MoMo model combines memory-based individual model and flexible group model which increases the accuracy of the mobility model [17]. In this paper, we proposed software defined network based MoMo model for future mobile network to reduce the handover latency, signaling cost, and packet drop ratio.
The contribution of the proposed SDN based GMM work comprises of:  The proposed model incorporates the mobility management module (MME) and admission control module. The MME includes the evolving node (EN) transition probability estimation and evolving node selection engines which are in the handover preparation phase.  In the handover preparation phase, EN transition is computed for each neighbor node so that EN_ID is updated periodically. Therefore, the estimated EN_ID is transferred to the Open Flow table of the mobile node. If the current EN duration is expired, then automatically the MN node checks the optical flow (OF) table and chooses the next evolving node. The target EN influence OF table and it can find that the respective MN_ID is included in this table, then it will send handover acknowledgement to the MN. This concludes that both EN and MN nodes start preparing access to exchange their messages.  In the handover phase, the grouping of each node is checked periodically based on two condition, namely, free state and forced state process.  Finally, the handover performance such as handover latency, throughput, signaling cost, and packet loss are assessed for the proposed work which shows outperformed efficiency than the exiting GMM technique.
The association of this work is offered as pursues: Section 2 explains the literature review on recent SDN based mobility models. Section 3 describes the working of the proposed SDN based handover technique for future mobile networks. Section 4 portrays the simulation results and discussions. Lastly, section 5 ends the paper chased by the references.

Related Work for Research
Several existing works of mobility model with its issues, improvisation and challenges were discussed in this section.
Chung-Ming Huang et al. [18] presented a Bursty Multi-node Handover using partially DMM (BMH-DMM) which uses a control scheme to tackle the handover problem. The proposed technique applies three procedures, namely, choosing MAAR candidate, handover preparation, and handover phase to simultaneously exchanging the query message to destination. Therefore, the approach uses a set of control schemes to minimize the handover delay and redundant message in Layers 2 and 3.In phase 1, Link_Going_Down (LGD) event is initiated from the set of mobile nodes (MN) which directs their message to MAAR1. After receiving the message, MAAR1 precisely needs to select proper destination among . Thus, MAAR1 derive score value for each by using scoring function. After identified the score function from , MAAR1 establish a handover preparation to MAAR2. Finally, MAAR2 registers the CMD and handover the packet to the destination using a bidirectional tunnel. The benefit of this framework is to reduce the handover delay, packet loss, and signaling bandwidth but suffer from data integrity problem.
Luca Cominardi et al. [19] presented a more realistic network named as SDN with DNN technique. Packet delivery route is being optimized by reconfigured VLAN which shows a lack of scalability. Therefore, a new packet delivery procedure introduced by Sunghong Wei [20] processed through a soft anchor. It becomes more reasonable when combining the SDN technology with hybrid DMM method. Possibly, the approach of SDN based hybrid DMM (S-hDMM) is very effective to minimize high signaling cost. It performs two modes of procedure, namely, initial registration and handover. In registration procedure, the Optical Flow Switch (OFS) start receives the MN's message and forwards to S-hDMM. The controller creates the binding catch entries to update the MN's IP address to the OFS table. After the ended registration, the handover process occurs. Choosing the best anchor is an important factor which reduces packet loss during training. OFS, a soft anchor is the best choice to reconfigure the packet delivery route for higher efficiency.
Battulga, Davaa, sambuu et al. [21] developed a distributed mobility model for selecting a mobility anchor (MA). The paper implemented some factors to select the mobility anchor based on cost function. Handover procedure provides the serving and target cells to transfer context information in which the handover commands return back to the subscriber at the end. Indispensible to note that the respective model is much effective to enhance the load balancing, packet delivery cost, and proper handover procedure but suffer from signaling performance.
Yong-hwan Kim et al. [22] presented a software-designed network (SDN) based on DMM for improving the LTE/EPC network performance. In conventional LTE/EPC networks, improper separation of data and control plane functionality may degrade the handover latency and radio resource allocation in Inter-technology. These issues are being resolved by the proposed architecture in the way of distributing the data plane through the gateway closer to the UEs, a centralized control plane virtually, and by clearly separating the control plane and data plane. The following procedure has to solve the latency problem, but the architecture becomes more complex than the other network because the system is virtually in-built. Another approach of the newly upgraded model named group mobility tolerates a valuable solution to the data exchanging mechanism. Cherry Ye Aung et al. [23] systematically reviewed a GMM by designing an accurate mobile ad hoc network (MANET). In this scenario, the author focuses on the categories of grouping model. Based on the movement of group members, the model is classified into four classes which independently control the location of an adjacent regions while moving. The review paper explains the movement of each group and their design features. Vehicular cognitive radio node is an application oriented task utilized to make secure communication based on group mobility management (GMM) and is developed by Mani Shekhar Gupta et al. [24]. Potentially, the model chooses an improved network resource to achieve high throughput. Nevertheless, the network occupies congestion while performing mobility.

Proposed Methodology
With the elevated challenging and the rising of mobile users (MU), the mobile network undergoes several issues such as handover (HO), data traffic, network routing, reliability, scalability, network signaling etc. To gather the inclination of increasing MUs, a novel group-based mobility management method is proposed to resolve the most challenging HO issue. Here, the particulars of the proposed SDN-based Fast HO control technique for GMM (SDN-GMM) are presented. A novel Group based mobility management (GMM) method, named MoMo is proposed by utilizing distributed mobility management (DMM). Different from the existing methods, the backward fast HO method is employed, which permits SDN to have an elevated possibility to end the HO training processing prior to detaching from the present sub-network, to diminish the packet loss rate and HO latency. The proposed novel GMM has three phases of operation namely Initial Phase, HO Preparation phase and HO Phase.

Initial Phase
The MN is still associated with previous access points (AP) that detect the next AP. It established a signal strength which is advanced than the predefined threshold and is the uppermost one amid the sensed APs; then simultaneously the MNS threw the report message enclosing the next AP information to the initial one.

3.2Handover Preparation phase
This phase comprises of two modules such as the mobility management module and admission control module. This phase administers the dummy small cells and MNs in the data plane for mobility management. Furthermore, the mobility management entity (MME) is made to handle the HO procedure. In this way, the required mobility related data, for instance, the MN subscription data, mobile identification, and tackling trail area posts are attained. The mobile node id (MN_ID) and Evolving Node id (EN_ID) parameters are employed for MNs and small cells [25].In the proposed SDN -GMM, MoMo model, the number of evolving nodes in the network contains a hexagonal architecture. This utilizes the automatic neighbor relation (ANR) function of evolving node count by which the neighbor relation tables are updated. Accordingly, the proposed SDN-GMM MoMo model reaches the valid neighbor relations of the evolving new nodes from these tables. Figure 1 demonstrates the proposed network architecture.
After calculating the transition possibilities for the neighbor evolving nodes, an obtainable resource probability of these neighbor evolving nodes are projected. According to the outcomes of this procedure, the next evolving node are estimated and allotted virtually to the MN before the movement. Thus, the predicted EN_ID is moved to the Open Flow (OF) table of the MN. Moreover, the time for this evolving node is computed and given to the value OF table of the MN. Every aforesaid method is performed for all evolving nodes situated on the MN movement path.
If the time of the present evolving node closes, then MN views OF table to estimate the next evolving node. Accordingly, as revealed in Fig. 1, the MN propels a HO appeal to the identified target evolving node. The contact amid the MN and target evolving nodes is performed on the random access channel (RACH). In future mobile networks, the RACH is utilized by MN to start the session with an arbitrary access preamble throughout the primary movement of the connect process. In addition, this preamble comprises the MN_ID. Next, goal evolving node manages OF table to discover this arriving MN_ID. If this MN_ID is integrated in the table, HO response is given to the MN. This response specifies that the HO appeal is established by the evolving node. Then the connect process continues amid the MN and evolving nodes with the equivalent message series as downlink shared channel (DL-SCH), uplink shared channel (UL-SCH). Here, the delays observed in the HO training stage are investigated. If the MN_ID is not identified, this request is transferred to the controller. The controller updates the set OF tables accordingly.

Handover Phase
The HO phase is followed by the HO preparation phase. This phase describes the connectivity steps of the nodes in the SDN based intelligent future network. The proposed SDN-GMM based MoMo model defines the binding conditions related tophysical proximity between the nodes. The binding condition between two nodes namely i and j are in same group, are referred to as group mates, and is defined as in (1) ≤ (1) Where, = is the distance among nodes and . Ifthe binding condition in Eq. (1) is satisfied, the two nodes are said to be distance connected. Consider a group of size M. For the generic node the set of group mates that the node detects as connected is called its connected set. The ratio between and the total number M of group mates is called grouping factor in (2) : The behavior of node depends on the grouping condition (GC) defined on in (3): where the grouping threshold is a tunable model parameter. Every node occasionally verifies whether the GC is satisfied, with period ∇ based on the result, the node penetrates in anyone of the two subsequent states like free and forced:  Free State occurs when the GC is satisfied. Here the node freely moves based on the boundless mobility model;  Forced state occurs when the GC is not satisfied. Here the node travels towards the closest group mate, k, is not part of its connected set, to improve its grouping factor. The speed variables and are set as in (4)   In Fig 2 a), the measured node (black node) is linked to three striped nodes in its collection, out of its 7 group mates, and the grouping factor = 3/7 calculated by the node is lesser than the necessary . As a result, the node goes in forced mode and travels towards the nearby group mate among its connected set. The node preserves this behavior until the GCis is satisfied, evolving towards the situation in 2. b), where the range of the connected set is increased to 4, corresponding to ≥ .
The behavior defined in the forced mode, that is, moving towards the closest group mate not in the connected set, is not the only possible one. More complex behaviors, e.g., moving towards the centroid of the points of group mates, can be easily established in the framework of the proposed SDN -GMM MoMo model.  connectivity related to radio communications -here two nodes are associated either during a straight radio connection (physical layer associativity), while they are in the radio range, or during conveying, assured by additional group mates (network associativity);  Connectivity is rooted on a radio-independent constraint -for instance, if a collection will become a security team, material visibility may correspond to association: a team member will go freely until it is capable to view a minimum count of team members, and travels nearer to the extra members of the team when the circumstance is not met any longer.

Simulation Results and Discussions
In this section, the HO presentation is evaluated with the proposed SDN-GMM model and estimates performance metrics including signaling cost, average HO latency, and packet loss rate. The simulation result of the proposed method is estimated by using NS-3 network simulator version 3.26. It is a discrete-event network simulator using the Open Flow module. By using it, the HO process working is verified. The simulation environment comprises of four sorts of network essentials with 50 MUs, 10 routers that manage 10 APs, 10 corresponding nodes, and 802.11n infrastructure. The simulation is continuously performed for 30 times to discover the regular outcomes.

Signaling cost
The signaling cost is described as the HO mobility binding update overhead acquired throughout the HO processing. Hence, the signaling message delivery cost of the mobility management protocol is reliant on the result of the count of network hops, the dimension of a signaling message, and the weighting aspect in a wired and wireless network. In the proposed SDN-GMM method, the worldwide assessment allows SDN Controller to gain the agent router and manage signaling messages in MNs' HO processing. The MME and the MODULE are termed to hold mobility administration and handle MNs' registrations for having the GMM service. Thus, the signaling cost of the SDN-GMM technique is articulated as in (6) = Where h and ρ are wired and wireless link's weight factor, µ is the arrival rate of each MN via router,Linform refers to the dimension of handover message,Lhi and Lhacks indicates the dimension of HI and Hack message respectively, hop specifies the connection between two nodes.
An advantage of the proposed SDN-GMM process is the decrease of the control packets for MN's andover processing. Figures 3 and 4portray

Handover latency
The further metric for mobility management protocols is HO latency. The HO latency is described as the delay from the time when MN begins the HO process to the time when it accepts the first packet from its novel mobility router. The delay time is required to drive a packet over wired and wireless links and it contains propagation time, transmission delay, and queuing delay. The HO delay relies on the hop-count distance from the source to the destination. It is tacit that the wired links are steady and reliable. Then, the delay time of a packet of size p sent from u to v is represented as in (7): , hop count, and are the average manage message volume, propagation latency, hop distance connectivity, the accessible bandwidth, and the average queuing delay at every router in wired links.
From Fig. 6, the proposed SDN-GMM method achieves 25, 34,54, 75, and 102 handover latency (ms) for average queuing delay time 10ms, 20ms, 30ms, 40ms and 50ms respectively. It is clear that the average queuing delay at each router is amplified through the HO latency of the proposed SDN-GMM method which is lower than that of the traditional handover techniques.

Throughput
Throughput ( ℎ ) is described as the whole volume of transmitted data packets in a session, which is * over the session delivery time and is formulated in (8).
is the average count of transmitted packets in a session, is the average packet size from a corresponding node to MNs, and is the packet-to-packet gap time.
− is packet delivery time for transmitting packets. PDT is the packet delivery time from the corresponding node to MNs, which is calculated as the total delay time of transmitted packets given in formula (8).
− − is calculated as the ratio among the HO μ and the average session coming charge .

Packet loss
When MN performs handover, it observes whether the packet loss can affect the HO procedure. MN's packet loss rate is proportional to either HO delay or session arrival rate  in unit of packet per second. Let Sad be the average count of delivered data packets during a session. Then, the packet loss rates of the use of the proposed SDN-GMM HO method are calculated in (9) Fig. 8, when the HO rate is improved from 0.12 to 0.28, the count of missing packets by the proposed method is partly of that of that by the existing processes. It is experimentally proved that the total of lost packets by the proposed technique is smaller than that of the traditional techniques when the HO rate is improved. It is for the reason that the proposed SDN-GMM technique has the inferior HO latency time than the existing HO techniques and the momentary preestablished tunnel, which can be detached when all on-the-fly packets have been promoted to MN.

Conclusion
In this work, an improved handover organized method for SDN -based fast handover for Group Mobility Model is proposed. The major contribution of the proposed SDN-GMM method are to allow MN be proficient to earlier finish the HO training processing and to attach to a new mobile router before MN disconnecting to the preceding mobile router. The packet loss of the proposed SDN-GMM method is condensed as of less HO latency than the existing GMM method and the handling of the temporarily established bidirectional tunnel, which can be detached when all on-the-fly packets have been forwarded. To prove the proposed method, it is compared with the traditional handover techniques over the NS-3 simulation environment. In future, the proposed SDN-GMM method can be practical in the vehicular setting. Figure 1 The proposed network architecture   Handover signaling cost versus radius of cells Throughput versus count of packets in a session Packet loss versus mobility rate