• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.815-820
• /
• 2001

This paper presents a distributed mobile architecture aimed to support the mobility of mobile station. The proposed architecture considers three significant objects；mobile station (MS), mobile agent (MA) which logically represents mobile station in the wireline network, and trace agent (TA) to represent application server (AS) providing application service to mobile station. The mobile agent is made closely coupled with the mobile station while the trace agent is made closely coupled with the application server. During the handoff process, a flow control mechanism is considered to correct packet loss and out-of-sequence packets problem. The result of analytic additional time delay due to handoff processing is presented and simulation was performed to check the additional time delay as well as the correctness of handoff algorithm.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.4
• /
• pp.9-17
• /
• 2007

Network Mobility basic support protocol (NEMO Basic) extends the operation of Mobile IPv6 to provide uninterrupted Internet connectivity to the communicating nodes of mobile networks. The protocol uses a mobile router (MR) in the mobile network to perform prefix scope binding updates with its home agent (HA) to establish a bi-directional tunnel between the HA and MR. This solution reduces location-update signaling by making network movements transparent to the mobile nodes (MNs) behind the MR. However, delays in data delivery and higher overheads are likely to occur because of sub-optimal routing and multiple encapsulation of data packets. To manage the mobility of the mobile network, it is important to minimize packet overhead, to optimize routing, and to reduce the volume of handoff signals over the nested mobile network. This paper proposes en aggregate router-assisted route optimization (ARARO) scheme for nested mobile networks support which introduces a local anchor router in order to localize handoff and to optimize routing. With ARARO, a mobile network node (MNN) behind a MR performs route optimization with a correspondent node (CN) as the MR sends a binding update message (BU) to aggregate router (AGR) via root-MR on behalf of all active MNNs when the mobile network moves. This paper describes the new architecture and mechanisms and provides simulation results which indicate that our proposal reduces transmission delay, handoff latency and signaling overhead. To evaluate the scheme, we present the results of simulation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.1
• /
• pp.153-160
• /
• 2009

A hierarchical network between Mobile-WiMAX and WLAN systems is to make it possible to utilize wireless internet services including time sensitive applications such as VoIP, VOD, visual telephony etc. During the process of vertical handoff decision from Mobile-WiMAX to WLAN hotspot, vertical handoff delay causes user dissatisfaction because it doesn't provide the seamless wireless internet service. We make use of type of service (ToS) parameters in IEEE 802.16e specification as the criterion parameter of vertical handoff decision process in hierarchical Mobile-WiMAX/WLAN networks. In this paper, we propose the process of vertical handoff decision for seamless wireless internet service which is sensitive to time delay. If type of service is time sensitive application, the decision of vertical handoff is withdrawn until the service is terminated. In focus on user satisfaction, if the proposed traffic management strategy in hierarchical Mobile-WiMAX/WLAN networks is used, user will utilize seamless wireless internet services including time sensitive applications.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.2
• /
• pp.75-82
• /
• 2008

Mobile IP was proposed to overcome identity problem of original IP address system caused by mobility of wireless mobile host. To complete its network handoff procedure, it must receive a mobile advertisement broadcasted by mobile agent. Generally, in a mobile IP system, mean time delay, 500ms, in a network handoff procedure is a critical problem of wireless service such as Voip, multimedia streaming. A caching agent caches a latest mobile advertisement, and replays it by receiving solicitation message from a mobile node finishing link layer detection. But, during the procedure of mobile registration, many packets from service provider to the mobile host would be lost and handoff time delay would be increased. In this thesis, we propose an unproved caching agent technique which can forward data packets while handoff procedure, and CoA pool for fast mobile IP registration.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.159-167
• /
• 2006

IEEE 802.11i standard specifies full authentication and preauthentication for secure handoff in 802.11 wireless LAN (WLAN). However, the full authentication is too slow to provide seamless services for handoff users, and preauthentication may fail in highly populated WLAN where it is highly probable that the cache entry of a preauthenticated user is evicted by other users before handoff. In this paper, we propose a fast and secure handoff scheme by reducing authentication and key management delay in the handoff process. When a user handoffs, security context established between the user and the previous access point (AP) is forwarded from the previous AP to the current AP, and the session key is reused before the handoff session terminates. The freshness of session key is maintained by regenerating session keys after handoff session is terminated. The proposed scheme can achieve considerable reduction in handoff delay with providing the same security level as 802.1X authentication by letting an AP authenticate a handoff user before making an robust security network association (RSNA) with it.

• The Journal of Korean Association of Computer Education
• /
• v.10 no.5
• /
• pp.81-88
• /
• 2007

To support the movement of a mobile network consisting of several mobile nodes, the IETF NEMO working group proposed NEMO basic support protocol using bi-directional tunneling between the home agent and the mobile router. Since NEMO basic support protocol is based on bi-directional tunneling, all communications to and from mobile nodes are suffer from inefficient routing all the cases. To solve the routing inefficiency problem, several proposals are proposed. However, those proposals results in new problems, such as binding update storm and changes in existing protocol. Especially, binding update storm problem may cause the delay in binding update, this subsequently causes the difficulty for a real time service and the handoff delay on the movement of mobile network. In this paper, we propose a new binding update scheme which reduces binding update latency and the handoff delay through the distribution of the transmission time of binding update messages. The performance of the proposed scheme is also evaluated to demonstrate its efficiency. Simulation results show that the proposed scheme can efficiently reduce the binding update latency.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.10
• /
• pp.33-51
• /
• 1997

On ATM-based wired/wireless integrated network, we apply the connection re-routing method[1] which reduced the inter-cluster handoff delay by reserving VPI/VCLs for possible inter-cluster handoff calls in advance. Additionally, we propose wired resource reservation methods, which are ausiliary method and split method, for handoff QoS guarantee of various expected services. The characteristics of these methods reserve wired connection resources based on the information on the possible inter-cluster handoff calls. With mathematical analysis, we also propose each algorithm and cost function for deciding an optimal amount in reserving resources. With numberical examples, we can see that the auxiliary method effectively reduces the cost in all cases(.alpha.>.betha., .alpha.=.betha., and .alpha.<.betha.). The split method has a little cost-reduction effects, when handoffs call does not have priority over new calls (that is, .alpha..leq..betha.) and the total capacity is relatively large. In other cases, the split method, however, has effective cost-reduction effects. The numerical resutls show that these reservation methods ca flexibly cope with the time-variant environment and meet the QoS requriements on the inter-cluster handoff calls.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1B
• /
• pp.1-6
• /
• 2011

We have considered fast handoff algorithms to support seamless streaming in wireless LANs. It is impossible to provide seamless streaming service while moving within wireless LANs, In this paper, we proposed a new handoff algorithm where the critical value for handoff can be adjusted according to peripheral wireless circumstances. This algorithm can prevent an unnecessary scanning job and save handoff delay time through the active scanning procedure to the specific channel groups. Also, we evaluated the handoff performance of our proposed algorithm, and compared it with the performance of the existing wireless LAN. We can see that the performance with our proposal is better than that of the general wireless LAN.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.295-300
• /
• 1999

In Wireless ATM Networks, the mobility management of that is used currently have been studying variously. In this paper, we show the properties of location registration, update, and handoff control mechanism of these first. And then, for frequent handoff occurring condition under minimized cellular environment by degrees, we did comparison and analysis focucing on handoff delay, call-blocking rate and call-dropping rate with communication break-time and velocity variation.

• Convergence Security Journal
• /
• v.7 no.1
• /
• pp.99-106
• /
• 2007

We propose a distributed anchor Crossover Switches (CX) searching algorithm to play an important role in ensuring fast and seamless handoff control in wireless ATM networks. Within networks that are grouped together, connection management is done for each group by anchor switches, and Permanent Virtual Circuit (PVC) with a narrow bandwidth is assigned between anchors for exchange of information. The proposed algorithm enables quick searching of a targeted CX, makes management of the overall network easier, and reduces system overhead or propagation delay time, thus providing fast and seamless handoff.