88 Int. J. Simulation and Process Modelling, Vol. 11, No.

2, 2016

Modelling and simulation of predictive handover

control mechanisms for fast moving mobile nodes in
wireless networks

Raman Kumar Goyal and Sakshi Kaushal*

Computer Science and Engineering,
University Institute of Engineering and Technology,
Panjab University,
Chandigarh 160014, India
Email: raman.uiet1985@gmail.com
Email: sakshi@pu.ac.in
*Corresponding author

Abstract: When a mobile node (MN) is moving at a high speed from one network to another
network, internet connectivity is degraded as MN cannot complete the handover within the
required time owing to delayed triggering of handover request. To ensure seamless connectivity
without performance degradation, traditional handover mechanism needs to be enhanced. In this
paper, a media independent handover (MIH)-based handover triggering scheme is proposed
based on the mobility prediction of MN. Handover triggering is predicted by calculating link
expiration time that depends on velocity, direction and distance of MN from the access point.
Scanning process required for traditional MIH networks is eliminated using information server
(IS) that estimates the received signal strength (RSS) of candidate networks based on the location
of MN. Simulation results show that the proposed scheme reduces the handover latency and
improves the throughput in homogenous networks at varying velocities of MN.

Keywords: communication; media independent handover; MIH; mobility prediction; MIPv6;

handover; received signal strength; RSS; link expiration time; LET.

Reference to this paper should be made as follows: Goyal, R.K. and Kaushal, S. (2016)
Modelling and simulation of predictive handover control mechanisms for fast moving mobile
nodes in wireless networks, Int. J. Simulation and Process Modelling, Vol. 11, No. 2,
pp.8896.

Biographical notes: Raman Kumar Goyal is currently pursuing his PhD from the University
Institute of Engineering and Technology, Panjab University Chandigarh, India. He received his
Bachelor of Technology in Computer Engineering from the Punjabi University Patiala, India and
Master of Engineering in Information Technology from the Panjab University Chandigarh, India
in 2007 and 2009, respectively. His research areas include mobility in networks, information
retrieval, network simulation, etc.

Sakshi Kaushal received her PhD in Computer Science and Engineering from the Thapar
University Patiala, India in 2009. She is working as an Associate Professor at the University
Institute of Engineering and Technology, Panjab Univesity, Chandigarh, India. Her main
research includes wireless networks, modelling and simulation, mobility in networks,
information security, cloud computing, etc.

1 Introduction performance in fast moving MNs becomes an important

issue to ensure better user satisfaction and quality of service
The growth of internet applications like social networking
(QoS). When a MN moves to other network, the connection
sites, audio or video downloading, instant messaging, etc.,
gets interrupted owing to change in IP address. Terminal
and the availability of compact mobile nodes (MNs) have
mobility includes the ability of network to identify and
increased the demand for mobility support in wireless
locate the MN and the MN should be able to access the
networks (Li et al., 2009; Baker et al., 2006). These
services while moving. It consists of location management
applications demand seamless connectivity and their
and handover management (Budisz et al., 2008). Process of

Copyright 2016 Inderscience Enterprises Ltd.

 Modelling and simulation of predictive handover control mechanisms for fast moving mobile nodes 89

redirecting IP packets to MNs new IP address which are expiration time (LET) is calculated, and handover triggering
destined to MNs old IP address is called handover in is done. Also, an IS is proposed, namely, proposed
IP-based networks (Zhou and Ai, 2014). Owing to handover information server (PIS) that eliminates the scanning time
various issues arise like packet loss, handover latency, of MIH by calculating the received signal strength (RSS) of
reordering of packets and security concerns, etc. Handover different candidate networks based on the spatial localities
latency is defined as the gap between the time that the MN of MN.
received the last data packet over the old IP address and the The rest of this paper is organised as follows. Section 2
time that the MN received the first data packet over the new summarises the related work. Section 3 describes the
IP address. Handling mobility below network layer faces working of MIH for horizontal handovers. Section 4
serious challenges due to the fact that IP addresses cannot explains the handover triggering based on prediction of
be configured from link layer. Therefore, the lower layer connectivity of network in case of fast moving MN. This
mobility solutions mainly deal with the dynamic updates of section also illustrates an enhanced IS for horizontal
MAC switching tables (Akyildz et al., 2004). But their handover. Section 5 presents the simulation results. Finally,
scalability is limited within the same subnet. Various conclusion is presented in Section 6.
mobility management techniques are available that include
network layer approaches [mobile IP (MIP) and its
enhancements] (Li and Chen, 2005), transport layer 2 Related work
approaches like mobile stream control techniques (mSCTP)
Most the work related to MIH has been carried out on
(Koh et al., 2004), and application layer approaches like
vertical handover. The reduction of handover latency by
Session Initiation Protocol (SIP) (Rosenberg et al., 2002).
eliminating the scanning procedure and handover decision is
Personal mobility refers to locate the users at several
done on the basis of QoS parameters from the IS in case of
terminals. mSCTP is a transport layer handover protocol
horizontal handover (Kim et al., 2008). Similarly, Kim et al.
that offers soft handovers. It exploits the multi-homing
(2011) have proposed the enhanced IS to reduce the
capability of SCTP (Atiquzzaman and Reaz, 2005) to
scanning time by considering the spatial locality of MN.
provide personal mobility. Service mobility can be defined
Some work has also been done on the timing of link going
as continuation of services even when changing and moving
down (LGD) trigger, i.e., when a MIH user should start the
the terminals (HeidariNezhad et al., 2009). SIP offers
handover procedure. A dynamic LGD triggering is done on
personal mobility and terminal mobility that can be
the basis RSS threshold of each type of network (Joe and
extended by establishing a new connection during the start
Shin, 2010). It also predicts the moving area in the new
of a new session, when a MN has moved to a new network
network but that does not take part in LGD trigger. Also,
or in the middle of a session. Media independent handover
Yousaf et al. (2009) have proposed an intelligent prediction
(MIH) was introduced to facilitate vertical handover
model for LGD triggering. It is based on time delay neural
between heterogeneous networks (Oliva et al., 2008). MIH
networks (TDNN) and feed forward neural network (FFNN)
can support the above mentioned mobility protocols as it
that predicts the future link conditions based on the past and
provides session continuity independent of technology
current values of the link parameters. A cross-layer
specifications. MIH defines three types of services media
scheduling is exploited based on neighbouring network
independent event services (MIES), media independent
information (Lin et al., 2012). Different LGD ratios based
command services (MICS) and media independent
on distance from cell border, packet loss and throughput for
information services (MIIS).
different types of networks (WLAN, UMTS, and WIMAX).
When a MN moves at high speed, seamless connectivity
This method supports three independent classes and
in handover becomes a major issue as time required for
mapping of WIMAX and WLAN, WIMAX and UMTS
completing the handover is much less. Therefore, the
have also been done. Yoo et al. (2010) have presented
problems of high handover latency and low throughput
cross-layer-based predictive handover architecture after
arise. Handover triggering in MIH is based on link
investing early and late link trigger costs. It measures the
conditions. MIH was originally designed to enhance the
initial configuration and measurement to set the threshold
vertical handover for nodes having multi-interfaces of
limits. It calculates the QoS satisfactory criteria and then
different technologies. Also, the scanning time required for
triggers the LGD event. Hassan and Hoong (2013) have
query of resources in candidate networks consumes a lot of
proposed a handover procedure based on the mobility
time.
prediction. Mobility prediction is divided into state
In this paper, MIH-based technique is proposed for
observation and prediction. State observation tracks the MN
smooth horizontal handover using mobility prediction for
and prediction is based on observations output, i.e., the
fast moving MNs. With the use of global positioning system
calculations and equations based on signal, noise and state
(GPS) MN updates its position, velocity and the direction to
the information server (IS). Based on this information, link
90 R.K. Goyal and S. Kaushal
vectors. The trade-off between the accuracy and the
complexity of the mathematical models for location
prediction based on pattern analysis of handover series is
discussed by Fullop et al. (2013).
All the above LGD schemes are based on signal
strength, QoS parameters and other mechanisms. These
mechanisms have not included the combination of
parameters like velocity, spatial coordinates and coverage
area. In case of fast moving nodes, velocity of MN becomes
a major component for handover (Barolli, 2013). Payaswini
and Manjaiah (2013) have shown the impact of velocity on
threshold limits for LGD. The cost of early and late
handover triggering can affect the performance of handover
(Ma et al., 2009). In case of fast moving MNs, late
triggering can become a serious concern.
In this paper, we have proposed and implemented a
novel approach that enhances the performance of MIPv6 for
fast MNs in case of horizontal handovers. LGD triggering is
done on the basis of coverage area of AP, velocity, direction
and the spatial coordinates of MN. Therefore, triggering is
done at the appropriate time in case of fast moving MN.
Also, the scanning time of IS is reduced by making the
handover decision by calculating the RSS on the basis of
spatial localities of MN and respective APs of different
networks.
3 Media independent handover
IEEE 802.21 MIH was introduced for inter-technology
handover without service interruption MIH defines service
access points (SAPs) that provides a generic interface
between lower layers and upper layers. MNs having
multiple interfaces can execute seamless handover with
MIH by providing link layer intelligence and network
information to the upper layers. Mobility protocols like
MIPv6 can use the MIH services to get the information
about the state of arbitrary type of networks and to assist the
handover between different networks based on this
information. MIH defines three types of services MIES,
MICS and MIIS. MIES provides functions of event
reporting to the upper layers like MIH link down, etc. MICS
sent commands like MIH scan from upper layer to lower
layers to enable the MIH user to manage and control the
link behaviours. MIIS provides information about the
neighbouring networks like list of candidate networks and
their available resources to MN or the serving network. The
next subsections present the address formulation and
working of MIH in case of homogeneous networks.
3.1 Address formulation in MIH
In MIPv6, router discovery procedure is done by router
solicitation (RS) and router advertisement (RA) messages.
RS/RA messages are required to get the prefix of the new
AP. Handover Latency for MIPv6 (DMIPv6) is as calculated
in (1).
DMIPv 6 = DL 2 + DRD + DDAD + DEU (1)
where DL2 is L2 handover latency, DRD is time required for
router discovery, DDAD is latency caused by duplicate
address detection process and DEU is the time required for
the binary update in MIPv6. However, in case of MIH, with
the help of defining new information elements like
IE_POA_IP_ADDR (Draft IEEE Standards, 2008) or by
defining new parameters like MIH-PrefixInfo (An et al.,
2006), MN can get the address of new AR or AP directly
from IS. Therefore, there is no need of RS/RA messages.
Enhanced handover latency (DEH) is calculated as in (2).
DEH = DL 2 + DDAD + DEU (2)
Total time required to complete the handover in MIPv6 is
between 2 s and 3 s.
3.2 Working of MIH
The messages primitives, events and parameters required in
MIH handover are presented in IEEE Draft P802.21_D11
(Draft IEEE Standards, 2008). Working of MIH for
horizontal handover is elaborated in Figure 1. The steps
required for MIH handover are described below.
1 MN periodically obtains the neighbouring networks
(APs) from the information from IS. Through this
information MN can have the list of available links
(Candidate networks).
2 If MIH sends the LGD event based on RSS, MN
prepares for the handover process.
3 MN scans for nearby APs to measure the up to date
channel states.
4 Once MN completes the scanning process, the MN
sends a target list query message with the results of
scanning to the IS. IS evaluates the each candidate APs
scanning result and chooses the AP which has highest
priority for the handover.
5 Finally, MN executes the handover to the target
network with highest priority.
 Modelling and simulation of predictive handover control mechanisms for fast moving mobile nodes
Figure 1 Message flow diagram in MIH for horizontal handover
4 Proposed MIH-based technique
MIH is usually used for vertical handover with multiple
interfaces of MN. For horizontal handovers, MIH cannot
exploit the multi-interface benefits of MN. Therefore, the
performance of MIPv6 is hardly improved. In this paper, a
novel technique is proposed to enhance the performance of
handover procedure of MIH. In this section, the proposed
scheme is presented. The scheme is divided in two parts.
Section 4.1 explains a handover triggering mechanism that
triggers the handover process on the basis of mobility
prediction and Section 4.2 elaborates how the scanning time
of IS for information about candidate networks is eliminated
by having the sorted list of RSS of available networks on
the basis of spatial locality of MN and respective APs.
Section 4.3 presents the whole handover process in
homogeneous networks.
4.1 Handover triggering mechanism
Generally, MIH checks link status and QoS signals for
performing the handover. But when a MN is moving at high
speed it does not have the enough time to complete the
handover. Therefore, handover latency and packet loss
increase. We have implemented handover triggering by
predicting the mobility pattern of MN. LET is predicted so
91
that LGD can be triggered. For this simulation study, we are
assuming that MN and APs are equipped with GPS. MN
gets its location information, velocity and direction from
GPS. Prediction of MNs connectivity to the current AP is
done on the basis of LET which considers APs coverage
area (r), velocity of MN (v m/s), and direction of MN () as
shown in Figure 2. Calculation of LET (Tao and Yu, 2011;
Su et al., 2000) is shown in (3).
(ab + cd ) + ( a 2 + c 2 ) r 2 (ad bc) 2
LET = (3)
a2 + c2
where a = v cos , b = x x1, c = v sin , d = y y1.
Based on LET, a MN triggers the handover process by
LGD signal and thus reduces handover latency and packet
losses. This triggering algorithm is based on velocity, range
of AP and spatial coordinates, thus it should optimise the
handover in case of fast moving nodes. When LET becomes
lower than the minimum time required to complete the
MIPv6 handover, the LGD triggering will start.
4.2 Handover decision
MN gets the neighbouring network information from the IS
IS. The IS provides information about the channel states
with the scanning procedure. But it adds latency to the
92 R.K. Goyal and S. Kaushal
handover procedure. So we propose an IS, namely, PIS that
eliminates the need for scanning by calculating RSS.
Figure 3 shows the network model in which MN that was
initially connected to AP1 and then moves within the
coverage area of three APs.
Figure 2 Movement of MN within the range of access point
(see online version for colours)
Figure 3 Network model using proposed IS (see online version
for colours)
When the new link is detected by MN, it has to decide the
AP where it wants to connect and perform the handover. In
MIH, simulation study as shown in Figure 4, after handover
triggering the MN sends Neighbour List query which
requests the candidate networks list from IS. Then, IS sends
a Neighbour list response containing information about
which APs are the candidate networks for MN. After this,
MN scans for channel states. When scanning gets completed
it sends the target list query with channel states information.
Sorted list of APs with respect to RSS can be made on the
basis of spatial locality of MN as shown in the RSS
algorithm below. The RSS is calculated according to the
given procedures as elaborated in Algorithm 1. N is number
of APs. The scanning time is reduced by getting the spatial
location of MN by means of GPS. (xi, yi) are the
coordinates of respective AP and (x, y) are the coordinates
of MN. R(j) denotes the distance between MN and (j = 1)th
AP. list stores the distances in ascending order. The highest
priority AP is stored first in list and then so on. PIS
determines the target network list from list. In the proposed
technique, after the handover trigger, MN obtains the
neighbouring network list from PIS with the coordinates of
respective APs.
Algorithm 1 RSS estimation
(1) Initiate N
(2) j0
(3) while (j < N) do
(4) R ( j ) = ( x xi ) 2 + ( y yi ) 2
(5) j ++
(6) end while
(7) list sort R
On the basis of coordinates, MN estimates the RSS values
as shown in RSS algorithm. Based on the sorted list, PIS
selects the AP with highest priority. Thus, instead of
scanning, MN can have the target network list on the basis
of APs distance from the MN as shown in Figure 5.
4.3 Proposed technique
L is the total time required to complete the MIPv6 handover.
The proposed handover procedure is presented in Figure 6.
The various steps involved in our approach are discussed
below.
1 MN periodically obtains the neighbouring networks
(APs) from the information from IS and the get the
prefix of AP as explained in Section 3.2. Through this
information MN can have the list of available links
(candidate networks) with prefix addresses of
respective network. Also, MN obtains its location
information from GPS periodically and informs
LET to IS as explained in Section 3.1.
2 If (LET < L), LGD signal is sent and MN prepares for
the handover process.
3 MN sends a target list query message and its current
position to IS.
4 PIS estimates the sorted list based on RSS and responds
with target list message to MN.
5 MN executes the handover with AP having highest
priority.
 Modelling and simulation of predictive handover control mechanisms for fast moving mobile nodes 93

Figure 4 MIH handover procedure

MN AP2 AP3 IS

Neighbour list query

Neighbour list response (AP2, AP3)

Scanning

Scanning

Target list query

Handover Decision (AP3>AP2)

Target list response

Figure 5 MIH handover procedure with proposed technique

MN AP2 AP3 PIS

Neighbour list query with MN(x, y)

Neighbour list response

(AP2(x2,y2), AP3(x3,y3)

Target list query with values of RSS

Handover decision (AP3 > AP2)

Target list response

Fast moving users generally move in a straight line or with AP. In traditional MIH handover is triggered when link
the direction of road or a railway track. Hence, our approach quality goes down. Therefore, by using the proposed
can work efficiently in this case. Ping Pong movement in velocity adaptive mobility scheme, handover is triggered on
the overlapping region of two APs is not common in fast time, so that connectivity does not degrade in case of fast
moving nodes. For the slow moving nodes (up to 10 m/s), moving nodes. Also, scanning time in MIH is reduced for
we have used a counter in IS. It counts the number of homogeneous networks by calculating RSS on the basis of
handovers in 3 s. If the value is more than 3, then instead of spatial locality of MN and the candidate AP.
LET, traditional RSS approach is used.
Thus, a velocity-based adaptive handover mechanism is
proposed. This handover mechanism adapts to the velocity, 5 Simulation results
direction and spatial locality of MN. From our rigorous
Simulation is the technique of imitating the real world
literature study, no researcher was found to use LET for
problem by a computer program. In this section, the
handover triggering in MIH networks. Because the velocity
performance analysis of the proposed technique is presented
of the MN is constant and the coordinates of MN are
(Kondratyev, 2015; Taj and Mousavidin, 2015). For
acquired from GPS, the prediction of LET is accurate if the
simulation study, Ns2 (The Network Simulator: ns-2, 2015)
MN could keep the transient state (Tao and Yu, 2011). The
simulator is used. The different network parameters used for
main advantage of this scheme over traditional MIH is that
simulation are presented in as Table 1.
handover is predicted by considering velocity and predicting
the time for which a MN stays in the range of its connected
94 R.K. Goyal and S. Kaushal

Figure 6 Message flow in the proposed technique

Table 1 Simulation parameters of AP3 for simulation study. Simulation scenario is

illustrated in Figure 7.
Parameter name Value/range
Number of wired nodes 2 (CN + R0) Figure 7 Simulation scenario
Number of base stations 3 (AP1 + AP2 + AP3) CN

Number of mobile nodes 1 (MN) 400 Mbit,

10 ms
Bandwidth, delay for wired links 100 Mbit, 30 ms R0

Coverage range of WLAN 50 m

100 Mbit 100 Mbit 30 ms
Receiver threshold 5.25089e-10 30 ms 100 Mbit, 0 ms

Beacon interval 40 ms
Transport layer protocol UDP AP2

Application layer traffic CBR AP1 AP3

CBR packet size 200

L in proposed technique (based on 2s MN

Section 3.1)
Routing protocol DSDV

This paper mainly focuses on handover triggering and the

scanning procedure of MIH. Selection of network on the
basis of QoS and other network parameters is beyond the
scope of this paper as we now focus on how quickly the IS
takes handover decision. Therefore, we considered the
overlapping area of AP2 to be less than the overlapping area
Figure 8 and Figure 9 show the impact of velocity over
handover latency and throughput, respectively. Handover
latency is time between the last packet received by the MN
through old AP (AP1) and the first packet received by the
MN through new AP (AP3). Throughput is the total number
of packets received by the MN divided by the total
 Modelling and simulation of predictive handover control mechanisms for fast moving mobile nodes
simulation time. MN has performed handover four times
with Ping-Pong motion between APs over the simulation
time of 100 s. When MN moves at higher velocities, it
experiences higher handover latency and lower throughput
due to the insufficient time for the completion of handover.
MN cannot receive packets on time or the packets can be
even lost when they are sent to the outdated address. The
proposed technique performs relatively better in comparison
to the traditional MIH as it predicts the LET and it does not
have to go through the scanning procedures of MIH and
thus reduces handover latency and improves throughput.
Figure 8 Comparison of techniques for handover latency over
varying velocities (see online version for colours)
Figure 9 Comparison of techniques for throughput over varying
velocities (see online version for colours)
Figure 10 Impact of overlapping distance over handover latency
(see online version for colours)
Figure 10 describes the performance of the proposed
technique on the basis of overlapping distance of the old AP
and the new AP. The overlapping distance can be calculated
as the distance that the MN covers within the range of both
the APs. The handover latency decreases as the overlapping
area increases. For higher velocities, this improvement is
more significant as MN can have the coverage of new AP
much earlier in comparison to the scenario having low
overlapping area. Therefore, for higher velocities, when the
overlapping area increases, MN can trigger the handover
95
process much quicker by comparing LET < L (2s) so that
the MN can have more time to complete the handover. In
case of homogenous networks, traditional MIH technique
will trigger the handover only when the signal strength
becomes lower than the received threshold limit. Therefore,
there will be no effect of overlapping area on handover.
6 Conclusions
Fast moving nodes need appropriate handover triggering
and fast mechanisms to complete the handover. Traditional
MIH technique hardly improves the performance of MIPv6
in homogeneous networks as they cannot exploit the
benefits of multiple interfaces. In our work, a new
MIH-based technique is proposed which removes the
scanning procedure involved in MIH for network selection
by estimating the RSS on the basis of spatial localities of
MN. Also, handover triggering is done by predicting LET
so that the handover process can be started at an appropriate
time for fast moving nodes. Most of the researchers have
used link conditions to trigger LGD event. This approach
considers LGD triggering based on velocity, spatial
coordinates of MN and coverage area of AP. Simulation
results show that proposed MIH-based technique performs
better than its traditional variant. It significantly reduces
handover latency and improves throughput at varying
velocities of MN. Also, the proposed technique has been
analysed on the basis of varying overlapping area of old AP
and new AP. When the overlapping area increases between
APs, it has been found from the simulation study that the
proposed technique shows enhanced results. MN can trigger
handover much earlier in larger overlapping area scenario
than in case of scenario with smaller overlapping area. In
this proposed scheme, the work is carried out considering
single MN and only RSS as handover decision parameters.
In the near future, other QoS parameters like bandwidth,
delay error rate and user satisfaction will also be considered.
Further, this work can be extended for multiple MNs.
References
Akyildz, I., Xie, J. and Mohanty, S. (2004) A survey of mobility
management in next generation all-IP based networks, IEEE
Wireless Communications, Vol. 11, No. 4, pp.1628.
An, Y.Y., Yae, B.H., Lee, K.W., Cho, Y.Z. and Jung, W.Y. (2006)
Reduction of handover latency using MIH services in
MIPv6, IEEE 20th International Conference on AINA 06,
pp.229234.
Atiquzzaman, M. and Reaz, A.S. (2005) Survey and classification
of transport layer mobility management schemes, IEEE 16th
International Symposium on Personal, Indoor and Mobile
Radio Communications, pp.21092115.
Baker, A.B., Salleh, S. and Lee, M.H. (2006) Forecast: message
transmission model in dense graphs for adhoc networks,
International Journal of Simulation and Process Modelling,
Vol. 2, Nos. 1/2, pp.411.
Barolli, L. (2013) A speed-aware handover system for wireless
cellular networks based on fuzzy logic, Mobile Information
Systems, Vol. 4, No. 1, pp.112.
96 R.K. Goyal and S. Kaushal
Budisz, L., Ferrus, R., Brunstorm, A., Grinnemo, K., Fracchia, R.,
Galante, G. and Casadevall, F. (2008) Towards
transport-layer mobility: evolution of SCTP multihoming,
Computer Communications, Vol. 31, No. 5, pp.980998.
Draft IEEE Standards (2008) IEEE 802.21 Standard and
Metropolitan Area Networks: Media Independent Handover
Services, Draft P802.21_D11.
Fullop, P., Imre, S., Szabo, S. and Szalka, T. (2013) Accurate
mobility modelling and location prediction based on pattern
analysis of handover series in mobile networks, Mobile
Information Systems, Vol. 15, No. 3, pp.255289.
Hassan, M.M. and Hoong, P.K. (2013) Seamless handover
integrated solution for video transmission over proxy mobile
IPv6 in a micro mobility domain, Journal of Network and
Computer Applications, Vol. 36, No. 1, pp.6676.
HeidariNezhad, M., Zukarnain, Z. and Othman, M. (2009)
Mobility support across hybrid IP-based wireless
environment: review of concepts, solutions, and related
issues, Annals of Telecommunications, Vol. 64, Nos. 910,
pp.677691.
Joe, I. and Shin, M. (2010) A mobility-based prediction algorithm
with dynamic LGD triggering for vertical handover, IEEE
7th Consumer Communications and Networking Conference,
pp.12.
Kim, B.K., Jung, Y.C., Kim, I. and Kim, Y.T. (2008) Enhanced
fmipv4 horizontal handover with minimized channel scanning
time based on media independent handover (MIH), IEEE
NOMS Workshops, pp.5255.
Kim, Y., Pack, S., Kang, C.G. and Park, S. (2011) An enhanced
information server for seamless vertical handover in IEEE
802.21 MIH networks, Computer Networks, Vol. 55, No. 1,
pp.147158.
Koh, S., Chang, M. and Lee, M. (2004) mSCTP for soft handover
in transport layer, IEEE Communications Letters, Vol. 8,
No. 3, pp.189191.
Kondratyev, M (2015) An object-oriented approach to port
activity simulation, International Journal of Simulation and
Process Modelling, Vol. 10, No. 1, pp.19.
Li, J. and Chen, H. (2005) Mobility support for IP-based
networks, IEEE Communications Magazine, Vol. 43, No. 2,
pp.21092115.
Li, Y., Liu, J. and Rangaswami, R. (2009) Real-time network
simulation support for scalable routing experiments,
International Journal of Simulation and Process Modelling,
Vol. 5, No. 2, pp.146156.
Lin, C.P., Chen, H.L. and Leu, J.S. (2012) A predictive handover
scheme to improve service quality in the IEEE 802.21
network, Computers and Electrical Engineering, Vol. 38,
No. 3, pp.681693.
Ma, C., Fallon, E. and Qiao, Y. (2009) VOSHM a velocity
optimized seamless handover mechanism for WiMAX
networks, 9th IT&T Conference.
Oliva, A., Melia, T., Banchs, A., Soto, I. and Vidal, A. (2008)
IEEE 802_21 (media independent handover services)
overview, IEEE Wireless Communications, Vol. 15, No. 4,
pp.96103.
Payaswini, P. and Manjaiah, D.H. (2013) Performance analysis of
link going down threshold for media independent handovers,
IEEE International Conference on C2SPCA, pp.15.
Rosenberg, J., Schulzrinne, H., Camarillo, G., Johnston, A.,
Peterson, J., Sparks, R., Handley, M. and Schooler, E. (2002)
SIP: Session Initiation Protocol, IETF RFC 3261.
Su, W., Lee, S.J. and Gerla, M. (2000) Mobility prediction
in wireless networks, IEEE Military Communications
Conference, pp. 491495.
Taj, S. and Mousavidin, E. (2015) Using discrete event visual
simulation to teach process modelling in MBA operations
management courses, International Journal of Simulation
and Process Modelling, Vol. 10, No. 1, pp.4564.
Tao, M. and Yu, H. (2011) A smooth handover scheme for
fast-moving users in mobile IPv6 networks, Wireless
Personal Communications, Vol. 60, No. 4, pp.649664.
The Network Simulator: ns-2 (2015) [online]
http://www.isi.edu/nsnam/ns (accessed 10 January 2015).
Yoo, S.J., Cypher, D. and Golmie, N. (2010) Timely effective
handover mechanism in heterogeneous wireless networks,
Wireless Personal Communications, Vol. 52, No. 3,
pp.449475.
Yousaf, M., Bhatti, S., Rehan, M., Qayyum, A. and Malik, S.A.
(2009) An intelligent prediction model for generating lgd
trigger of IEEE 802.21 MIH, in Huang, D.H. et al. (Eds.):
Emerging Intelligent Computing Technology and
Applications. 5th International Conference on Intelligent
Computing, ICIC 2009, Ulsan, South Korea, 1619
September, Lecture Notes in Computer Science, Vol. 5754,
No. 1, pp.413422.
Zhou, Y. and Ai, B. (2014) Handover schemes &
algorithms of high speed environment: a survey, Computer
Communications, Vol. 47, No. 1, pp.115.