Abstract: Handover in LTE occurs when a device moves from the cell coverage serving it towards another; a process where the user established session must not be interrupted due to this cell change. Handovers in LTE are classified as hard ones, since the link with the serving cell is interrupted before establishing the new link with the target cell. This entails a larger failure risk and, consequently, a potential deterioration in the quality of service. This article presents a review of the handover algorithms in LTE, focusing on the ones oriented to massive means of transport. We show how the new algorithms offer a larger success in handovers, increasing the networkdata rate. This indicates that factors such as speed, position, and direction should be included in the algorithms to improve the handover in means of transport. We also present the algorithms focused on mobile relays such as an important study field for future research works.
Keywords:Handover in LTEHandover in LTE, massive means of transport massive means of transport, mobile femtocells mobile femtocells, mobile relays mobile relays.
Resumen: El traspaso en LTE se presenta cuando un equipo pasa de la cobertura de una celda a la de otra, un proceso en el que se debe asegurar que el usuario no vea interrumpida su sesión, como efecto de ese cambio de celda. Los traspasos en LTE son del tipo duro, en ellos, el enlace con la celda servidora se interrumpe antes de establecer el nuevo enlace con la celda destino, lo que conlleva a un mayor riesgo de falla y con ello a un probable deterioro de la calidad del servicio al usuario. Este artículo revisa algoritmos de traspaso LTE, enfocándose en aquellos orientados a medios de trasporte masivo. Muestra cómo los nuevos algoritmos ofrecen una tasa mayor de traspasos exitosos y con ello una mejor tasa de transferencia de datos; evidencia que factores como la velocidad, la posición y la dirección deben ser incluidos en los algoritmos dirigidos a mejorar el traspaso en medios de transporte; y presenta a los algoritmos enfocados en relays móviles, como un importante campo de estudio para futuras investigaciones.
Palabras clave: Traspaso en LTE, relays móviles, femtoceldas móviles, medios de transporte masivo.
Resumo: A transferência em LTE ocorre quando um dispositivo passa da cobertura de uma célula para outra, um processo no qual deve ser assegurado que o usuário não veja sua sessão interrompida, como resultado dessa mudança de célula. As transferências em LTE são do tipo duro, nelas, o link com a célula do servidor é interrompido antes de se estabelecer o novo link com a célula alvo, o que leva a um maior risco de falha e, portanto, a uma provável deterioração da qualidade do serviço ao usuário. Este artigo revisa os algoritmos de transferência LTE, com foco naqueles orientados a meios de transporte massivo. Mostra como os novos algoritmos oferecem uma taxa maior de transferências bem-sucedidas e, com isso, uma melhor taxa de transferência de dados; evidencia de que fatores como a velocidade, a posição e a direção devem ser incluídos nos algoritmos que visam melhorar a transferência nos meios de transporte; e apresenta os algoritmos focados em relés móveis, como um importante campo de estudo para futuras pesquisas.
Palavras-chave: Transferência em LTE, relés móveis, femtocélulas móveis, meios de transporte massivo.
State of the Art
Handover Algorithms in LTE Networks for Massive Means of Transport
Algoritmos de traspaso de redes LTE en medios de transporte masivo
Algoritmos de transferência de redes LTE em meios de transporte massivo

Received: 23 April 2018
Accepted: 22 May 2018
The growing trend in the mobile data traffic is mainly focused on the indoor traffic; hence, the small cell solutions (i.e., microcells, picocells, and femtocells) have arisen to handle this traffic and the deployment of diverse networks (3rd Generation Partnership Project - Technical Specification Group Radio Access Network [3GPP-TSGRAN], 2013; 3GPP TSGRAN, 2014b) are some of the aspects with larger interest and development nowadays (Holma, Toskala, & Reunanen, 2016).
The massive means of transport are not isolated from that trend. Considering the large number of users in the public transportation and their high mobility within the cellular networks coverage, a large number of terminals or user equipment [UE] must execute handover processes between cells. This demands a high load to the control plane, increases the mobility signaling, and affects the successfully executed handovers rate.
Within LTE, the handover process is executed when a UE moves from the cell coverage serving it towards another. Hence, this process must ensure that the session the user has continues and does not suffer interruptions when the cell change is performed. Furthermore, all the handovers performed in LTE are from the hard type, that is, the link with the current cell is interrupted before establishing the new link with the target cell. This process generates a larger load to the control plane and entails that the handover process might present a higher failure risk. With the increase in the failed handovers, there is a direct increase in the Radio Bearers [RB] cuts established by the terminals, generating degradation in the signals and finally, impacting the service provided to the end users.
Currently, the mobile operators try to provide coverage in trains, subways, and large avenues with macro cells; but these cells do not provide the enough quality to maintain the performance indicators in acceptable thresholds. For this reason, these macro cells do not provide a good user experience in those places.
Considering the idea in the previous paragraph, the 3GPP-TSGRAN (2010) has worked in the technical report TR 36.806. Within it, four architectures for fixed relays have been defined, which consist of base stations (macro) allowing the signal retransmission from a donor cell [DeNB, DonoreNodeB] towards the UEs. Contrary to the repeaters, the relays have Forward Error Correction [FEC] capabilities and they can (or cannot) have a unique Physical Cell Identity [PCI].
After, the 3GPP-TSGRAN (2014a) worked in an evolution of their previous report (TR 36.836), where six architectures for mobile relays were defined. This, in order to establish the foundations to provide service to the people using high speed trains via the implementation of backhaul mobile wireless networks. The mobile relays are base stations implemented in high speed trains. They are wirelessly connected to a DeNB through a Un radio interface.
The mobile relay provides service to the users inside the vehicle and adds to the functionalities of a traditional eNB a subset of UE functionalities to connect to the DeNB. When the connection of the Un interface changes of DeNB, the mobile relay maintains the connectivity uninterrupted in both the end user plane and in the control plane of the served UE towards the elements in the core of the network (3GPP TSGRAN, 2014a).
From the six architectures defined in the TR 36.836, two were selected to provide services in the upcoming 5G (5G Forum, 2016).
Other proposals, such as the ones described by Haider, Dianati, and Tafazolli (2011) and Sui, Ren, and Sun (2013) show the positive impact —at the system level— of the mobile femtocells introduction. The concept of mobile femtocell is defined based on the mobile relay and femtocell concepts. It consists of a small cell with mobility features, hence, it can dynamically change the connection with the network core. All the users served by the femtocell are seen as a single unit by the eNodeB and it can be easily deployed in public transportation vehicles. In practical terms, it can be considered as a way to deploy mobile relays (Haider et al., 2011).
Rathod (2013) highlights the advantages —in the data transfer level— of the indoor cells usage in LTE networks; Ulvan, Bestak, and Ulvan (2010) show mechanisms to optimize the handover process; and Karimi, Liu , and Wang (2012) present a mobile femtocell implementation proposal in high speed trains. This demonstrates that, with the advantages in the implementation of this type of solutions in massive means of transport, important advantages are reached.
On the other hand, the handover in LTE networks has a large importance to guarantee to the users the maintenance of the data sessions established with the network. , Ahmad, Sundararajan, Othman, and Ismail (2017) propose variations to the traditional handover algorightm, seeking to obtain better results in the successfully performed handovers rate by manipulating several variables such as: mobility patterns, position, Handover Margin [HOM], and Time to Trigger [TTT]. Nevertheless, most of the research works are oriented towards a traditional LTE architecture.
Due to the large number of users in massive means of transport, a handover process considering the features and conditions of the mobile relays or femtocells can improve notably the rate of successful handovers, produce a lower number of session interruptions, and offer a better service experience for all the UEs served inside them.
The current research article studies the handover process in LTE networks by initially assessing other works related with the handover in traditional networks. After that, we focus in handover algorithm proposals oriented to massive means of transport.
Initially, we proceeded to review the 3GPP Technical reports related with the handover process in LTE supporting mobile relays. This, to understand the standard handover process proposed in those reports. In general, we reviewed research works between 2009 and 2017, together with specialized articles about fixed and mobile relays and femtocells. After, we reviewed documents related with the handover process, to finally focus our work on the algorithms related with the handover process in LTE networks in massive means of transport.
Within LTE, the UEs can be in two modes: connected or free. In the first one, they introduce the handover process; in the second, they execute the initial cell selection and re-selection processes. The handover process allows to transfer a data session from one cell to another without interruptions. It can be intra-frequency, inter-frequency over the same system, or intersystem towards UMTS or GSM networks.
The handover is triggered via events (3GPP-TSGRAN, 2015) where either the serving or the neighbor cell exceed certain configured Reference Signal Received Power [RSRP] threshold. In LTE, the following intra Radio Access Technology [RAT] events exist:
• A1, the level of the serving cell is higher than the configured threshold;
• A2, the level of the serving cell is lower than the configured threshold;
• A3, the level of a neighbor cell is somewhat higher than the level of the serving cell;
• A4, the level of the neighbor cell is higher than the configured threshold; and
• A5, the level of the serving cell is lower than a first threshold and the level of the neighbor cell is higher than the second threshold.
In compliance with the previous events, two handover types are available: based on the A3 event, as shown in Figure 1; and based on the event A5, shown in Figure 2.


The HOM allows to configure the difference in the signal level of the target cell over the serving one, i.e., the RSRP level of the target cell shall be superior in that margin over the current cell. The TTT allows to delay the handover start time to avoid unnecessary handovers that produce a ping-pong effect. Consequently, the destination cell must maintain the highest signal level at least during the TTT to avoid the triggering of unnecessary handovers during variations of possible target cells.
The 3GPP specifies six alternatives regarding the architecture for mobile relays, called: Alt.1, Alt.2, eAlt.2-1, eAlt.2-2, eAlt.2-3, and Alt.4 (3GPP TSGRAN, 2014a). Within the Alt.1 architecture —also called Relay Full L3—, the SGW/PGW entities serving the relays network are separated from the donor cell. One of the advantages of this architecture is the fact of providing a simpler handover and during the switch of the return network link through the source and sink donor stations (means of transport in movement), a stable anchor point is maintained at IP level. This ensures the group mobility support of the users served by the relay (Krendzel, 2013).
In Figure 3, we show the handover process for the Alt.1 architecture of mobile relays, which is identical to the eNB handover process for a defined UE by the 3GPP (3GPP TSGRAN, 2017).
Dimou et al., (2009) assessed the hard handover behavior defined by the 3GPP for LTE networks. They performed several simulations in different environments, varying the cell size, traffic load, and UE speed. Their results show that, for cells with a radius up to 1 km, UE speeds up to 120 km/h, and a system with large traffic loads, the handover failure rate was between 0% and 2.2%. For systems with medium and low traffic load and speeds up to 250 km/h, the failure rate was under 1.3%.
Ahmad et al., (2017) presented a review of the LTE/LTE-A control plane, the several phases, requirements, parameters, and features of the handover process. Further, they present a study of a significative amount of algorithm proposals for the handover process in LTE-A networks. Their work classifies the revised proposals in four kinds depending on its base in: algorithms based on mobility patterns, based on direction and location, based on self-optimization, and based on multiple hops usage.
The algorithms based on mobility patterns (Watanabe, Matsunaga, Kobayashi, Sugahara, & Hamabe, 2011; Wang, Huang, & Tung, 2014; Tao, Yuan, Hong, & Zhang, 2016; Ge, Wen, & Zheng, 2009) seek the construction of a mobility history for the user; this, in order to predict the UE movements inside the network. This way, they also search to predict the candidate cells for the handover. Tao et al., (2016) propose the reconnaissance of an intelligent mobility pattern —called Smart-HO—, executed in three stages: pattern modelling, pattern reconnaissance, and implementation of the intelligent handover. Watanabe et al., (2011) propose a scheme for handling the list of neighbor cells, giving higher priority to the new detected cells over the existing ones. Wang et al., (2014) and Ge et al., (2009) propose handover schemes based on the construction of mobility records for the users.
The algorithms based on direction and location group that work with the UE location via GPS are characterized by the fact of knowing the network topology and the UE movements. They seek to improve the handover process (Chen, Kim, & Yoo, 2014; Chang, Wang, Hu, & Kao, 2013; Lee, Cho, & Kim, 2005). Likewise, Chen et al., (2014); Chang et al., (2013) and Wang, Kao, Hsiao, and Chang (2014) propose a handover technique based on the tracking of the latest UE positions using GPS. By having the previous positions —P1 and P2— and the current position (P3), the technique tries to determine the future position and the corresponding candidate cell for the handover, achieving a reduction in the number of unnecessary handovers.
The algorithms based on self-optimization are featured by performing a self-adjustment process in the network parameters (Lee, Gil, & Kim, 2010; Yang, Deng, Jiang, & Deng, 2015; Balan, Jansen, & Sas, 2011; Jansen, Balan, & Turk, 2010). Equally, Isa, Baba, and Yusof (2015) describe methods for the handover optimization such as the modification in the RSS threshold and hysteresis, modification of the TTT, and modification of the filtering action for A3 events in the handover. Li and Wang (2013); Sinclair, Harle, Glover, Irvine, and Atkinson (2013); and Muñoz, Barco, and Fortes (2014) propose mechanisms for the handover treatment in LTE networks via implemented functionalities in Self-Organizing Networks [SON] tools. Lee et al., (2010) propose an adaptive hysteresis scheme using a costs function algorithm seeking to reduce the failures in the radio link during the handover process. The costs function depends on the sum of the weights of three parameters: the load balance between the served and target cell, the UE speed, and the Quality of Service [QoS] (if real-time services are relevant or not).
Zheng, Wang, Zhang, Lu, and Wen (2009) propose an optimization of the handover parameters by considering the number of limit crosses per cell, which can be obtained by counting the changes in the cell identificator. The TTT, hysteresis, and measurement interval parameters are adjusted by comparing the number of handovers by ping-pong effect with the number of handovers in a measurement period.
Su, Wen, Zhang and Zheng (2010) propose an optimization mechanism of the handover parameters for SON by considering the number of limit crosses per cell and the number of handovers executed by the UE. The measurement of the signal intensity is exclusively used to select the destination cell in the handover decision.
The algorithms based on multiple hops (Jengyueng, Chunchuan, & Yiting, 2015; Lin, Sandrasegaran, & Zhu, 2012; Lin, Sandrasegaran, & Reeves, 2012; Tu, Lin, & Chang, 2012; Chen, Mai, & Yang, 2012) use new features of the access networks supported by LTE-A. The handover procedure is affected by the intercell interference, bandwidth, coverage, and cellscapacity. Therefore, the handover process might be adapted to the new features. Within this group, the algorithms related with relays and Coordinated Multipoint [CoMP] techniques are employed. Jengyueng et al., (2015) and Chen et al., (2012) propose an intelligent forwarding mechanism to improve the handover performance in LTE-A networks with relay nodes. Lin, Sandrasegaran, and Zhu (2012), and Lin, Sandrasegaran, and Reeves (2012) propose handover algorithms with CoMP JP support. Lin, Sandrasegaran, and Zhu (2012) propose a handover algorithm with CoMP integrated capacity, whose purpose is to ensure the efficient use of the radio resources regarding capacity and channel quality. This is done by employing historical records of the RB usage in the cell and, consequently, defining a new handover parameter called capacity indicator. This parameter is employed by the algorithm to determine an appropriate destination cell. Tu et al., (2012) propose a handover scheme based on prediction to allow the eNB to have a potential handover trigger within the report period of the UE, where the channel quality from both the donor and the relay are predicted through a Markov decision process.
In the following sections, we describe other research works relative to handover algorithms and specially focused on means of transport. We have organized the works in four groups: algorithms proposing modifications in the network architecture, algorithms associated to the UE mobility, set-up algorithms based on the signal level, and algorithms focused on mobile relays.
Here, we present the works involving modifications to the standard network architecture or proposing a different handover type than the hard handover used in LTE.
Wang, Ren, and Tu (2011) describe a soft handover for TD-LTE in a high-speed trains scenario by seeking the reduction in the number of Radio Link Failure [RLF] and the ping-pong effect. Furthermore, the proposal pursues the minimization in the interruption time caused by the high speeds to provide a satisfactory user experience. The algorithm grants a list for each UE inside the scenario and each of these handover lists has the control information in the downlink of two neighbor eNBs. Nevertheless, only a single transmission in the downlink is considered from the eNB with better RSRP. The algorithm is based on the eNodeB adding/removal steps to the list, depending on the RSRP thresholds.
On the other hand, the semi-soft handover algorithm for multi-bearer systems based on the Site Selection Diversity Transmission [SSDT] is a macro-diversity method employed in soft handovers over WCDMA networks. Its objective is to reduce the inter-cell interference caused by multiple transmissions while the transmission is performed in the downlink from the best serving cell. In the semi-soft handover, the bandwidth is divided in two different bands: control and data. The control band, with a frequency reuse factor of 7, is divided in 7 sub-bands, each one of them handled by a cell. A UE can —simultaneously— receive information from all the neighbor cells through the control channels and select the cell with higher RSRP to transmit packets via SSDT. According to the simulations performed in the study, a better performance in the number of successful handovers is obtained; nevertheless, when control signals are received from all the neighbor cells, the number of headers in the signaling is increased (Lee, Son & Lee, 2009).
The scheme proposed by Lee, Chuang, Chen, and Sun (2014) is based on LTE femtocells using multiple output interfaces —called Multiple Egress Network – Network Mobility [MEN-NEMO]— to reduce the latency and the number of headers in the handover process. For the network core architecture, the authors propose the usage of improved femtocells deployed in the train to provide service to the passengers’ UEs. In accordance with the performed simulations, the proposed scheme was able to reduce the latency and the number of headers in the signaling for the handover processes.
Here, we present some algorithms that use the UE speed and position to trigger the handover process. Luan, Wu, Shen, Ye, and He (2012) propose two types of LTE handover algorithms for high speed trains, called fast handover algorithms: one based on the UE speed and the other based on the TTT optimization. The first one proposes to adjust the handover hysteresis and TTT dynamically and according to the train speed to ensure a successful handover. With this, when the speed is increased, both the hysteresis and the TTT suffer small decrements. According with the simulations, the Handover Success Rate [HSR] is improved for certain values of Signal to Interference plus Noise Ratio [SINR]. Within one second, the RSRP and RSRQ variations from the serving and destination cells produced by the train speed are considered. Therefore, the authors propose to adjunt the hysteresis margins and, to avoid the ping-pong effect, they define a number of times N that the target cell measurements exceed the source ones. With these conditions, the TTT will dynamically vary to reflect the channel conditions and it will avoid handover failures and the ping-pong effect. Similar to the previous case, given the simulation results, the HSR is improved for certain SINR values.
The work presented by Zhang, Wu, Zhang, and Luan (2014) analyzes a high-speed trains scenario, where the train direction is considered together with the GPS data, which are relatively easy to obtain. The neighbor cells through the railways are also known; hence, they propose to use this information to implement a fast handover scheme. Their proposal settles appropriate reference points to trigger a handover procedure and their algorithm allows to reduce the latency and having smaller overlapping areas for the handover. The selection of an adequate reference point (geographic location) to perform the handover is fundamental; consequently, the points correspond to the statistical result of repetitive measurements. With the use of the hysteresis parameter and the measurement of the Block Error Rate [BLER], the authors tried to determine the geographical points where the handover must be triggered to send the session towards the destination cell. As per their simulation results, the ping-pong effect is reduced and they obtained a favorable radiolink failure rate.
We present some algorithms using an adjustment in the handover parameters based on the received signal levels. The work of Anas, Calabrese, Mogensen, Rosa, and Pedersen (2007) uses a TTT window based in the Received Signal Strenght [RSS]. The instantaneous RSRP value is stored in a record, whose values are later processed to determine if the handover must be triggered. The algorithm is implemented in two stages: storage and comparison in the signal level. As per their simulation results, they suggest HOM values to obtain a good relation between the number of executed handovers and the SINR.
The algorithm proposed by Zheng and Wigard (2008) considers the handover decision in the usage of historical records relative to differences in the signal level. The algorithm is executed in three stages: the calculation of the RSRP differences, the processing of the filtered RSRP values, and the handover decision. The simulation results show a reduction in the number of executed handovers by the UE; nevertheless, this algorithm does not consider the TTT, since the ping-pong effect is present.
The Hard Handover Algorithm with Average Received Signal Reference Power Constraint [LHHAARC] is a proposal seeking to minimize the number of handovers and delays, maximizing the data transfer in the network. LHHAARC is based on the hard handover algorithm with an additional condition over the average RSRP to improve the efficiency when the handover is executed (Link, Sandrasegaran, Ramli, & Basukala, 2011).
The concept of the previous algorithm is mainly to limit the handover possibilities to minimize the unnecessary executions of it, ensuring the channel quality in the target cell by having a higher RSRP than the serving cell. This is executed by having certain threshold from the first to the last measurement period. Their results indicate that the number of handovers is reduced compared with the TTT window algorithms based on RSS and integrator. Furthermore, lower delay values were obtained, having a higher data transfer rate.
In this section, we describe research works showing algorithms operating with mobile femtocells or mobile relays. Sui,Vihriälä, Papadogiannis, Sternad, Yang, and Svensson (2013) study the deployment of the so-called Moving Relay Nodes [MRN] in public transportation vehicles to provide service to the passengers within them. They analyzed the behavior relative to the performance of a fixed relay. For the study, several simulations were carried out using a fixed relay at different distances from a vehicle —where its position is assumed as known—. Their results show that the users inside the vehicles are affected by the so-called Vehicular Penetration Loss [VPL] and that their algorithm considerably improves the user data transfer by reducing those VPL. This was achieved by locating the relay as close as possible to the vehicle, where the reader can infer that the relay should move with the vehicle, entailing in the concept of mobile relay.
Karimi et al., (2012) present a solution based on LTE networks to support a high data transfer and multimedia services in high speed trains. The solution employs an array of organized cells throughout the railways, together with femtocells supporting the traffic demand inside the trains. These last are called mobile eNB or mobile femtocells. Additionally, they use a handover process called predictive, where the cells array allows to know in advance the target cells. Their simulation results show that improvements at the transfer level are achieved, together with a low handover latency and a higher success rate in the handover execution.
Chen (2015) researches the benefits of the mobile relays in a scenario where they are deployed in public buses. Although the author does not specifically propose a handover algorithm, his work allows to observe the benefits of the mobile relays. His research is focused on three aspects: improvements in the mobility procedures for mobile relays, where several signaling procedures are studied and the same protocol stack of the fixed relays is employed; interference impact in the transfer rate of a vehicular UE, where the transfer rate of a UE connected to the macro station is compared with the one of a UE connected with the mobile relay; and impact of the mobile relay in the cell capacity, where the capacity gain obtained by the relay deployment is assessed in a scenario with multiple users and relays.
Davaasambuu and Sato (2014) propose an adaptive hysteresis scheme based on a cost function, which considers some relevant factors of the mobile relay such as the cell load, relay speed, and the service type requested by the UE. The scheme operates between handover donor cells via the X2 interface. Their results indicate that the proposed scheme presents a higher probability of a successful handover than a scheme based on SINR.
Davaasambuu, Yu, and Sato (2015) present a self-optimization hysteresis scheme with mobile relay dual nodes in high speed environments. They propose an adjustment mechansim of the handover parameters such as individual cell histeresis and offset based on the vehicle speed. Further, they propose a Handover Performance Indicator [HPI] as a measurement for their scheme. This HPI helps to monitor the handover performance and it is equal to the sum of the failure handover rate, ping-pong handover, and failed handovers due to radio link failures. The simulation results show that, when comparing the proposed scheme with the traditional one, the authors’ one can reduce the number of radio link failures and service interruptions during the handover process.
On the other hand, Zhao, Huang, Zhang, and Fang (2011) propose an algorithm for the handover decision based on the Relative Velocity Aided Handoff [RVAH] of the UE towards the access points (cell, fixed or mobile relay), server, and destination. If the UE presents speeds lower than a threshold V0 regarding the server and destination access points, the handover will be performed according to the HOM and TTT; that is, the standard way. If the speed regarding the server access point is higher than the threshold V0, the handover process is triggered as per the RVAH algorithm. The neighbor access points with relative speeds lower than V0can be selected as future destination points.
Davaasambuu, Semaganga, and Sato (2015) propose an adaptive hysteresis scheme (based on the train speed) for handover in wireless networks with mobile relays in a high-speed trains scenario. They include a logarithmic formula involving the maximum and current speed of the mobile relay; also, they involve hysteresis values called “by default” and “maximum” for the hysteresis adjustment in the handover process. The probability of interruptions in calls during the handover is reduced by introducing a modified call admission control to support the savings in radio resources. This helps to prioritize the handover of the calls of the mobile relay over other calls. The authors present three priorities: mobile relay handover calls, UE handover calls, and new calls. The results described in their paper show how the successful handovers rate is increased and the radio failures is reduced.
In this paper, we carried out a revision of the handover algorithms, mainly focused in the algorithms oriented to massive means of transport. Although there are several handover algorithms in LTE presenting alternatives to adjust variables such as the HOM and TTT, other parameters as speed, position, and direction arose as key factors that must be considered in the algorithms oriented to means of transport.
In general, improvements in the successful handover rate are achieved with the implementation of new algorithms. Furthermore, other benefits are the reduction in the network signaling traffic, releasing resources in the control plane; reduction in the latency; and reduction in the session interruptions. This is finally reflected in more stable communications and in a higher data transfer rate for the end users.
The executed processes by the handover algorithms must have a simplified logic that allows a quick execution to avoid failures in the radio link level; this is critical in high speed environments.
The implementation of mobile relays —included by the 3GPP from the release12—, will offer significant advantages for the end users regarding the data transfer rate and latency. The algorithms focused on this type of solutions are an important study field for upcoming research works.
Cómo citar: Trejo, E., & Hernández, C. (2018). Handover algorithms in LTE networks for massive means of transport, Sistemas & Telemática, 16(46), 21-36. doi:10.18046/syt.v16i46.3033

