<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN" "JATS-journalpublishing1-4.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.4" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">cn</journal-id>
      <journal-title-group>
        <journal-title>Communications and Network</journal-title>
      </journal-title-group>
      <issn pub-type="epub">1947-3826</issn>
      <issn pub-type="ppub">1949-2421</issn>
      <publisher>
        <publisher-name>Scientific Research Publishing</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.4236/cn.2026.181002</article-id>
      <article-id pub-id-type="publisher-id">cn-148460</article-id>
      <article-categories>
        <subj-group>
          <subject>Article</subject>
        </subj-group>
        <subj-group>
          <subject>Computer Science</subject>
          <subject>Communications</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Open Flow Controller Architecture for Seamless Connectivity and Virtualization Technologies</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Nicola</surname>
            <given-names>Anas A.</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="aff1"><label>1</label> Faculty of Telecommunication, Engineering and Space Technology, Future University, Khartoum, Republic of the Sudan </aff>
      <author-notes>
        <fn fn-type="conflict" id="fn-conflict">
          <p>The author declares no conflicts of interest regarding the publication of this paper.</p>
        </fn>
      </author-notes>
      <pub-date pub-type="epub">
        <day>10</day>
        <month>12</month>
        <year>2025</year>
      </pub-date>
      <pub-date pub-type="collection">
        <month>12</month>
        <year>2025</year>
      </pub-date>
      <volume>18</volume>
      <issue>01</issue>
      <fpage>10</fpage>
      <lpage>32</lpage>
      <history>
        <date date-type="received">
          <day>25</day>
          <month>10</month>
          <year>2025</year>
        </date>
        <date date-type="accepted">
          <day>27</day>
          <month>12</month>
          <year>2025</year>
        </date>
        <date date-type="published">
          <day>30</day>
          <month>12</month>
          <year>2025</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>© 2026 by the authors and Scientific Research Publishing Inc.</copyright-statement>
        <copyright-year>2026</copyright-year>
        <license license-type="open-access">
          <license-p> This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link> ). </license-p>
        </license>
      </permissions>
      <self-uri content-type="doi" xlink:href="https://doi.org/10.4236/cn.2026.181002">https://doi.org/10.4236/cn.2026.181002</self-uri>
      <abstract>
        <p>The study aims to provide insights into the benefits and potential risks associated with its adoption. The findings will be valuable for organizations considering transitioning to SDN, offering guidance on how to effectively leverage this technology while addressing the challenges that may emerge during implementation. Furthermore, we detail the proposed control architectures, showing how the peculiar characteristics (and related goals). In the architecture design, we point out hybrid Control Architectures as a notable trend in SDN solutions targeting Wireless Scenarios. The Researcher provides his idea on the Open Flow Control diagram (OFC), managing heterogeneous networks and hybrid connection networks for seamless connectivity. It has become very complex and hard to manage due to upgrade and interoperability challenges. Software-Defined Network (SDN) addresses this problem by decoupling virtual resources from the physical resources. The goal of our research is to offer distributed Management Systems that can help with orchestration, dynamically partition access points and cell radios. Also, the work explores new approaches to controllers’ Virtual Connectivity within complex and hybrid infrastructure network technologies, in order to overcome the shortcomings of the current infrastructure. The proposed algorithm is arranged to cover all requirements for seamless positioning in future wireless networks.</p>
      </abstract>
      <kwd-group kwd-group-type="author-generated" xml:lang="en">
        <kwd>Networks and Communication</kwd>
        <kwd>Network Architecture</kwd>
        <kwd>Seamless Connectivity</kwd>
        <kwd>Software-Defined Networks</kwd>
        <kwd>Network Control</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
      <title>1. Introduction</title>
      <p>The coexistence of SDN and traditional networks may lead to compatibility issues, requiring custom solutions or middleware. Software-Defined Networking (SDN) represents a transformative shift in how networks are designed, managed, and optimized [<xref ref-type="bibr" rid="B1">1</xref>]. The IEEE 802.21 Standard for media independent handover (MIH) has been adopted in this research to provide a unified framework for the interworking of the heterogeneous networks. The architecture of our proposals is provided in <xref ref-type="fig" rid="fig4">Figure 4</xref>. The figure represents the target network architecture for the interworking of wireless networks such as WLAN, WIMAX, UMTS, and satellite networks. In the architecture, it is assumed that the mobile node supports multiple interfaces and can use any network when it is available. This is important for a mobile node roaming into other networks, to have seamless mobility across different networks. In this area, we provide different levels of solutions [<xref ref-type="bibr" rid="B2">2</xref>][<xref ref-type="bibr" rid="B3">3</xref>]. The general solution is mainly featured in the system architecture as the global solution at present for the seamless connectivity problem: soft Open Flow Hybrid Network Controller (OFHNC) [<xref ref-type="bibr" rid="B4">4</xref>][<xref ref-type="bibr" rid="B5">5</xref>]. SDN has come to light in recent years. However, the concept of this approach has been evolving since the mid-90s. Ethane [<xref ref-type="bibr" rid="B6">6</xref>] (management architecture) and OpenFlow [<xref ref-type="bibr" rid="B7">7</xref>] (protocol for network flow) have given birth to a real implementation of SDN. OpenFlow is standardized by the Open Networking Foundation (ONF) [<xref ref-type="bibr" rid="B8">8</xref>]. There are other similar existing southbound interfaces, such as the Forwarding and Control Element Separation (CES) [<xref ref-type="bibr" rid="B9">9</xref>][<xref ref-type="bibr" rid="B10">10</xref>] standardized by the Internet Engineering Task Force (IETF), Path Computation Element (PCE) [<xref ref-type="bibr" rid="B11">11</xref>], the Locator/ID Separation Protocol (LISP) [<xref ref-type="bibr" rid="B12">12</xref>], and Soft Router [<xref ref-type="bibr" rid="B13">13</xref>], pose important challenges for service providers [<xref ref-type="bibr" rid="B14">14</xref>]. With the rapid growth of the clients’ demands, the operator is required to respond accordingly by considering additional servers, network components, high quality of service and secure architecture [<xref ref-type="bibr" rid="B15">15</xref>], abiding by the standards. In particular, the challenges and issues appear to be of paramount importance in the SDN environment.</p>
    </sec>
    <sec id="sec2">
      <title>2. Background and Motivation</title>
      <p>Researchers in this article present an efficient mobility-based proactive caching simplified model for addressing a distributed solution that targets less popular, personalized, or dynamic content requests by prefetching data in small cells based on aggregated user mobility prediction information [<xref ref-type="bibr" rid="B16">16</xref>]. Another important problem dimension regards service charges [<xref ref-type="bibr" rid="B17">17</xref>][<xref ref-type="bibr" rid="B18">18</xref>]. Users can become very unhappy with charging mechanisms that aim to control demand peaks. In a more recent study in [<xref ref-type="bibr" rid="B19">19</xref>], the authors show that a large portion of web traffic is dynamically generated and per-data located in the field of connectivity perspective. In addition, the rest of proactive solutions use mathematical solutions to optimize prospective results, approximation for the non-tractable distribution of “content placement” [<xref ref-type="bibr" rid="B20">20</xref>], which is also recognized in [<xref ref-type="bibr" rid="B21">21</xref>]. These solutions are centralized, mobility, or employ a static adaptation of popular temporal locality, even the work in [<xref ref-type="bibr" rid="B22">22</xref>] that does consider mobility. The rest of this report discusses and explains the different approaches and proposes several variations of a new model that uses contextual information [<xref ref-type="bibr" rid="B23">23</xref>]-[<xref ref-type="bibr" rid="B25">25</xref>]. Furthermore, Seamless Mobility and roaming are essential features of today’s networks and can be attained by a handoff mechanism in wireless networks. In addition, handover represents an essential process of maintaining users in an active session when the mobile terminal changes its point of attachment [<xref ref-type="bibr" rid="B26">26</xref>]. Currently, a mobile user has multiple interfaces and can access a wide range of applications provided by multiple wireless networks. Therefore, to achieve this goal and select the best network, it is necessary to have a good decision-making Strategy for a specific application [<xref ref-type="bibr" rid="B27">27</xref>][<xref ref-type="bibr" rid="B28">28</xref>].</p>
      <p>A simple prediction model uses a person’s location preferences (a history of her previously visited locations) [<xref ref-type="bibr" rid="B29">29</xref>]. Population mobility models are introduced, and their practical applicability is demonstrated. In particular, techniques that focus on the detection of incorrect human mobility predictions are analyzed. Among these techniques, an ensemble learning algorithm, called LOTUS, is designed and evaluated. Different hierarchical approaches are further defined, and their performance is evaluated. Ekman <italic>et al</italic>. create a composition of different mobility models that describe the daily life of an individual [<xref ref-type="bibr" rid="B30">30</xref>][<xref ref-type="bibr" rid="B31">31</xref>]. Their model includes home activity, office activity, evening activity, and transport sub_models that address the mobility differences of individuals over a day. Similarly, Nguyen <italic>et al</italic>. propose, instead of using one predictor for different human mobility prediction tasks [<xref ref-type="bibr" rid="B32">32</xref>][<xref ref-type="bibr" rid="B33">33</xref>], providing an architecture and methods for a seamless experience across a user’s multiple environments. Passive components for multiple communication channels are also considered. Lei <italic>et al</italic>. proposed the creation of community networks [<xref ref-type="bibr" rid="B34">34</xref>]. In this scenario, a service provider such as a hospital is responsible for providing a service in a specific region.</p>
    </sec>
    <sec id="sec3">
      <title>3. Proposed System Architecture</title>
      <sec id="sec3dot1">
        <title>3.1. Connectivity Management</title>
        <p>The extreme heterogeneity existing today means that the problem of mobility management has now become more complex. In fact, the fact that a handover procedure is not directly related to physical parameters like coverage and movement speed has as a consequence that mobility has now become a logical concept rather than a physical one. This means that today, mobility refers not only to the user’s geographic position but also to the change of a logical location with respect to network access points. The target in this case is to come to an optimal global decision with reference to a set of local and distributed requirements such as: Vertical handover decision modeling and handover triggering. As stated above, the vertical handover further consists of three main parts, <italic>i.e.</italic>, handover triggering/initiation, network selection, and handover triggering, referring to a phenomenon of initiating handover at the appropriate location. <xref ref-type="fig" rid="fig1">Figure 1</xref> shows the main idea of handover transaction triggering (too early, too late, and wrong cell handover [<xref ref-type="bibr" rid="B35">35</xref>]. The decision user’s selection process in a heterogeneous network becomes harder, because there are different characteristics provided by different networks, such as resource reservation area. Almost all schemes are based on multiple parameters from different networks to fix this problem, focusing on proposing heuristic algorithms that simplify the risks that occur through connectivity.</p>
        <fig id="fig1">
          <label>Figure 1</label>
          <graphic xlink:href="https://html.scirp.org/file/6102077-rId17.jpeg?20251230105301" />
        </fig>
        <p><bold>Figure 1</bold><bold>.</bold> Problems in RSS-based handover triggering.</p>
        <p>There are various parameters used to trigger a handover. The MN periodically checks the value of these parameters and compares them with a predefined threshold. If the value of the parameter drops below a pre-defined threshold, then the MN initiates the handover process. Various traditional handover approaches are based on the RSS value of the current network. The MN periodically checks the RSS level of the current AP/BS; if it drops below a certain predefined threshold, the MN initiates the handover. However, calculating and finding the exact location for triggering a handover process is a challenging task, because the time between the handover triggering and execution is very short [<xref ref-type="bibr" rid="B36">36</xref>][<xref ref-type="bibr" rid="B37">37</xref>].</p>
      </sec>
      <sec id="sec3dot2">
        <title>3.2. Issue in Hand-Off</title>
        <p>We suppose that when an MT starts moving, crossing the boundary area from the start point to end point, the mobile client requires the information about the foreign networks for choosing the strongest signals at all times. The decision is based on an average measurement of the received signal. Relative signal strength with hysteresis and threshold hands a user over to a new base only if the current signal level drops below a threshold and the target base station is stronger than the current one by a given hysteresis margin. A rapid decrease in received signal strength may cause the call to drop, and this cannot be supported by handoff algorithms. The nature of the decaying signal can be determined by the slope or tangent of the angle subtended by the two corresponding points on the signal line with respect to two axes. Slope ratio (<italic>S</italic><italic><sub>r</sub></italic>) can be defined as the ratio between normal and actual signals, and depicted in <xref ref-type="fig" rid="fig2">Figure 2</xref> [<xref ref-type="bibr" rid="B38">38</xref>][<xref ref-type="bibr" rid="B39">39</xref>].</p>
        <p>From the geometry of the figure, slope of the normal signal can be represented as</p>
        <disp-formula id="FD1">
          <mml:math display="inline">
            <mml:mrow>
              <mml:mi mathvariant="normal">Tan</mml:mi>
              <mml:msub>
                <mml:mi>θ</mml:mi>
                <mml:mn>2</mml:mn>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mi>Δ</mml:mi>
                  <mml:mtext>RSS</mml:mtext>
                </mml:mrow>
                <mml:mrow>
                  <mml:mi>Δ</mml:mi>
                  <mml:msub>
                    <mml:mi>S</mml:mi>
                    <mml:mn>2</mml:mn>
                  </mml:msub>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Hence, the slope ratio of the normal to actual signal can be represented as</p>
        <disp-formula id="FD2">
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mi>S</mml:mi>
                <mml:mi>r</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mi>tan</mml:mi>
                  <mml:msub>
                    <mml:mi>θ</mml:mi>
                    <mml:mn>1</mml:mn>
                  </mml:msub>
                </mml:mrow>
                <mml:mrow>
                  <mml:mi>tan</mml:mi>
                  <mml:msub>
                    <mml:mi>θ</mml:mi>
                    <mml:mn>2</mml:mn>
                  </mml:msub>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>For different values of <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> θ </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> θ </mml:mi><mml:mn> 2 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> , various values of <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> S </mml:mi><mml:mi> r </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are obtained. But for handoff to take place, <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> θ </mml:mi><mml:mn> 2 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> must always be greater than <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> θ </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> .</p>
      </sec>
      <sec id="sec3dot3">
        <title>3.3. Case Study</title>
        <p><xref ref-type="fig" rid="fig3">Figure 3</xref> provides a case study for seamless connectivity demand. Given the diversity of network applications running on mobile devices, knowledgeable network resource planning and operation is needed, in turn calling for a framework that allows users and their applications to access patterns aimed at maximizing resource usage and increasing user satisfaction. In this case study, users need to be aware of available access networks and to choose the one they want to connect with, based on very rudimentary information such as signal quality. If MNs can collect timely and consistent information about the state of all available networks in range and control their network connectivity, then a whole range of possibilities</p>
        <fig id="fig2">
          <label>Figure 2</label>
          <graphic xlink:href="https://html.scirp.org/file/6102077-rId32.jpeg?20251230105303" />
        </fig>
        <p><bold>Figure 2.</bold> Slope of actual signal and expected signal.</p>
        <fig id="fig3">
          <label>Figure 3</label>
          <graphic xlink:href="https://html.scirp.org/file/6102077-rId33.jpeg?20251230105303" />
        </fig>
        <p><bold>Figure 3.</bold> Example scenario with a heterogeneous overlapping wireless network.</p>
        <p>would become available. Operators who can switch a user’s session from one access technology to another could better manage their networks and better accommodate the service requirements of their users [<xref ref-type="bibr" rid="B40">40</xref>].</p>
      </sec>
    </sec>
    <sec id="sec4">
      <title>4. System Architecture</title>
      <p>The proposed architecture provides four sectors, represented in different parts. The first part is a network side or terminal side, and the second part is the open follow hybrid core, the third part is satellite system, and finally, the last part presents monitoring surveys to different parts of the global network systems equipped to observe the capital area. On the network side, the controller supports network systems of each side, monitoring, such as location information and user profiles. Furthermore, in the open follow hybrid core, the highest network connectivity should be more flexible and offer seamless connectivity between recognized domains, which enables the satellite in the third coverage to extend to each other. The main purpose of the monitoring area is to obtain optimal observation of all transactions between any MT connection in different situations, static or dynamic. Nevertheless, the efficiency of the whole part should use appropriate radio technologies through which service can be obtained as much as possible. Thus, both the network and terminal contribute useful information that should be combined to provide efficiency of QoS in order to facilitate MT in making an optimal decision. <xref ref-type="fig" rid="fig4">Figure 4</xref> explains the target architecture network developed from the source [<xref ref-type="bibr" rid="B41">41</xref>][<xref ref-type="bibr" rid="B42">42</xref>].</p>
      <p>In addition, see <xref ref-type="fig" rid="fig4">Figure 4</xref>, the architecture applied, offering the capability of scaling network resources in lockstep with application and data needs. Software-defined network (SDN) facilitates organizations in deploying applications and enables flexible delivery. The Open Flow Controller (OFC), based on SDN, is designed with a standard interface for the SDN controller to allow programming of forwarding tables, network element registration, and maintenance. Improving network availability provides better control and performance. Some switches support compatibility issues with the controller. The OpenFlow specification defines the protocol that enables the controller to command switches and routers. However, the architecture is referred to as the OpenFlow model control. Permits network operators to set flow rules, which are essential for network management, by breaking the coupling between network control and global visibility. It helps to reduce internal communication between the control and data planes.</p>
      <sec id="sec4dot1">
        <title>4.1. Network Virtualization</title>
        <p>Network virtualization and open flow controller, see <xref ref-type="fig" rid="fig5">Figure 5</xref> &amp; <xref ref-type="fig" rid="fig6">Figure 6</xref>, allow multiple networks with different characteristics and functions to operate over the same physical network. The reliable transmission of high-priority data can be achieved by centrally managing the communication quality of multiple wireless and wired networks by dynamically selecting the appropriate routing. The virtualization technology copes with network congestion caused by a heavy traffic load </p>
        <fig id="fig4">
          <label>Figure 4</label>
          <graphic xlink:href="https://html.scirp.org/file/6102077-rId34.jpeg?20251230105306" />
        </fig>
        <p><bold>Figure 4</bold><bold>.</bold> Target network architecture.</p>
        <p>in a particular part of the network by connecting automatically to other types of networks, thereby increasing the potential for services to continue operating [<xref ref-type="bibr" rid="B43">43</xref>].</p>
        <p>The following figure represents the accessories of the home network (core network). The objective of this case is to propose a solution for automatic management of the future, through the use of virtualization as well as automatic service deployment and network reconfiguration using an automatic service virtual plan (VP).</p>
      </sec>
      <sec id="sec4dot2">
        <title>4.2. Open Flow Controller</title>
        <p>Managing heterogeneous networks has become very complex and difficult to </p>
        <fig id="fig5">
          <label>Figure 5</label>
          <graphic xlink:href="https://html.scirp.org/file/6102077-rId35.jpeg?20251230105307" />
        </fig>
        <p><bold>Figure 5.</bold> Network virtualization technologies.</p>
        <p>manage due to upgrade and interoperability challenges. Software defines networks (SDN); address this problem by decoupling virtual resources from physical resources, abstracting control planes and data forwarding planes, and automating network management while enabling centralized orchestration. This offers network scalability and expansion. Adding SDN networks to the existing networks can provide scalable LAN segmentation to effectively manage cloud infrastructure environments. In addition, SDN can also enable much shorter development times and easier management of the network through the utilization of common, general-purpose hardware, while providing a holistic way of managing and controlling the network [<xref ref-type="bibr" rid="B44">44</xref>].</p>
        <p>In the case of the present SDN OpenFlow controller, another important challenge that needs to be addressed is the communication latency and load between the SDN controller and the switches. If the network has one centralized controller, then all connection setup requests, as well as exception traffic, are forwarded to the controller. This increases the load on the controller significantly, and the resulting latency caused by the communication may be unacceptable for latency-sensitive applications. Furthermore, our goal is to develop a flow approach that harnesses local intelligence to scale traffic flow. The SDN solution also addresses network management challenges, supporting fast, seamless voice, data, and video transition from 3G/4G networks to Wi-Fi networks.</p>
        <fig id="fig6">
          <label>Figure 6</label>
          <graphic xlink:href="https://html.scirp.org/file/6102077-rId36.jpeg?20251230105308" />
        </fig>
        <p><bold>Figure 6.</bold> Open flow controller contains.</p>
        <p><xref ref-type="fig" rid="fig7">Figure 7</xref> refers to the transparent transition between multiple Radio Access Technologies (RATs), which is usually referred to as vertical handover (VHO). Where the signal is distorted due to physical phenomena, it is necessary to characterize the channel. It was previously mentioned that it is clear that the environment will be different for different locations of the transmitter and receiver [<xref ref-type="bibr" rid="B44">44</xref>]-[<xref ref-type="bibr" rid="B48">48</xref>].</p>
        <fig id="fig7">
          <label>Figure 7</label>
          <graphic xlink:href="https://html.scirp.org/file/6102077-rId37.jpeg?20251230105308" />
        </fig>
        <p><bold>Figure 7.</bold> Hotspot scenarios.</p>
        <disp-formula id="FD3">
          <label>(1)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mtext>RSS</mml:mtext>
              <mml:mrow>
                <mml:mo>[</mml:mo>
                <mml:mi>k</mml:mi>
                <mml:mo>]</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mn>1</mml:mn>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>W</mml:mi>
                    <mml:mrow>
                      <mml:mi>a</mml:mi>
                      <mml:mi>v</mml:mi>
                    </mml:mrow>
                  </mml:msub>
                </mml:mrow>
              </mml:mfrac>
              <mml:mstyle displaystyle="true">
                <mml:munderover>
                  <mml:mo>∑</mml:mo>
                  <mml:mrow>
                    <mml:mi>i</mml:mi>
                    <mml:mo>=</mml:mo>
                    <mml:mn>0</mml:mn>
                  </mml:mrow>
                  <mml:mrow>
                    <mml:msub>
                      <mml:mi>W</mml:mi>
                      <mml:mrow>
                        <mml:mi>a</mml:mi>
                        <mml:mi>v</mml:mi>
                      </mml:mrow>
                    </mml:msub>
                    <mml:mo>−</mml:mo>
                    <mml:mn>1</mml:mn>
                  </mml:mrow>
                </mml:munderover>
                <mml:mrow>
                  <mml:mtext>RSS</mml:mtext>
                  <mml:mrow>
                    <mml:mo>[</mml:mo>
                    <mml:mrow>
                      <mml:mi>k</mml:mi>
                      <mml:mo>−</mml:mo>
                      <mml:mi>i</mml:mi>
                    </mml:mrow>
                    <mml:mo>]</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:mstyle>
              <mml:mrow>
                <mml:mo>[</mml:mo>
                <mml:mrow>
                  <mml:mi>k</mml:mi>
                  <mml:mo>+</mml:mo>
                  <mml:mi>i</mml:mi>
                </mml:mrow>
                <mml:mo>]</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>The RSS[<italic>k</italic>] is represented by calculating the average of the single strength at time instant <italic>k</italic>, and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> W </mml:mi><mml:mrow><mml:mi> a </mml:mi><mml:mi> v </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the window size of the variable that changes with the velocity of the mobile terminal. The lifetime metric EL[<italic>k</italic>], represented by <inline-formula><mml:math display="inline"><mml:mrow><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:mi> k </mml:mi><mml:mo> − </mml:mo><mml:mi> i </mml:mi></mml:mrow><mml:mo> ] </mml:mo></mml:mrow><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:mi> k </mml:mi><mml:mo> + </mml:mo><mml:mi> i </mml:mi></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> estimation of <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> i </mml:mi><mml:mo> = </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> , the RSS change rate <italic>S</italic>[<italic>k</italic>], and a parameter called Application Single Strength Threshold (ASST) are as follows.</p>
        <disp-formula id="FD4">
          <label>(2)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mtext>EL</mml:mtext>
              <mml:mrow>
                <mml:mo>[</mml:mo>
                <mml:mi>k</mml:mi>
                <mml:mo>]</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mtext>RSS</mml:mtext>
                  <mml:mrow>
                    <mml:mo>[</mml:mo>
                    <mml:mi>k</mml:mi>
                    <mml:mo>]</mml:mo>
                  </mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mtext>ASST</mml:mtext>
                </mml:mrow>
                <mml:mrow>
                  <mml:mi>S</mml:mi>
                  <mml:mrow>
                    <mml:mo>[</mml:mo>
                    <mml:mi>k</mml:mi>
                    <mml:mo>]</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:mfrac>
              <mml:mo>⋅</mml:mo>
              <mml:msup>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mrow>
                          <mml:mfrac>
                            <mml:mn>1</mml:mn>
                            <mml:mrow>
                              <mml:mtext>RSS</mml:mtext>
                              <mml:mrow>
                                <mml:mo>[</mml:mo>
                                <mml:mi>k</mml:mi>
                                <mml:mo>]</mml:mo>
                              </mml:mrow>
                              <mml:mo>−</mml:mo>
                              <mml:mtext>ASST</mml:mtext>
                            </mml:mrow>
                          </mml:mfrac>
                        </mml:mrow>
                        <mml:mo>/</mml:mo>
                        <mml:mrow>
                          <mml:mi>S</mml:mi>
                          <mml:mrow>
                            <mml:mo>[</mml:mo>
                            <mml:mi>k</mml:mi>
                            <mml:mo>]</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mrow>
                  <mml:msubsup>
                    <mml:mrow>
                    </mml:mrow>
                    <mml:mn>2</mml:mn>
                    <mml:mn>1</mml:mn>
                  </mml:msubsup>
                </mml:mrow>
              </mml:msup>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>The RSS indicator rate <italic>S</italic>[<italic>k</italic>] varies with the window size of the slope estimator and the RSS sampling interval. ASST is an application-dependent parameter that represents a composite of the channel bit error rate and application QoS requirements. In the scenario, when the mobile terminal moves towards a WLAN cell, the handover is triggered, if the signal strength between the mobile terminal and the point of attachment is in the available bandwidth of the required bandwidth by the application. Then the process of imitation depends on intersection midpoint algorithm of intersection midpoint and flowchart proposed flowchart algorithm; see <xref ref-type="fig" rid="fig8">Figure 8</xref>.</p>
        <p>In this scenario, the radio network analysis algorithms evaluated signal strength and network performance, and calculated the quality of service of the area by dividing users into groups; this technique uses a priority queue searching counter. Additionally, user demand estimates from traffic database are used to calculate the network performance; see the flowchart algorithm proposed for the arrangement of RSS triggering handover, see <xref ref-type="fig" rid="fig9">Figure 9</xref>.</p>
        <p>In Addition, mobility characteristics may cause a service on MS to migrate between different Data Centers (DCs); otherwise, the geographical distance between MS and the DC leads to delays in packet transmission between the sender and receiver, resulting in interrupted service when the MT moves from one position to another position [<xref ref-type="bibr" rid="B49">49</xref>]. In this section, to offer a seamless service migration framework as mentioned above, we consider the network topology shown in <xref ref-type="fig" rid="fig4">Figure 4</xref>, including a private controller device that can be an independent entity, or software embedded into DCs. A simple formula can be computed as:</p>
        <fig id="fig8">
          <label>Figure 8</label>
          <graphic xlink:href="https://html.scirp.org/file/6102077-rId48.jpeg?20251230105308" />
        </fig>
        <p><bold>Figure 8.</bold> Proposed algorithm—handover initiation process.</p>
        <p><inline-formula><mml:math display="inline"><mml:mrow><mml:mi> θ </mml:mi><mml:mo> = </mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> y </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow><mml:mtext> T </mml:mtext></mml:msup><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> i </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:mi> m </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> As the coordinate of the RN, (known) <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> Φ </mml:mi><mml:mo> = </mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mi> j </mml:mi></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> Y </mml:mi><mml:mi> j </mml:mi></mml:msub></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow><mml:mtext> T </mml:mtext></mml:msup><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> j </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:mi> N </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> . The distance between <inline-formula><mml:math display="inline"><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> i </mml:mi><mml:mo> , </mml:mo><mml:mi> j </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is represented by <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> R </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mo> , </mml:mo><mml:mi> j </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> , and <italic>R</italic> is the distance denoted by</p>
        <disp-formula id="FD5">
          <label>(3)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mi>R</mml:mi>
                <mml:mrow>
                  <mml:mi>i</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>j</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msqrt>
                <mml:mrow>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>x</mml:mi>
                            <mml:mi>i</mml:mi>
                          </mml:msub>
                          <mml:mo>−</mml:mo>
                          <mml:msub>
                            <mml:mi>X</mml:mi>
                            <mml:mi>j</mml:mi>
                          </mml:msub>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mn>2</mml:mn>
                  </mml:msup>
                </mml:mrow>
              </mml:msqrt>
              <mml:mo>+</mml:mo>
              <mml:msqrt>
                <mml:mrow>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>y</mml:mi>
                            <mml:mi>i</mml:mi>
                          </mml:msub>
                          <mml:mo>−</mml:mo>
                          <mml:msub>
                            <mml:mi>Y</mml:mi>
                            <mml:mi>j</mml:mi>
                          </mml:msub>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mn>2</mml:mn>
                  </mml:msup>
                </mml:mrow>
              </mml:msqrt>
              <mml:mo>,</mml:mo>
              <mml:mi>i</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:mn>1</mml:mn>
              <mml:mo>,</mml:mo>
              <mml:mo>⋯</mml:mo>
              <mml:mo>,</mml:mo>
              <mml:mi>M</mml:mi>
              <mml:mo>;</mml:mo>
              <mml:mi>j</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:mn>1</mml:mn>
              <mml:mo>,</mml:mo>
              <mml:mo>⋯</mml:mo>
              <mml:mo>,</mml:mo>
              <mml:mi>N</mml:mi>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>were</p>
        <disp-formula id="FD6">
          <label>(4)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>Γ</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:msqrt>
                <mml:mrow>
                  <mml:msubsup>
                    <mml:mi>D</mml:mi>
                    <mml:mi>n</mml:mi>
                    <mml:mn>2</mml:mn>
                  </mml:msubsup>
                  <mml:mo>−</mml:mo>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:mi>x</mml:mi>
                          <mml:mo>−</mml:mo>
                          <mml:msub>
                            <mml:mi>x</mml:mi>
                            <mml:mi>N</mml:mi>
                          </mml:msub>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mn>2</mml:mn>
                  </mml:msup>
                </mml:mrow>
              </mml:msqrt>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD7">
          <mml:math>
            <mml:mrow>
              <mml:mi>X</mml:mi>
              <mml:mo>→</mml:mo>
              <mml:mi>min</mml:mi>
              <mml:mi>Δ</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:mstyle displaystyle="true">
                <mml:munderover>
                  <mml:mo>∑</mml:mo>
                  <mml:mrow>
                    <mml:mi>i</mml:mi>
                    <mml:mo>=</mml:mo>
                    <mml:mn>1</mml:mn>
                  </mml:mrow>
                  <mml:mi>∞</mml:mi>
                </mml:munderover>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>α</mml:mi>
                    <mml:mrow>
                      <mml:mi>i</mml:mi>
                      <mml:mo>,</mml:mo>
                      <mml:mi>j</mml:mi>
                    </mml:mrow>
                  </mml:msub>
                  <mml:msubsup>
                    <mml:mi>Γ</mml:mi>
                    <mml:mi>i</mml:mi>
                    <mml:mn>2</mml:mn>
                  </mml:msubsup>
                </mml:mrow>
              </mml:mstyle>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD8">
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>α</mml:mi>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:mo>→</mml:mo>
              <mml:mi>w</mml:mi>
              <mml:mi>e</mml:mi>
              <mml:mi>i</mml:mi>
              <mml:mi>g</mml:mi>
              <mml:mi>h</mml:mi>
              <mml:mi>t</mml:mi>
              <mml:mi>v</mml:mi>
              <mml:mi>a</mml:mi>
              <mml:mi>l</mml:mi>
              <mml:mi>u</mml:mi>
              <mml:mi>e</mml:mi>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD9">
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mi>D</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msqrt>
                <mml:mrow>
                  <mml:msup>
                    <mml:mi>r</mml:mi>
                    <mml:mn>2</mml:mn>
                  </mml:msup>
                  <mml:msup>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:mi>a</mml:mi>
                          <mml:mo>+</mml:mo>
                          <mml:mi>c</mml:mi>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mn>2</mml:mn>
                  </mml:msup>
                  <mml:mo>−</mml:mo>
                  <mml:mrow>
                    <mml:mrow>
                      <mml:msup>
                        <mml:mrow>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mrow>
                              <mml:mi>a</mml:mi>
                              <mml:mi>d</mml:mi>
                              <mml:mo>−</mml:mo>
                              <mml:mi>b</mml:mi>
                              <mml:mi>c</mml:mi>
                            </mml:mrow>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                        <mml:mn>2</mml:mn>
                      </mml:msup>
                    </mml:mrow>
                    <mml:mo>/</mml:mo>
                    <mml:mrow>
                      <mml:msup>
                        <mml:mrow>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mrow>
                              <mml:mi>a</mml:mi>
                              <mml:mo>+</mml:mo>
                              <mml:mi>c</mml:mi>
                            </mml:mrow>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                        <mml:mn>2</mml:mn>
                      </mml:msup>
                    </mml:mrow>
                  </mml:mrow>
                </mml:mrow>
              </mml:msqrt>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <fig id="fig9">
          <label>Figure 9</label>
          <graphic xlink:href="https://html.scirp.org/file/6102077-rId67.jpeg?20251230105308" />
        </fig>
        <p><bold>Figure 9.</bold> RSS triggering handover.</p>
        <p>were</p>
        <disp-formula id="FD10">
          <mml:math>
            <mml:mrow>
              <mml:mi>a</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>v</mml:mi>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:mi>cos</mml:mi>
              <mml:msub>
                <mml:mi>Θ</mml:mi>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:mo>−</mml:mo>
              <mml:msub>
                <mml:mi>v</mml:mi>
                <mml:mi>j</mml:mi>
              </mml:msub>
              <mml:mi>cos</mml:mi>
              <mml:mi>Θ</mml:mi>
              <mml:mmultiscripts>
                <mml:mo>,</mml:mo>
                <mml:mprescripts />
                <mml:mi>j</mml:mi>
                <mml:none />
              </mml:mmultiscripts>
              <mml:mi>b</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>x</mml:mi>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:mo>−</mml:mo>
              <mml:msub>
                <mml:mi>x</mml:mi>
                <mml:mi>j</mml:mi>
              </mml:msub>
              <mml:mo>,</mml:mo>
              <mml:mi>c</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>v</mml:mi>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:mi>sin</mml:mi>
              <mml:msub>
                <mml:mi>Θ</mml:mi>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:mo>−</mml:mo>
              <mml:msub>
                <mml:mi>v</mml:mi>
                <mml:mi>j</mml:mi>
              </mml:msub>
              <mml:mi>sin</mml:mi>
              <mml:msub>
                <mml:mi>Θ</mml:mi>
                <mml:mi>j</mml:mi>
              </mml:msub>
              <mml:mo>,</mml:mo>
              <mml:mi>d</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>y</mml:mi>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:mo>−</mml:mo>
              <mml:msub>
                <mml:mi>y</mml:mi>
                <mml:mi>j</mml:mi>
              </mml:msub>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>The following diagram shows the main procedures of the seamless connectivity process represented in <xref ref-type="fig" rid="fig10">Figure 10</xref> (Controller entity &amp; Distributed Data Center), represented by the virtual connection point (VCP). In this procedure, we mention that any MS can switch to another network and continue to reserve the former session from (GLOBAL IP Domain service). The MT can keep a temporary IP address when it is moving from one AP to another, and it can also move seamlessly from one network to another. The service is identified automatically by the location domain to another location independent of a unique name, instead of the network address; therefore, the MS can access the service without any awareness of the location policy service. Furthermore, when users encounter some obstacles or disconnection in some areas, users can send message request to the server controller for neighboring strength access. If not. The controller can assist by virtual machine connection (VMC) moving the machine. The control server sends to the moving machine the coordinator location of the users, and automatically, the machine can reach the users’ location. The connectivity holds automatically according to the distance of signals. The confirmation between the controller and DC is updated by such an acknowledgement confirmation (ACK). In the figure, a controller is responsible for any trigger handover message from any mobile service [<xref ref-type="bibr" rid="B50">50</xref>]-[<xref ref-type="bibr" rid="B53">53</xref>].</p>
        <fig id="fig10">
          <label>Figure 10</label>
          <graphic xlink:href="https://html.scirp.org/file/6102077-rId70.jpeg?20251230105308" />
        </fig>
        <p><bold>Figure 10.</bold> Procedure of service migration.</p>
        <p>The prediction of handover in a wireless network can be based on several approaches, such as the target base station to which the handover is attempted to connect, with algorithms focusing on the history of all mobile associations based on the transaction movement, as shown in <xref ref-type="fig" rid="fig10">Figure 10</xref> &amp; <xref ref-type="fig" rid="fig11">Figure 11</xref>. Furthermore, the target number of successfully predicted handovers has been analyzed, and the number of handovers is represented by the matrix (see <bold>Table 1</bold>). The matrix is represented by number of rows(<italic>x</italic>), and number of columns (<italic>y</italic>), and (<italic>x</italic>, <italic>y</italic>) to represent the number of neighboring BS. Any field in the matrix represents the number of handovers between BS<italic><sub>X</sub></italic> (serving BS) and BS<italic><sub>y</sub></italic> (target BS), within the observation time, the stage of connectivity, when a mobile is a target to connect to the next BS. For example, the field in the second row from BS2 to BS4 (handover account is equal to 30). Also, we can calculate the opposite direction handover prediction from BS4 to BS2 [<xref ref-type="bibr" rid="B54">54</xref>]-[<xref ref-type="bibr" rid="B56">56</xref>].</p>
        <p><bold>Table 1</bold>. The matrix representing the number of handovers among BSs (scenario with 7 neighboring BSs).</p>
        <p>The probability prediction of handover calculated from BS<italic><sub>x</sub></italic> to target BS<italic><sub>Y</sub></italic> (<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> p </mml:mi><mml:mrow><mml:mi> x </mml:mi><mml:mo> , </mml:mo><mml:mi> y </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> ) is according to the following formula:</p>
        <disp-formula id="FD11">
          <label>(6)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mi>P</mml:mi>
                <mml:mrow>
                  <mml:mi>x</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>y</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>p</mml:mi>
                    <mml:mrow>
                      <mml:msup>
                        <mml:mrow>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mrow>
                              <mml:mi>x</mml:mi>
                              <mml:mo>,</mml:mo>
                              <mml:mi>y</mml:mi>
                            </mml:mrow>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                        <mml:mrow>
                          <mml:mi>n</mml:mi>
                          <mml:mo>+</mml:mo>
                          <mml:mn>1</mml:mn>
                        </mml:mrow>
                      </mml:msup>
                    </mml:mrow>
                  </mml:msub>
                  <mml:mi>H</mml:mi>
                  <mml:msub>
                    <mml:mi>O</mml:mi>
                    <mml:mrow>
                      <mml:mi>x</mml:mi>
                      <mml:mo>,</mml:mo>
                      <mml:mi>y</mml:mi>
                    </mml:mrow>
                  </mml:msub>
                </mml:mrow>
                <mml:mrow>
                  <mml:mstyle displaystyle="true">
                    <mml:munderover>
                      <mml:mo>∑</mml:mo>
                      <mml:mrow>
                        <mml:mi>y</mml:mi>
                        <mml:mo>=</mml:mo>
                        <mml:mn>1</mml:mn>
                      </mml:mrow>
                      <mml:mrow>
                        <mml:mi>n</mml:mi>
                        <mml:mo>+</mml:mo>
                        <mml:mn>1</mml:mn>
                      </mml:mrow>
                    </mml:munderover>
                    <mml:mrow>
                      <mml:mi>H</mml:mi>
                      <mml:msub>
                        <mml:mi>O</mml:mi>
                        <mml:mrow>
                          <mml:mi>x</mml:mi>
                          <mml:mo>,</mml:mo>
                          <mml:mi>y</mml:mi>
                        </mml:mrow>
                      </mml:msub>
                    </mml:mrow>
                  </mml:mstyle>
                </mml:mrow>
              </mml:mfrac>
              <mml:mo>→</mml:mo>
              <mml:msub>
                <mml:mi>p</mml:mi>
                <mml:mrow>
                  <mml:mi>x</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>y</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mstyle displaystyle="true">
                <mml:munderover>
                  <mml:mo>∑</mml:mo>
                  <mml:mi>n</mml:mi>
                  <mml:mrow>
                    <mml:mi>n</mml:mi>
                    <mml:mo>+</mml:mo>
                    <mml:mn>1</mml:mn>
                  </mml:mrow>
                </mml:munderover>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>p</mml:mi>
                    <mml:mrow>
                      <mml:mi>x</mml:mi>
                      <mml:mo>,</mml:mo>
                      <mml:mi>y</mml:mi>
                      <mml:mo>→</mml:mo>
                      <mml:mstyle displaystyle="true">
                        <mml:msubsup>
                          <mml:mo>∑</mml:mo>
                          <mml:mrow>
                            <mml:mi>y</mml:mi>
                            <mml:mo>+</mml:mo>
                            <mml:mn>1</mml:mn>
                          </mml:mrow>
                          <mml:mrow>
                            <mml:mi>x</mml:mi>
                            <mml:mo>+</mml:mo>
                            <mml:mn>1</mml:mn>
                          </mml:mrow>
                        </mml:msubsup>
                        <mml:mrow>
                          <mml:mi>H</mml:mi>
                          <mml:msub>
                            <mml:mi>O</mml:mi>
                            <mml:mrow>
                              <mml:mi>x</mml:mi>
                              <mml:mo>,</mml:mo>
                              <mml:mi>y</mml:mi>
                            </mml:mrow>
                          </mml:msub>
                        </mml:mrow>
                      </mml:mstyle>
                    </mml:mrow>
                  </mml:msub>
                </mml:mrow>
              </mml:mstyle>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p><inline-formula><mml:math display="inline"><mml:mrow><mml:mi> H </mml:mi><mml:msub><mml:mi> O </mml:mi><mml:mrow><mml:mi> x </mml:mi><mml:mo> , </mml:mo><mml:mi> y </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> represents the number of handovers from BS<italic><sub>x</sub></italic> to BS<italic><sub>y</sub></italic> and is the amount </p>
        <fig id="fig11">
          <label>Figure 11</label>
          <graphic xlink:href="https://html.scirp.org/file/6102077-rId77.jpeg?20251230105307" />
        </fig>
        <p><bold>Figure 11.</bold> Pre-authentication using Open (MIH), frame seamless. </p>
        <p><bold>Table 1.</bold>Scenario with 7 neighboring BS.</p>
        <table-wrap id="tbl1">
          <label>Table 1</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>HO</bold>
                  <bold>counter</bold>
                </td>
                <td>
                  <bold>BS1</bold>
                </td>
                <td>
                  <bold>BS2</bold>
                </td>
                <td>
                  <bold>BS3</bold>
                </td>
                <td>
                  <bold>BS4</bold>
                </td>
                <td>
                  <bold>BS5</bold>
                </td>
                <td>
                  <bold>BS6</bold>
                </td>
                <td>
                  <bold>BS7</bold>
                </td>
              </tr>
              <tr>
                <td>BS1</td>
                <td>X</td>
                <td>34</td>
                <td>0</td>
                <td>28</td>
                <td>38</td>
                <td>0</td>
                <td>0</td>
              </tr>
              <tr>
                <td>BS2</td>
                <td>21</td>
                <td>X</td>
                <td>49</td>
                <td>30</td>
                <td>0</td>
                <td>0</td>
                <td>0</td>
              </tr>
              <tr>
                <td>BS3</td>
                <td>0</td>
                <td>17</td>
                <td>X</td>
                <td>52</td>
                <td>0</td>
                <td>31</td>
                <td>0</td>
              </tr>
              <tr>
                <td>BS4</td>
                <td>8</td>
                <td>32</td>
                <td>16</td>
                <td>X</td>
                <td>19</td>
                <td>11</td>
                <td>14</td>
              </tr>
              <tr>
                <td>BS5</td>
                <td>29</td>
                <td>0</td>
                <td>0</td>
                <td>45</td>
                <td>X</td>
                <td>0</td>
                <td>26</td>
              </tr>
              <tr>
                <td>BS6</td>
                <td>0</td>
                <td>0</td>
                <td>31</td>
                <td>39</td>
                <td>0</td>
                <td>X</td>
                <td>30</td>
              </tr>
              <tr>
                <td>BS7</td>
                <td>0</td>
                <td>0</td>
                <td>0</td>
                <td>26</td>
                <td>41</td>
                <td>33</td>
                <td>X</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>of neighboring BS. The probability of handover from BS<italic><sub>x</sub></italic> to BS<italic><sub>y</sub></italic> can be rewritten as:</p>
        <disp-formula id="FD12">
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mi>P</mml:mi>
                <mml:mrow>
                  <mml:mi>x</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>y</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mrow>
                <mml:mo>{</mml:mo>
                <mml:mrow>
                  <mml:mtable columnalign="left">
                    <mml:mtr columnalign="left">
                      <mml:mtd columnalign="left">
                        <mml:mrow>
                          <mml:mi>α</mml:mi>
                          <mml:mo>,</mml:mo>
                        </mml:mrow>
                      </mml:mtd>
                      <mml:mtd columnalign="left">
                        <mml:mrow>
                          <mml:mi>y</mml:mi>
                          <mml:mo>∈</mml:mo>
                          <mml:mi>N</mml:mi>
                          <mml:msub>
                            <mml:mi>S</mml:mi>
                            <mml:mi>X</mml:mi>
                          </mml:msub>
                        </mml:mrow>
                      </mml:mtd>
                    </mml:mtr>
                    <mml:mtr columnalign="left">
                      <mml:mtd columnalign="left">
                        <mml:mrow>
                          <mml:mn>0</mml:mn>
                          <mml:mo>,</mml:mo>
                        </mml:mrow>
                      </mml:mtd>
                      <mml:mtd columnalign="left">
                        <mml:mrow>
                          <mml:mi>y</mml:mi>
                          <mml:mo>∉</mml:mo>
                          <mml:mi>N</mml:mi>
                          <mml:msub>
                            <mml:mi>S</mml:mi>
                            <mml:mi>X</mml:mi>
                          </mml:msub>
                        </mml:mrow>
                      </mml:mtd>
                    </mml:mtr>
                  </mml:mtable>
                </mml:mrow>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math display="inline"><mml:mrow><mml:mn> 0 </mml:mn><mml:mo> ≤ </mml:mo><mml:mi> α </mml:mi><mml:mo> ≤ </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> . <inline-formula><mml:math display="inline"><mml:mi> α </mml:mi></mml:math></inline-formula> is the present number of BS and the number of layout monitoring [<xref ref-type="bibr" rid="B44">44</xref>][<xref ref-type="bibr" rid="B45">45</xref>]. We suppose that in a real system, the number of handovers in a time at infinite future (<inline-formula><mml:math display="inline"><mml:mrow><mml:mi> t </mml:mi><mml:mo> → </mml:mo><mml:mi> ∞ </mml:mi></mml:mrow></mml:math></inline-formula> ) can be formulated as in the formula:</p>
        <disp-formula id="FD13">
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>P</mml:mi>
                        <mml:mrow>
                          <mml:mi>x</mml:mi>
                          <mml:mo>,</mml:mo>
                          <mml:mi>y</mml:mi>
                        </mml:mrow>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>|</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mrow>
                  <mml:mi>x</mml:mi>
                  <mml:mo>=</mml:mo>
                  <mml:mi>c</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>n</mml:mi>
                  <mml:mi>s</mml:mi>
                  <mml:mi>t</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>t</mml:mi>
                  <mml:mo>→</mml:mo>
                  <mml:mi>∞</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mstyle displaystyle="true">
                <mml:munder>
                  <mml:mo>∑</mml:mo>
                  <mml:mrow>
                    <mml:mi>y</mml:mi>
                    <mml:mo>=</mml:mo>
                    <mml:mn>1</mml:mn>
                  </mml:mrow>
                </mml:munder>
                <mml:mrow>
                  <mml:mi>H</mml:mi>
                  <mml:msubsup>
                    <mml:mi>O</mml:mi>
                    <mml:mi>t</mml:mi>
                    <mml:mrow>
                      <mml:mi>n</mml:mi>
                      <mml:mo>+</mml:mo>
                      <mml:mn>1</mml:mn>
                    </mml:mrow>
                  </mml:msubsup>
                  <mml:msub>
                    <mml:mi>P</mml:mi>
                    <mml:mrow>
                      <mml:mi>x</mml:mi>
                      <mml:mo>,</mml:mo>
                      <mml:mi>y</mml:mi>
                    </mml:mrow>
                  </mml:msub>
                </mml:mrow>
              </mml:mstyle>
              <mml:mo>=</mml:mo>
              <mml:mn>1</mml:mn>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Then the handover probability over a finite time interval is presented as in formula:</p>
        <disp-formula id="FD14">
          <label>(8)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mn>0</mml:mn>
              <mml:mo>≤</mml:mo>
              <mml:mstyle displaystyle="true">
                <mml:munder>
                  <mml:mo>∑</mml:mo>
                  <mml:mrow>
                    <mml:mi>n</mml:mi>
                    <mml:mo>=</mml:mo>
                    <mml:mn>1</mml:mn>
                  </mml:mrow>
                </mml:munder>
                <mml:mrow>
                  <mml:mi>H</mml:mi>
                  <mml:msub>
                    <mml:mi>O</mml:mi>
                    <mml:mi>n</mml:mi>
                  </mml:msub>
                  <mml:msub>
                    <mml:mi>P</mml:mi>
                    <mml:mrow>
                      <mml:mi>x</mml:mi>
                      <mml:mo>,</mml:mo>
                      <mml:mi>y</mml:mi>
                    </mml:mrow>
                  </mml:msub>
                </mml:mrow>
              </mml:mstyle>
              <mml:mo>≤</mml:mo>
              <mml:mn>1</mml:mn>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> p </mml:mi><mml:mrow><mml:mi> x </mml:mi><mml:mo> , </mml:mo><mml:mi> y </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is present, a formula functions on time <italic>t</italic>.</p>
        <p>The parameters of the scenario of the handover prediction based on the handover history are presented in <bold>Table 2</bold>.</p>
        <p><bold>Table 2.</bold>Presents the scenario of the handover prediction.</p>
        <table-wrap id="tbl2">
          <label>Table 2</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Parameter</bold>
                </td>
                <td>
                  <bold>Value</bold>
                </td>
              </tr>
              <tr>
                <td>Number of BS [-]</td>
                <td>7</td>
              </tr>
              <tr>
                <td>Number of MS [-]</td>
                <td>100</td>
              </tr>
              <tr>
                <td>MS speed [m/s]</td>
                <td>2</td>
              </tr>
              <tr>
                <td>Simulation duration [s]</td>
                <td>86,400</td>
              </tr>
              <tr>
                <td>Mobility model</td>
                <td>Randomly</td>
              </tr>
              <tr>
                <td>Size of simulation area [m]</td>
                <td>200 × 200</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
      </sec>
      <sec id="sec4dot3">
        <title>4.3. Localization Connectivity Scenario</title>
        <p>To evaluate the performance of the proposed service migration framework, we implement our simulation result strategy for 1000 users localized in the whole area of the simulation, 15 km × 20 km, BS = 63, distance from BS to BS = 2.5 km, coverage area for any BS = 5000 = km<sup>2</sup>. Using the possibility of the localization is the use of angular estimates instead of distance estimates; using trigonometry and geometry, triangulation is used to find and determine the location of the point (MT) by measuring angles to it from two known reference points, based on localized users.</p>
        <disp-formula id="FD15">
          <label>(9)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mtext>User</mml:mtext>
              <mml:mo>=</mml:mo>
              <mml:mi>X</mml:mi>
              <mml:mo>,</mml:mo>
              <mml:mi>Y</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mfrac>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>X</mml:mi>
                        <mml:mn>1</mml:mn>
                      </mml:msub>
                      <mml:mo>+</mml:mo>
                      <mml:msub>
                        <mml:mi>X</mml:mi>
                        <mml:mn>2</mml:mn>
                      </mml:msub>
                      <mml:mo>+</mml:mo>
                      <mml:msub>
                        <mml:mi>X</mml:mi>
                        <mml:mn>3</mml:mn>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mi>N</mml:mi>
                  </mml:mfrac>
                  <mml:mo>,</mml:mo>
                  <mml:mfrac>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>Y</mml:mi>
                        <mml:mn>1</mml:mn>
                      </mml:msub>
                      <mml:mo>+</mml:mo>
                      <mml:msub>
                        <mml:mi>Y</mml:mi>
                        <mml:mn>2</mml:mn>
                      </mml:msub>
                      <mml:mo>+</mml:mo>
                      <mml:msub>
                        <mml:mi>Y</mml:mi>
                        <mml:mn>3</mml:mn>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mi>N</mml:mi>
                  </mml:mfrac>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
      </sec>
      <sec id="sec4dot4">
        <title>4.4. Localized Handover Management</title>
        <p>The technique used in handover proposal management for seamless connectivity is Make Before-Break handoffs, which enables lossless handoff. The Mobile node can complete the handoff in advance before losing connection with the previous Access Router; if the mobile node temporarily loses connection, it can receive the signal from neighboring emergency services or restore the previous service. Using a vertical handoff timing algorithm based only on the signal strength to finalize the handoff immediately, see <xref ref-type="fig" rid="fig11">Figure 11</xref>, <xref ref-type="fig" rid="fig12">Figure 12</xref> and <xref ref-type="fig" rid="fig14">Figure 14</xref>. Coverage area represented by 100 users distributed throughout the entire area represented, see <xref ref-type="fig" rid="fig15">Figure 15</xref>. The connectivity connection and connectionless are identified and presented in the color of the real connection; users result in being disconnected, see <xref ref-type="fig" rid="fig16">Figure 16</xref> and <xref ref-type="fig" rid="fig17">Figure 17</xref>. Distributed throughout the location of the bandwidth area and of the error connection based on the user’s random movement.</p>
      </sec>
      <sec id="sec4dot5">
        <title>4.5. Location Based Task Distribution Framework</title>
        <p>We identified a task map; here is a unique ID, a mobile terminal can receive the task map from the sensing system and obtain the task ID. Nonetheless, high user density and high bandwidth requirements, such as those in airports, business districts, shopping centers, industrial areas, amusement parks, trade fairs, exhibition centers, sports complexes, etc., are represented in the figure previously. In these kinds of scenarios, efficient radio resource management becomes critical in order to provide the required QoS to the highest number of users with the limited available resources. The mobile node can move around the whole area, as shown in the figure; the random walk model is used with a random direction and speed. In order to find the exact track position of the MT, and the distance between the BS and the tracking point, the estimated RSS is evaluated according to the following ranging model see <xref ref-type="fig" rid="fig13">Figure 13</xref>.</p>
        <p>The Model architecture of open flow switches uses functions to rearrange the virtual network topology over the physical topology. The primary goals are to simplify roaming of MT moving through virtual addresses, such as requiring virtual routers to be reconfigured, and disturbing virtual IP-level topology. Furthermore, this entity is able to define the new physical topology of the virtual network, which will simplify seamless connectivity for the users<sup>.</sup> To maintain the immigration environment, we must create new neighbors as the same virtual node migrates from the new physical node topology. Each virtual router has its own forwarding table from the Domain, and each table is a copy of the original forwarding table that was created by routing software. Open Flow switches run a shared data plane, which is the concatenation of the forwarding tables of each virtual network. <xref ref-type="fig" rid="fig6">Figure 6</xref> represents the main concept of the open flow diagram.</p>
      </sec>
      <sec id="sec4dot6">
        <title>4.6. Simulation Results</title>
        <fig id="fig12">
          <label>Figure 12</label>
          <graphic xlink:href="https://html.scirp.org/file/6102077-rId100.jpeg?20251230105314" />
        </fig>
        <p><bold>Figure 1</bold><bold>2</bold><bold>.</bold> It explains the triangulation technique used to localize a point of BS; the figure is explain how the Base Station (BS) localizes connectivity for users’ connections.</p>
        <fig id="fig13">
          <label>Figure 13</label>
          <graphic xlink:href="https://html.scirp.org/file/6102077-rId101.jpeg?20251230105314" />
        </fig>
        <p><bold>Figure 1</bold><bold>3</bold><bold>.</bold> Distributed users in several BS show the stage of the user’s connectivity.</p>
        <fig id="fig14">
          <label>Figure 14</label>
          <graphic xlink:href="https://html.scirp.org/file/6102077-rId102.jpeg?20251230105313" />
        </fig>
        <p><bold>Figure 1</bold><bold>4</bold><bold>.</bold> High_density area localized connect with BS resource limitation.</p>
        <fig id="fig15">
          <label>Figure 15</label>
          <graphic xlink:href="https://html.scirp.org/file/6102077-rId103.jpeg?20251230105313" />
        </fig>
        <p><bold>Figure 1</bold><bold>5</bold><bold>.</bold> Example of coverage area represented by100 users distributed in throughout the entire area.</p>
        <fig id="fig16">
          <label>Figure 16</label>
          <graphic xlink:href="https://html.scirp.org/file/6102077-rId104.jpeg?20251230105314" />
        </fig>
        <p><bold>Figure 1</bold><bold>6</bold><bold>.</bold>Example of coverage area representing 100 users distributed throughout in the location of the bandwidth area of the location distance.</p>
        <fig id="fig17">
          <label>Figure 17</label>
          <graphic xlink:href="https://html.scirp.org/file/6102077-rId105.jpeg?20251230105313" />
        </fig>
        <p><bold>Figure 1</bold><bold>7</bold><bold>.</bold>Example of the error connection with different BS in the simulation area.</p>
        <p>The graph is shown as an error connection. Depending on the user category, there exist [low speed, Max Speed, and Medium Speed] based on the user’s random movement; the resulting graph is described in <xref ref-type="fig" rid="fig17">Figure 17</xref>. Using 165db, represent and provide the prediction of the accuracy of handover percentage, the result also refers to the type of handoff assignment. In addition, the graph provides an explanation of the handover percentage simulated at different times.</p>
      </sec>
      <sec id="sec4dot7">
        <title>4.7. Final Remark</title>
        <p>The architecture represents future post-IP generation educated with strong authentication, where customers can obtain perfect privacy. In our architecture, we introduce different planes based on automatic networking, associated with knowledge plane and intelligent system. The system will be able to control the whole QoS flawlessly in IP networks, and it will consequently respond to users’ requirements. Hence, flexibility and extensibility in composition protocol stacks should be deployed and instantiated on a need basis. The OpenFlow model is an alternative initiative approach to providing facilities to test and evaluate network architecture.</p>
      </sec>
      <sec id="sec4dot8">
        <title>4.8. Discussion</title>
        <p>In the vision of open access networks, where users can connect to any available access network of any operator, a more flexible and open solution is required to interwork the networks to offer real global interworking and roaming facilities. To this end, we aim to design a Roaming Interworking Intermediary (RII) platform which support all combinations of different radio technologies in a multi-operator environment by using software defined network (SDN), open flow controller (OFC), SDN is an innovative approach to design, implement and manage networks that separates the network’s control (Control plane) and forwarding process (Data plane) for a better user experience. This network segmentation offers numerous benefits in terms of network flexibility and controllability. On the one hand, it allows combining the advantages of system virtualization and implementation of centralized intelligence that enables clear visibility over the network for easy network management and maintenance as well as enhanced network control, as represented in <xref ref-type="fig" rid="fig4">Figure 4</xref>.</p>
      </sec>
    </sec>
    <sec id="sec5">
      <title>5. Conclusion</title>
      <p>In wireless networking, a heterogeneous network is composed of several wireless technologies; similarly, in frame-based architecture, together they constitute a network that connects users to the internet. The core network, sometimes called the backbone network, joins all access networks together. The technologies utilized in core and access networks may be different, resulting in different characteristics. In this study, research provides extra router capacity and bandwidth to ensure smooth performance. A mechanism where the network decides whether to accept or reject a new flow based on available resources, ensuring that existing QoS guarantees are not violated. In addition, this paper provides suggestions on how to prioritize a measurement process related to the location and bandwidth management mechanisms to measure and control traffic flows on the network. Preventing the network from exceeding its capacity allows for network congestion avoidance. Depending on the provider, the above services and controls can be managed and consolidated. QoS can be applied in wireless networks to ensure reliable performance for critical applications by managing bandwidth allocation and prioritizing traffic, even in environments with variable signal quality and interference. Ultimately, QoS mechanisms give network administrators the power to prioritize applications as determined by the needs of the business. This makes it easy to assign higher importance to particular data delivery types over others. Future networks will offer more customized services at higher quality level preferences. With the increasing capabilities in devices, an obvious question is whether the users’ terminal can control and manage the handover across different access technologies. However, such a terminal-controlled handover requires an interworking architecture where mobility management becomes a service independent of access network operator domains. Intelligent access network selection in the terminal is required to aid users in selecting the best access network.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="B1">
        <label>1.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Hossain, M.F., Ghosh, A., Al Mamun, M.A., Miazee, A.A., Al-lohedan, H., Ramalingam, R.J., <italic>et al.</italic> (2024) Design and Simulation Numerically with Performance Enhancement of Extremely Efficient Sb <sub>2</sub>Se <sub>3</sub>-Based Solar Cell with V <sub>2</sub>O <sub>5</sub> as the Hole Transport Layer, Using SCAPS-1D Simulation Program. <italic>Optics Communications</italic>, 559, Article ID: 130410. https://doi.org/10.1016/j.optcom.2024.130410 <pub-id pub-id-type="doi">10.1016/j.optcom.2024.130410</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.optcom.2024.130410">https://doi.org/10.1016/j.optcom.2024.130410</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Hossain, M.F.</string-name>
              <string-name>Ghosh, A.</string-name>
              <string-name>Mamun, M.A.</string-name>
              <string-name>Miazee, A.A.</string-name>
              <string-name>Al-lohedan, H.</string-name>
              <string-name>Ramalingam, R.J.</string-name>
              <string-name>Layer, U</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Design and Simulation Numerically with Performance Enhancement of Extremely Efficient Sb2Se3-Based Solar Cell with V2O5 as the Hole Transport Layer, Using SCAPS-1D Simulation Program</article-title>
            <source>Optics Communications</source>
            <volume>559</volume>
            <fpage>130410</fpage>
            <elocation-id>ID</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.optcom.2024.130410</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B2">
        <label>2.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Li, B., Fei, Z.S. and Zhang, Y. (2020) UAV Communications for 5G and Beyond: Recent Advances and Future Trends. <italic>IEEE Internet of Things Journal</italic>, 6, 2241-2263. https://doi.org/10.1109/JIOT.2018.2887086 <pub-id pub-id-type="doi">10.1109/JIOT.2018.2887086</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/JIOT.2018.2887086">https://doi.org/10.1109/JIOT.2018.2887086</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Li, B.</string-name>
              <string-name>Fei, Z.S.</string-name>
              <string-name>Zhang, Y.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>UAV Communications for 5G and Beyond: Recent Advances and Future Trends</article-title>
            <source>IEEE Internet of Things Journal</source>
            <volume>6</volume>
            <pub-id pub-id-type="doi">10.1109/JIOT.2018.2887086</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B3">
        <label>3.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">De la Oliva, A., Soto, I., Banchs, A., Lessmann, J., Niephaus, C. and Melia, T. (2011) IEEE 802.21: Media Independence Beyond Handover. <italic>Computer Standards &amp; Interfaces</italic>, 33, 556-564. https://doi.org/10.1016/j.csi.2011.03.001 <pub-id pub-id-type="doi">10.1016/j.csi.2011.03.001</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.csi.2011.03.001">https://doi.org/10.1016/j.csi.2011.03.001</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Oliva, A.</string-name>
              <string-name>Soto, I.</string-name>
              <string-name>Banchs, A.</string-name>
              <string-name>Lessmann, J.</string-name>
              <string-name>Niephaus, C.</string-name>
              <string-name>Melia, T.</string-name>
            </person-group>
            <year>2011</year>
            <article-title>IEEE 802</article-title>
            <source>21: Media Independence Beyond Handover. Computer Standards &amp; Interfaces</source>
            <volume>33</volume>
            <pub-id pub-id-type="doi">10.1016/j.csi.2011.03.001</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B4">
        <label>4.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Gavrilovska, L., Atanasovski, V., Latkoski, P. and Rakovik, V. (2015) Analysis of Reconfigurability, Control and Resource Management in Heterogeneous Wireless Networks. <italic>International Journal of Computers Communications &amp; Control</italic>, 10, 318-332. https://doi.org/10.15837/ijccc.2015.3.602 <pub-id pub-id-type="doi">10.15837/ijccc.2015.3.602</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.15837/ijccc.2015.3.602">https://doi.org/10.15837/ijccc.2015.3.602</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Gavrilovska, L.</string-name>
              <string-name>Atanasovski, V.</string-name>
              <string-name>Latkoski, P.</string-name>
              <string-name>Rakovik, V.</string-name>
              <string-name>Reconfigurability, C</string-name>
            </person-group>
            <year>2015</year>
            <article-title>Analysis of Reconfigurability, Control and Resource Management in Heterogeneous Wireless Networks</article-title>
            <source>International Journal of Computers Communications &amp; Control</source>
            <volume>10</volume>
            <pub-id pub-id-type="doi">10.15837/ijccc.2015.3.602</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B5">
        <label>5.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">McKeown, N., Anderson, T., Balakrishnan, H., Parulkar, G., Peterson, L., Rexford, J., <italic>et al.</italic> (2008) OpenFlow: Enabling Innovation in Campus Networks. <italic>ACM SIGCOMM Computer Communication Review</italic>, 38, 69-74. https://doi.org/10.1145/1355734.1355746 <pub-id pub-id-type="doi">10.1145/1355734.1355746</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/1355734.1355746">https://doi.org/10.1145/1355734.1355746</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>McKeown, N.</string-name>
              <string-name>Anderson, T.</string-name>
              <string-name>Balakrishnan, H.</string-name>
              <string-name>Parulkar, G.</string-name>
              <string-name>Peterson, L.</string-name>
              <string-name>Rexford, J.</string-name>
            </person-group>
            <year>2008</year>
            <article-title>OpenFlow: Enabling Innovation in Campus Networks</article-title>
            <source>ACM SIGCOMM Computer Communication Review</source>
            <volume>38</volume>
            <pub-id pub-id-type="doi">10.1145/1355734.1355746</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B6">
        <label>6.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Mohajer, A., <italic>et al.</italic> (2022) Energy-Aware Hierarchical Resource Management and Backhaul Traffic Optimization in Heterogeneous Cellular Networks. <italic>IEEE Systems Journal</italic>, 16, 5188-5199. https://doi.org/10.1109/JSYST.2022.3154162 <pub-id pub-id-type="doi">10.1109/JSYST.2022.3154162</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/JSYST.2022.3154162">https://doi.org/10.1109/JSYST.2022.3154162</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Mohajer, A.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>Energy-Aware Hierarchical Resource Management and Backhaul Traffic Optimization in Heterogeneous Cellular Networks</article-title>
            <source>IEEE Systems Journal</source>
            <volume>16</volume>
            <pub-id pub-id-type="doi">10.1109/JSYST.2022.3154162</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B7">
        <label>7.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Doria, A., Salim, J.H., Haas, R., Khosravi, H., Wang, W., Dong, L., Gopal, R. and Halpern, J. (2010) Forwarding and Control Element Separation (ForCES) Protocol Specification. RFC 5810 (Proposed Standard). https://datatracker.ietf.org/doc/rfc5810/</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Doria, A.</string-name>
              <string-name>Salim, J.H.</string-name>
              <string-name>Haas, R.</string-name>
              <string-name>Khosravi, H.</string-name>
              <string-name>Wang, W.</string-name>
              <string-name>Dong, L.</string-name>
              <string-name>Gopal, R.</string-name>
              <string-name>Halpern, J.</string-name>
            </person-group>
            <year>2010</year>
            <article-title>Forwarding and Control Element Separation (ForCES) Protocol Specification</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B8">
        <label>8.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Yang, L., Dantu, R., Anderson, T. and Gopal, R. (2004) Forwarding and Control Element Separation (ForCES) Framework. RFC 3746 (Informational). http://datatracker.ietf.org/doc/rfc3746/</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Yang, L.</string-name>
              <string-name>Dantu, R.</string-name>
              <string-name>Anderson, T.</string-name>
              <string-name>Gopal, R.</string-name>
            </person-group>
            <year>2004</year>
            <article-title>Forwarding and Control Element Separation (ForCES) Framework</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B9">
        <label>9.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Farrel, A., Vasseur, J.P. and Ash, J. (2006) A Path Computation Element (PCE)-Based Architecture (No. RFC 4655). http://www.researchgate.net/publication/294473181_ASTN_functIon_for_trAnsport_se%20(No.ervice_enhAcment(PDF)ASTN%20function%20for%20transport%20service%20enhancement</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Farrel, A.</string-name>
              <string-name>Vasseur, J.P.</string-name>
              <string-name>Ash, J.</string-name>
            </person-group>
            <year>2006</year>
            <article-title>A Path Computation Element (PCE)-Based Architecture (No</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B10">
        <label>10.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Rodriguez-Natal, A., Barkai, S., Ermagan, V., Lewis, D., Maino, F. and Farinacci, D. (2014) Soft-Ware Defined Networking Extensions for the Locator/ID Separation Protocol. Internet Draft (Experimental). http://wiki.tools.ietf.org/id/draft-rodrigueznatallisp-sdn-00.txt</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Rodriguez-Natal, A.</string-name>
              <string-name>Barkai, S.</string-name>
              <string-name>Ermagan, V.</string-name>
              <string-name>Lewis, D.</string-name>
              <string-name>Maino, F.</string-name>
              <string-name>Farinacci, D.</string-name>
            </person-group>
            <year>2014</year>
            <article-title>Soft-Ware Defined Networking Extensions for the Locator/ID Separation Protocol</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B11">
        <label>11.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Berde, P., Gerola, M., Hart, J., Higuchi, Y., Kobayashi, M., Koide, T., <italic>et al.</italic> (2014) ONOS: Towards an Open, Distributed SDN OS. <italic>Proceedings of the Third Workshop on Hot Topics in Software Defined Networking</italic>, Chicago, 22 August 2014, 1-6. https://doi.org/10.1145/2620728.2620744 <pub-id pub-id-type="doi">10.1145/2620728.2620744</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/2620728.2620744">https://doi.org/10.1145/2620728.2620744</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Berde, P.</string-name>
              <string-name>Gerola, M.</string-name>
              <string-name>Hart, J.</string-name>
              <string-name>Higuchi, Y.</string-name>
              <string-name>Kobayashi, M.</string-name>
              <string-name>Koide, T.</string-name>
              <string-name>Open, D</string-name>
              <string-name>Networking, C</string-name>
            </person-group>
            <year>2014</year>
            <article-title>ONOS: Towards an Open, Distributed SDN OS</article-title>
            <source>Proceedings of the Third Workshop on Hot Topics in Software Defined Networking</source>
            <volume>22</volume>
            <pub-id pub-id-type="doi">10.1145/2620728.2620744</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B12">
        <label>12.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Brocade Communications Systems (2012) Network Transformation with Software-Defined Networking and Ethernet Fabrics, California, USA. http://www.brocade.com/downloads/documents/positioningpapers/network-transformation-sdn-wp.pdf</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Fabrics, C</string-name>
            </person-group>
            <year>2012</year>
            <article-title>Network Transformation with Software-Defined Networking and Ethernet Fabrics, California, USA</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B13">
        <label>13.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Vasilakos, X., Siris, V.A. and Polyzos, G.C. (2016) Addressing Niche Demand Based on Joint Mobility Prediction and Content Popularity Caching. <italic>Computer Networks</italic>, 110, 306-323. https://doi.org/10.1016/j.comnet.2016.10.001 <pub-id pub-id-type="doi">10.1016/j.comnet.2016.10.001</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.comnet.2016.10.001">https://doi.org/10.1016/j.comnet.2016.10.001</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Vasilakos, X.</string-name>
              <string-name>Siris, V.A.</string-name>
              <string-name>Polyzos, G.C.</string-name>
            </person-group>
            <year>2016</year>
            <article-title>Addressing Niche Demand Based on Joint Mobility Prediction and Content Popularity Caching</article-title>
            <source>Computer Networks</source>
            <volume>110</volume>
            <pub-id pub-id-type="doi">10.1016/j.comnet.2016.10.001</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B14">
        <label>14.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Benzekki, K., El, A. and El, A. (2016) A Secure Cloud Computing Architecture Using Homomorphic Encryption. <italic>International Journal of Advanced Computer Science and Applications</italic>, 7, 293-298. https://doi.org/10.14569/ijacsa.2016.070241 <pub-id pub-id-type="doi">10.14569/ijacsa.2016.070241</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.14569/ijacsa.2016.070241">https://doi.org/10.14569/ijacsa.2016.070241</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Benzekki, K.</string-name>
              <string-name>El, A.</string-name>
              <string-name>El, A.</string-name>
            </person-group>
            <year>2016</year>
            <article-title>A Secure Cloud Computing Architecture Using Homomorphic Encryption</article-title>
            <source>International Journal of Advanced Computer Science and Applications</source>
            <volume>7</volume>
            <pub-id pub-id-type="doi">10.14569/ijacsa.2016.070241</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B15">
        <label>15.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Cisco Systems (2016) Cisco Visual Networking Index: Global Mobile Data Traffic Forecast Update, 2016-2020.</mixed-citation>
          <element-citation publication-type="other">
            <year>2016</year>
            <article-title>Cisco Visual Networking Index: Global Mobile Data Traffic Forecast Update, 2016-2020</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B16">
        <label>16.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Finamore, A., Mellia, M., Munafò, M.M., Torres, R. and Rao, S.G. (2011) YouTube Everywhere: Impact of Device and Infrastructure Synergies on User Experience. <italic>Proceedings of the</italic> 2011 <italic>ACM SIGCOMM Conference on Internet Measurement Conference</italic>, Berlin, 2-4 November 2011, 345-360. https://doi.org/10.1145/2068816.2068849 <pub-id pub-id-type="doi">10.1145/2068816.2068849</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/2068816.2068849">https://doi.org/10.1145/2068816.2068849</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Finamore, A.</string-name>
              <string-name>Mellia, M.</string-name>
              <string-name>Torres, R.</string-name>
              <string-name>Rao, S.G.</string-name>
              <string-name>Conference, B</string-name>
            </person-group>
            <year>2011</year>
            <article-title>YouTube Everywhere: Impact of Device and Infrastructure Synergies on User Experience</article-title>
            <source>Proceedings of the 2011 ACM SIGCOMM Conference on Internet Measurement Conference</source>
            <volume>2</volume>
            <pub-id pub-id-type="doi">10.1145/2068816.2068849</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B17">
        <label>17.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Xu, J.L., Liu, J.C., Li, B. and Jia, X.H. (2004) Caching and Prefetching for Web Content Distribution. <italic>Computing in Science &amp; Engineering</italic>, 6, 54-59. https://doi.org/10.1109/mcse.2004.5 <pub-id pub-id-type="doi">10.1109/mcse.2004.5</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/mcse.2004.5">https://doi.org/10.1109/mcse.2004.5</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Xu, J.L.</string-name>
              <string-name>Liu, J.C.</string-name>
              <string-name>Li, B.</string-name>
              <string-name>Jia, X.H.</string-name>
            </person-group>
            <year>2004</year>
            <article-title>Caching and Prefetching for Web Content Distribution</article-title>
            <source>Computing in Science &amp; Engineering</source>
            <volume>6</volume>
            <pub-id pub-id-type="doi">10.1109/mcse.2004.5</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B18">
        <label>18.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Applegate, D., Archer, A., Gopalakrishnan, V., Lee, S. and Ramakrishnan, K.K. (2010) Optimal Content Placement for A Large-Scale VoD System. <italic>Proceedings of the</italic>6 <italic>th International Conference</italic>, Philadelphia, 30 November-3 December 2010, 1-12. https://doi.org/10.1145/1921168.1921174 <pub-id pub-id-type="doi">10.1145/1921168.1921174</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/1921168.1921174">https://doi.org/10.1145/1921168.1921174</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Applegate, D.</string-name>
              <string-name>Archer, A.</string-name>
              <string-name>Gopalakrishnan, V.</string-name>
              <string-name>Lee, S.</string-name>
              <string-name>Ramakrishnan, K.K.</string-name>
              <string-name>Conference, P</string-name>
            </person-group>
            <year>2010</year>
            <article-title>Optimal Content Placement for A Large-Scale VoD System</article-title>
            <source>Proceedings of the 6th International Conference</source>
            <volume>30</volume>
            <pub-id pub-id-type="doi">10.1145/1921168.1921174</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B19">
        <label>19.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Golrezaei, N., Shanmugam, K., Dimakis, A.G., Molisch, A.F. and Caire, G. (2012) FemtoCaching: Wireless Video Content Delivery through Distributed Caching Helpers. 2012 <italic>Proceedings IEEE INFOCOM</italic>, 25-30 March 2012, 1107-1115. https://doi.org/10.1109/infcom.2012.6195469 <pub-id pub-id-type="doi">10.1109/infcom.2012.6195469</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/infcom.2012.6195469">https://doi.org/10.1109/infcom.2012.6195469</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Golrezaei, N.</string-name>
              <string-name>Shanmugam, K.</string-name>
              <string-name>Dimakis, A.G.</string-name>
              <string-name>Molisch, A.F.</string-name>
              <string-name>Caire, G.</string-name>
            </person-group>
            <year>2012</year>
            <article-title>FemtoCaching: Wireless Video Content Delivery through Distributed Caching Helpers</article-title>
            <source>2012 Proceedings IEEE INFOCOM</source>
            <volume>25</volume>
            <pub-id pub-id-type="doi">10.1109/infcom.2012.6195469</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B20">
        <label>20.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Zhang, F., Xu, C., Zhang, Y., Ramakrishnan, K.K., Mukherjee, S., Yates, R., <italic>et al.</italic> (2015) EdgeBuffer: Caching and Prefetching Content at the Edge in the MobilityFirst Future Internet Architecture. 2015 <italic>IEEE</italic> 16 <italic>th International Symposium on A World</italic><italic>of Wireless</italic>, <italic>Mobile and Multimedia Networks</italic> ( <italic>WoWMoM</italic>), Boston, 14-17 June 2015, 1-9. https://doi.org/10.1109/wowmom.2015.7158137 <pub-id pub-id-type="doi">10.1109/wowmom.2015.7158137</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/wowmom.2015.7158137">https://doi.org/10.1109/wowmom.2015.7158137</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Zhang, F.</string-name>
              <string-name>Xu, C.</string-name>
              <string-name>Zhang, Y.</string-name>
              <string-name>Ramakrishnan, K.K.</string-name>
              <string-name>Mukherjee, S.</string-name>
              <string-name>Yates, R.</string-name>
              <string-name>Wireless, M</string-name>
            </person-group>
            <year>2015</year>
            <article-title>EdgeBuffer: Caching and Prefetching Content at the Edge in the MobilityFirst Future Internet Architecture</article-title>
            <source>2015 IEEE 16th International Symposium on A World of Wireless</source>
            <volume>14</volume>
            <pub-id pub-id-type="doi">10.1109/wowmom.2015.7158137</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B21">
        <label>21.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Jurdak, R., Zhao, K., Liu, J., AbouJaoude, M., Cameron, M. and Newth, D. (2015) Understanding Human Mobility from Twitter. <italic>PLOS ONE</italic>, 10, e0131469. https://doi.org/10.1371/journal.pone.0131469 <pub-id pub-id-type="doi">10.1371/journal.pone.0131469</pub-id><pub-id pub-id-type="pmid">26154597</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1371/journal.pone.0131469">https://doi.org/10.1371/journal.pone.0131469</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Jurdak, R.</string-name>
              <string-name>Zhao, K.</string-name>
              <string-name>Liu, J.</string-name>
              <string-name>AbouJaoude, M.</string-name>
              <string-name>Cameron, M.</string-name>
              <string-name>Newth, D.</string-name>
            </person-group>
            <year>2015</year>
            <article-title>Understanding Human Mobility from Twitter</article-title>
            <source>PLOS ONE</source>
            <volume>10</volume>
            <pub-id pub-id-type="doi">10.1371/journal.pone.0131469</pub-id>
            <pub-id pub-id-type="pmid">26154597</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B22">
        <label>22.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Silveira, J.L., Almeida, H.N.A.Z., <italic>et al.</italic> (2016) MobHet: Predicting Human Mobility Using Heterogeneous Data Sources. <italic>Computer Communications</italic>, 95, 54-68. https://doi.org/10.1016/j.comcom.2016.04.013 <pub-id pub-id-type="doi">10.1016/j.comcom.2016.04.013</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.comcom.2016.04.013">https://doi.org/10.1016/j.comcom.2016.04.013</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Silveira, J.L.</string-name>
              <string-name>Almeida, H.N.A.Z.</string-name>
            </person-group>
            <year>2016</year>
            <article-title>MobHet: Predicting Human Mobility Using Heterogeneous Data Sources</article-title>
            <source>Computer Communications</source>
            <volume>95</volume>
            <pub-id pub-id-type="doi">10.1016/j.comcom.2016.04.013</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B23">
        <label>23.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Lu, X., Wetter, E., Bharti, N., Tatem, A.J. and Bengtsson, L. (2013) Approaching the Limit of Predictability in Human Mobility. <italic>Scientific Reports</italic>, 3, Article No. 2923. https://doi.org/10.1038/srep02923 <pub-id pub-id-type="doi">10.1038/srep02923</pub-id><pub-id pub-id-type="pmid">24113276</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1038/srep02923">https://doi.org/10.1038/srep02923</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Lu, X.</string-name>
              <string-name>Wetter, E.</string-name>
              <string-name>Bharti, N.</string-name>
              <string-name>Tatem, A.J.</string-name>
              <string-name>Bengtsson, L.</string-name>
            </person-group>
            <year>2013</year>
            <article-title>Approaching the Limit of Predictability in Human Mobility</article-title>
            <source>Scientific Reports</source>
            <volume>3</volume>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.1038/srep02923</pub-id>
            <pub-id pub-id-type="pmid">24113276</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B24">
        <label>24.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Blondel, V.D., Decuyper, A. and Krings, G. (2015) A Survey of Results on Mobile Phone Datasets Analysis. <italic>EPJ Data Science</italic>, 4, Article No. 10. https://doi.org/10.1140/epjds/s13688-015-0046-0 <pub-id pub-id-type="doi">10.1140/epjds/s13688-015-0046-0</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1140/epjds/s13688-015-0046-0">https://doi.org/10.1140/epjds/s13688-015-0046-0</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Blondel, V.D.</string-name>
              <string-name>Decuyper, A.</string-name>
              <string-name>Krings, G.</string-name>
            </person-group>
            <year>2015</year>
            <article-title>A Survey of Results on Mobile Phone Datasets Analysis</article-title>
            <source>EPJ Data Science</source>
            <volume>4</volume>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.1140/epjds/s13688-015-0046-0</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B25">
        <label>25.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Singh, A.K., Singh, P., Singh, S. and Singh, A.K. (2011) Handover in Advanced Wireless Communication: A Survey. <italic>International Journal On Computer Science &amp;</italic><italic>Emerging Trends</italic>, 1, 510-515.</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Singh, A.K.</string-name>
              <string-name>Singh, P.</string-name>
              <string-name>Singh, S.</string-name>
              <string-name>Singh, A.K.</string-name>
            </person-group>
            <year>2011</year>
            <article-title>Handover in Advanced Wireless Communication: A Survey</article-title>
            <source>International Journal On Computer Science &amp; Emerging Trends</source>
            <volume>1</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B26">
        <label>26.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Bhuvaneswari, A. and George Dharma Prakash Raj, E. (2012) An Overview of Vertical Handoff Decision Making Algorithms. <italic>International Journal of Computer Network and Information Security</italic>, 4, 55-62. https://doi.org/10.5815/ijcnis.2012.09.07 <pub-id pub-id-type="doi">10.5815/ijcnis.2012.09.07</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.5815/ijcnis.2012.09.07">https://doi.org/10.5815/ijcnis.2012.09.07</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Bhuvaneswari, A.</string-name>
              <string-name>Raj, E.</string-name>
            </person-group>
            <year>2012</year>
            <article-title>An Overview of Vertical Handoff Decision Making Algorithms</article-title>
            <source>International Journal of Computer Network and Information Security</source>
            <volume>4</volume>
            <pub-id pub-id-type="doi">10.5815/ijcnis.2012.09.07</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B27">
        <label>27.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Jirapure, P.S. and Vidhate, A.V. (2014) Survey and Analysis of Handoff Decision Strategies for Heterogeneous Mobile Wireless Networks. <italic>International Journal of Advanced Research in Computer Science and Software</italic><italic>Engineering</italic>, 4, 703-713.</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Jirapure, P.S.</string-name>
              <string-name>Vidhate, A.V.</string-name>
            </person-group>
            <year>2014</year>
            <article-title>Survey and Analysis of Handoff Decision Strategies for Heterogeneous Mobile Wireless Networks</article-title>
            <source>International Journal of Advanced Research in Computer Science and Software Engineering</source>
            <volume>4</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B28">
        <label>28.</label>
        <citation-alternatives>
          <mixed-citation publication-type="thesis">Baumann, P. (2016) Human Mobility and Application Usage Prediction Alogrithm for Mobile Device. Master’s Thesis, Technische Universität Dresden.</mixed-citation>
          <element-citation publication-type="thesis">
            <person-group person-group-type="author">
              <string-name>Baumann, P.</string-name>
              <string-name>Thesis, T</string-name>
            </person-group>
            <year>2016</year>
            <article-title>Human Mobility and Application Usage Prediction Alogrithm for Mobile Device</article-title>
            <source>Master’s Thesis</source>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B29">
        <label>29.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Silla, C.N. and Freitas, A.A. (2010) A Survey of Hierarchical Classification across Different Application Domains. <italic>Data Mining and Knowledge Discovery</italic>, 22, 31-72. https://doi.org/10.1007/s10618-010-0175-9 <pub-id pub-id-type="doi">10.1007/s10618-010-0175-9</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s10618-010-0175-9">https://doi.org/10.1007/s10618-010-0175-9</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Silla, C.N.</string-name>
              <string-name>Freitas, A.A.</string-name>
            </person-group>
            <year>2010</year>
            <article-title>A Survey of Hierarchical Classification across Different Application Domains</article-title>
            <source>Data Mining and Knowledge Discovery</source>
            <volume>22</volume>
            <pub-id pub-id-type="doi">10.1007/s10618-010-0175-9</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B30">
        <label>30.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Ekman, F., Keränen, A., Karvo, J. and Ott, J. (2008) Working Day Movement Model. <italic>Proceedings of the</italic> 1 <italic>st ACM SIGMOBILE Workshop on Mobility Models</italic>, Hong Kong, 26 May 2008, 33-40. https://doi.org/10.1145/1374688.1374695 <pub-id pub-id-type="doi">10.1145/1374688.1374695</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/1374688.1374695">https://doi.org/10.1145/1374688.1374695</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Ekman, F.</string-name>
              <string-name>Karvo, J.</string-name>
              <string-name>Ott, J.</string-name>
              <string-name>Models, H</string-name>
            </person-group>
            <year>2008</year>
            <article-title>Working Day Movement Model</article-title>
            <source>Proceedings of the 1st ACM SIGMOBILE Workshop on Mobility Models</source>
            <volume>26</volume>
            <pub-id pub-id-type="doi">10.1145/1374688.1374695</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B31">
        <label>31.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Smith, G., Wieser, R., Goulding, J. and Barrack, D. (2014) A Refined Limit on the Predictability of Human Mobility. 2014 <italic>IEEE International Conference on Pervasive Computing and Communications</italic>( <italic>PerCom</italic>), Budapest, 24-28 March 2014, 88-94. https://doi.org/10.1109/percom.2014.6813948 <pub-id pub-id-type="doi">10.1109/percom.2014.6813948</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/percom.2014.6813948">https://doi.org/10.1109/percom.2014.6813948</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Smith, G.</string-name>
              <string-name>Wieser, R.</string-name>
              <string-name>Goulding, J.</string-name>
              <string-name>Barrack, D.</string-name>
            </person-group>
            <year>2014</year>
            <article-title>A Refined Limit on the Predictability of Human Mobility</article-title>
            <source>2014 IEEE International Conference on Pervasive Computing and Communications (PerCom)</source>
            <volume>24</volume>
            <pub-id pub-id-type="doi">10.1109/percom.2014.6813948</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B32">
        <label>32.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Hassane, A.A.I., Li, R.F. and Zeng, F.Z. (2012) Handover Decision Based on User Preferences in Heterogeneous Wireless Networks. <italic>International Journal of Computer Science and Telecommunications</italic>, 3, 15-20.</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Hassane, A.A.I.</string-name>
              <string-name>Li, R.F.</string-name>
              <string-name>Zeng, F.Z.</string-name>
            </person-group>
            <year>2012</year>
            <article-title>Handover Decision Based on User Preferences in Heterogeneous Wireless Networks</article-title>
            <source>International Journal of Computer Science and Telecommunications</source>
            <volume>3</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B33">
        <label>33.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">You, L., Liu, C.G. and Tong, S. (2011) Community Medical Network (CMN): Architecture and Implementation. 2011 <italic>Global Mobile Congress</italic>, Shanghai, 17-18 October 2011, 1-6. https://doi.org/10.1109/gmc.2011.6103930 <pub-id pub-id-type="doi">10.1109/gmc.2011.6103930</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/gmc.2011.6103930">https://doi.org/10.1109/gmc.2011.6103930</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>You, L.</string-name>
              <string-name>Liu, C.G.</string-name>
              <string-name>Tong, S.</string-name>
              <string-name>Congress, S</string-name>
            </person-group>
            <year>2011</year>
            <article-title>Community Medical Network (CMN): Architecture and Implementation</article-title>
            <source>2011 Global Mobile Congress</source>
            <volume>17</volume>
            <pub-id pub-id-type="doi">10.1109/gmc.2011.6103930</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B34">
        <label>34.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Zhang, N. and Holtzman, J.M. (1998) Analysis of a CDMA Soft-Handoff Algorithm. <italic>IEEE Transactions on Vehicular Technology</italic>, 47, 710-714. https://doi.org/10.1109/25.669108 <pub-id pub-id-type="doi">10.1109/25.669108</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/25.669108">https://doi.org/10.1109/25.669108</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Zhang, N.</string-name>
              <string-name>Holtzman, J.M.</string-name>
            </person-group>
            <year>1998</year>
            <article-title>Analysis of a CDMA Soft-Handoff Algorithm</article-title>
            <source>IEEE Transactions on Vehicular Technology</source>
            <volume>47</volume>
            <pub-id pub-id-type="doi">10.1109/25.669108</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B35">
        <label>35.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Prasad, R. (2007) Personal Networks and 4G. <italic>ELMAR</italic> 2007, Zadar, 12-14 September 2007, 1-6. https://doi.org/10.1109/elmar.2007.4418788 <pub-id pub-id-type="doi">10.1109/elmar.2007.4418788</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/elmar.2007.4418788">https://doi.org/10.1109/elmar.2007.4418788</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Prasad, R.</string-name>
            </person-group>
            <year>2007</year>
            <article-title>Personal Networks and 4G</article-title>
            <source>ELMAR 2007</source>
            <volume>12</volume>
            <pub-id pub-id-type="doi">10.1109/elmar.2007.4418788</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B36">
        <label>36.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Celić, L., Varga, M., Pozaić, T., Žulj, S., Džaja, D. and Magjarević, R. (2013) WBAN for Physical Activity Monitoring in Health Care and Wellness. In: Long, M., Ed., <italic>World Congress on Medical Physics and Biomedical Engineering</italic>, Springer, 2228-2231. https://doi.org/10.1007/978-3-642-29305-4_585 <pub-id pub-id-type="doi">10.1007/978-3-642-29305-4_585</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-642-29305-4_585">https://doi.org/10.1007/978-3-642-29305-4_585</ext-link></mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Varga, M.</string-name>
              <string-name>Long, M.</string-name>
              <string-name>Engineering, S</string-name>
            </person-group>
            <year>2013</year>
            <article-title>WBAN for Physical Activity Monitoring in Health Care and Wellness</article-title>
            <source>In: Long</source>
            <volume>2228</volume>
            <pub-id pub-id-type="doi">10.1007/978-3-642-29305-4_585</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B37">
        <label>37.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Džaja, D., Varga, M., Šeketa, G., Žulj, S., Celić, L., Lacković, I., <italic>et al.</italic> (2015) System for Assisted Exercising and Qualitative Exercise Assessment. In: Lacković, I. and Vasic, D., Eds., 6 <italic>th European Conference of the International Federation for Medical and Biological Engineering</italic>, Springer, 682-686. https://doi.org/10.1007/978-3-319-11128-5_170 <pub-id pub-id-type="doi">10.1007/978-3-319-11128-5_170</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-319-11128-5_170">https://doi.org/10.1007/978-3-319-11128-5_170</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Varga, M.</string-name>
              <string-name>Vasic, D.</string-name>
              <string-name>Engineering, S</string-name>
            </person-group>
            <year>2015</year>
            <article-title>System for Assisted Exercising and Qualitative Exercise Assessment</article-title>
            <source>In: Lacković</source>
            <volume>682</volume>
            <pub-id pub-id-type="doi">10.1007/978-3-319-11128-5_170</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B38">
        <label>38.</label>
        <citation-alternatives>
          <mixed-citation publication-type="thesis">Ali, M. (2012) Load Balancing in Heterogeneous Wireless Communication Networks. Master’s Thesis.</mixed-citation>
          <element-citation publication-type="thesis">
            <person-group person-group-type="author">
              <string-name>Ali, M.</string-name>
            </person-group>
            <year>2012</year>
            <article-title>Load Balancing in Heterogeneous Wireless Communication Networks</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B39">
        <label>39.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Hamaguchi, K., <italic>et al</italic>. (2012) Telecommunication Systems in Smart Cities. <italic>Hitachi</italic><italic>Review</italic>, 61, 152-158.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Hamaguchi, K.</string-name>
            </person-group>
            <year>2012</year>
            <article-title>Telecommunication Systems in Smart Cities</article-title>
            <source>Hitachi Review</source>
            <volume>61</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B40">
        <label>40.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Chen, S.Z., Shi, Y. and Ai, B.H.M. (2016) Mobility Management Principle, Technology and Applications. Springer.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Chen, S.Z.</string-name>
              <string-name>Shi, Y.</string-name>
              <string-name>Ai, B.H.M.</string-name>
              <string-name>Principle, T</string-name>
            </person-group>
            <year>2016</year>
            <article-title>Mobility Management Principle, Technology and Applications</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B41">
        <label>41.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Sathya, V., Kala, S.M., Bhupeshraj, S. and Tamma, B.R. (2020) RAPTAP: A Socio-Inspired Approach to Resource Allocation and Interference Management in Dense Small Cells. <italic>Wireless Networks</italic>, 27, 441-464. https://doi.org/10.1007/s11276-020-02460-7 <pub-id pub-id-type="doi">10.1007/s11276-020-02460-7</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s11276-020-02460-7">https://doi.org/10.1007/s11276-020-02460-7</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Sathya, V.</string-name>
              <string-name>Kala, S.M.</string-name>
              <string-name>Bhupeshraj, S.</string-name>
              <string-name>Tamma, B.R.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>RAPTAP: A Socio-Inspired Approach to Resource Allocation and Interference Management in Dense Small Cells</article-title>
            <source>Wireless Networks</source>
            <volume>27</volume>
            <pub-id pub-id-type="doi">10.1007/s11276-020-02460-7</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B42">
        <label>42.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Cao, J.N. and Zhang, C.S. (2014) Seamless and Secure Communications over Heterogeneous Wireless Networks. Springer.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Cao, J.N.</string-name>
              <string-name>Zhang, C.S.</string-name>
            </person-group>
            <year>2014</year>
            <article-title>Seamless and Secure Communications over Heterogeneous Wireless Networks</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B43">
        <label>43.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Xu, Y., Gui, G., Gacanin, H. and Adachi, F. (2021) A Survey on Resource Allocation for 5G Heterogeneous Networks: Current Research, Future Trends, and Challenges. <italic>IEEE Communications Surveys &amp; Tutorials</italic>, 23, 668-695. https://doi.org/10.1109/comst.2021.3059896 <pub-id pub-id-type="doi">10.1109/comst.2021.3059896</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/comst.2021.3059896">https://doi.org/10.1109/comst.2021.3059896</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Xu, Y.</string-name>
              <string-name>Gui, G.</string-name>
              <string-name>Gacanin, H.</string-name>
              <string-name>Adachi, F.</string-name>
              <string-name>Research, F</string-name>
            </person-group>
            <year>2021</year>
            <article-title>A Survey on Resource Allocation for 5G Heterogeneous Networks: Current Research, Future Trends, and Challenges</article-title>
            <source>IEEE Communications Surveys &amp; Tutorials</source>
            <volume>23</volume>
            <pub-id pub-id-type="doi">10.1109/comst.2021.3059896</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B44">
        <label>44.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Pitoura, E. and Samaras, G. (2001) Locating Objects in Mobile Computing. <italic>IEEE Transactions on Knowledge and Data Engineering</italic>, 13, 571-592. https://doi.org/10.1109/69.940733 <pub-id pub-id-type="doi">10.1109/69.940733</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/69.940733">https://doi.org/10.1109/69.940733</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Pitoura, E.</string-name>
              <string-name>Samaras, G.</string-name>
            </person-group>
            <year>2001</year>
            <article-title>Locating Objects in Mobile Computing</article-title>
            <source>IEEE Transactions on Knowledge and Data Engineering</source>
            <volume>13</volume>
            <pub-id pub-id-type="doi">10.1109/69.940733</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B45">
        <label>45.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Alablani, I.A. and Arafah, M.A. (2021) Applying a Dwell Time-Based 5G V2X Cell Selection Strategy in the City of Los Angeles, California. <italic>IEEE Access</italic>, 9, 153909-153925. https://doi.org/10.1109/access.2021.3128141 <pub-id pub-id-type="doi">10.1109/access.2021.3128141</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/access.2021.3128141">https://doi.org/10.1109/access.2021.3128141</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Alablani, I.A.</string-name>
              <string-name>Arafah, M.A.</string-name>
              <string-name>Angeles, C</string-name>
            </person-group>
            <year>2021</year>
            <article-title>Applying a Dwell Time-Based 5G V2X Cell Selection Strategy in the City of Los Angeles, California</article-title>
            <source>IEEE Access</source>
            <volume>9</volume>
            <pub-id pub-id-type="doi">10.1109/access.2021.3128141</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B46">
        <label>46.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Tera, S.P., <italic>et al.</italic> (2015) Toward 6G: An Overview of the Next Generation of Intelligent Network Connectivity. <italic>IEEE Access</italic>, 13, 925-961. https://doi.org/10.1109/ACCESS.2024.3523327 <pub-id pub-id-type="doi">10.1109/ACCESS.2024.3523327</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/ACCESS.2024.3523327">https://doi.org/10.1109/ACCESS.2024.3523327</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Tera, S.P.</string-name>
            </person-group>
            <year>2015</year>
            <article-title>Toward 6G: An Overview of the Next Generation of Intelligent Network Connectivity</article-title>
            <source>IEEE Access</source>
            <volume>13</volume>
            <pub-id pub-id-type="doi">10.1109/ACCESS.2024.3523327</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B47">
        <label>47.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Bing, B. (2008) Emerging Technologies in Wireless LANs—Theory, Design and Deployment. Cambridge University Press.</mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Bing, B.</string-name>
              <string-name>Theory, D</string-name>
            </person-group>
            <year>2008</year>
            <article-title>Emerging Technologies in Wireless LANs—Theory, Design and Deployment</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B48">
        <label>48.</label>
        <citation-alternatives>
          <mixed-citation publication-type="thesis">Hossmann, T. (2006) Mobility Prediction in MANETs. Master’s Thesis, Swiss Federal Institute of Technology (ETH) in Zürich.</mixed-citation>
          <element-citation publication-type="thesis">
            <person-group person-group-type="author">
              <string-name>Hossmann, T.</string-name>
              <string-name>Thesis, S</string-name>
            </person-group>
            <year>2006</year>
            <article-title>Mobility Prediction in MANETs</article-title>
            <source>Master’s Thesis</source>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B49">
        <label>49.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">IEEE (2009) IEEE Standard for Local and Metropolitan Area Networks—Part 21: Media Independent Handover Services. IEEE Std 802.21-2008.</mixed-citation>
          <element-citation publication-type="other">
            <year>2009</year>
            <article-title>IEEE Standard for Local and Metropolitan Area Networks—Part 21: Media Independent Handover Services</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B50">
        <label>50.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Mau, D.O., Wang, J., Wang, L., Hu, L., Ma, Y. and Zhang, Y. (2014) SIMON: Seamless Service Migration in Mobile Network. In: Leung, V., Chen, M., Wan, J. and Zhang, Y., Eds., <italic>Testbeds and Research Infrastructure</italic>: <italic>Development of Networks and Communities</italic>, Springer, 261-270. https://doi.org/10.1007/978-3-319-13326-3_25 <pub-id pub-id-type="doi">10.1007/978-3-319-13326-3_25</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-319-13326-3_25">https://doi.org/10.1007/978-3-319-13326-3_25</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Mau, D.O.</string-name>
              <string-name>Wang, J.</string-name>
              <string-name>Wang, L.</string-name>
              <string-name>Hu, L.</string-name>
              <string-name>Ma, Y.</string-name>
              <string-name>Zhang, Y.</string-name>
              <string-name>Leung, V.</string-name>
              <string-name>Chen, M.</string-name>
              <string-name>Wan, J.</string-name>
              <string-name>Zhang, Y.</string-name>
              <string-name>Communities, S</string-name>
            </person-group>
            <year>2014</year>
            <article-title>SIMON: Seamless Service Migration in Mobile Network</article-title>
            <source>In: Leung</source>
            <volume>261</volume>
            <pub-id pub-id-type="doi">10.1007/978-3-319-13326-3_25</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B51">
        <label>51.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Liu, Y.H. and Yang, Z. (2011) Location, Localization, and Localizability. Springer.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Liu, Y.H.</string-name>
              <string-name>Yang, Z.</string-name>
              <string-name>Location, L</string-name>
            </person-group>
            <year>2011</year>
            <article-title>Location, Localization, and Localizability</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B52">
        <label>52.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Sanford, J.F., Potkonjak, M. and Slijepcevic, S. (2012) Localization in Wireless Networks. Springer.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Sanford, J.F.</string-name>
              <string-name>Potkonjak, M.</string-name>
              <string-name>Slijepcevic, S.</string-name>
            </person-group>
            <year>2012</year>
            <article-title>Localization in Wireless Networks</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B53">
        <label>53.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Chowdhury, M.Z., Shahjalal, M., Ahmed, S. and Jang, Y.M. (2020) 6G Wireless Communication Systems: Applications, Requirements, Technologies, Challenges, and Research Directions. <italic>IEEE Open Journal of the Communications Society</italic>, 1, 957-975. https://doi.org/10.1109/ojcoms.2020.3010270 <pub-id pub-id-type="doi">10.1109/ojcoms.2020.3010270</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/ojcoms.2020.3010270">https://doi.org/10.1109/ojcoms.2020.3010270</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Chowdhury, M.Z.</string-name>
              <string-name>Shahjalal, M.</string-name>
              <string-name>Ahmed, S.</string-name>
              <string-name>Jang, Y.M.</string-name>
              <string-name>Applications, R</string-name>
              <string-name>Technologies, C</string-name>
            </person-group>
            <year>2020</year>
            <article-title>6G Wireless Communication Systems: Applications, Requirements, Technologies, Challenges, and Research Directions</article-title>
            <source>IEEE Open Journal of the Communications Society</source>
            <volume>1</volume>
            <pub-id pub-id-type="doi">10.1109/ojcoms.2020.3010270</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B54">
        <label>54.</label>
        <citation-alternatives>
          <mixed-citation publication-type="thesis">Andreas Klein, D.I. (2014) Context Awareness for Enhancing Heterogeneous Access Management and Self-Optimizing Networks. PhD Thesis.</mixed-citation>
          <element-citation publication-type="thesis">
            <person-group person-group-type="author">
              <string-name>Klein, D.I.</string-name>
            </person-group>
            <year>2014</year>
            <article-title>Context Awareness for Enhancing Heterogeneous Access Management and Self-Optimizing Networks</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B55">
        <label>55.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wu, C.H., Lin, H.P. and Lan, L.S. (2002) A New Analytic Framework for Dynamic Mobility Management of PCS Networks. <italic>IEEE Transactions on Mobile Computing</italic>, 1, 208-220. https://doi.org/10.1109/tmc.2002.1081756 <pub-id pub-id-type="doi">10.1109/tmc.2002.1081756</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/tmc.2002.1081756">https://doi.org/10.1109/tmc.2002.1081756</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wu, C.H.</string-name>
              <string-name>Lin, H.P.</string-name>
              <string-name>Lan, L.S.</string-name>
            </person-group>
            <year>2002</year>
            <article-title>A New Analytic Framework for Dynamic Mobility Management of PCS Networks</article-title>
            <source>IEEE Transactions on Mobile Computing</source>
            <volume>1</volume>
            <pub-id pub-id-type="doi">10.1109/tmc.2002.1081756</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B56">
        <label>56.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Thiyagarajan, S. and Sedhu, S. (2014) NIA Based Mobility Management Technique for Seamless Roaming in Heterogeneous Networks. <italic>International Journal of Future Generation Communication and Networking</italic>, 7, 21-32. https://doi.org/10.14257/ijfgcn.2014.7.6.03 <pub-id pub-id-type="doi">10.14257/ijfgcn.2014.7.6.03</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.14257/ijfgcn.2014.7.6.03">https://doi.org/10.14257/ijfgcn.2014.7.6.03</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Thiyagarajan, S.</string-name>
              <string-name>Sedhu, S.</string-name>
            </person-group>
            <year>2014</year>
            <article-title>NIA Based Mobility Management Technique for Seamless Roaming in Heterogeneous Networks</article-title>
            <source>International Journal of Future Generation Communication and Networking</source>
            <volume>7</volume>
            <pub-id pub-id-type="doi">10.14257/ijfgcn.2014.7.6.03</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
    </ref-list>
  </back>
</article>