• Journal of KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.566-572
• /
• 2004

In this paper, we define the secure authentication model to provide a mobile node with global roaming service and integrate the Fast Handoff scheme with our approach to minimize the service latency. By starting the AAA(Authentication, Authorization and Account) procedure with Fast Handoff simultaneously when a roaming occurs, authentication latency is reduced significantly and provision of fast and seamless service is possible. The previous works such as IPsec(Internet Protocol Security), RR (Return Routability) and AAA define the procedures performed after the completion of Layer2 Handoff which leads us to study a way of providing the real time and QoS guaranteed service during this period. The proposed scheme is for this goal and when appling it to roaming environment it shows the cost reduction up to 55% and 17% for the case of the MN receiving the FBACK and not respectively before L2 Handoff occurs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4B
• /
• pp.191-199
• /
• 2007

Mobile node has to register its current location to Home Agent when it moves to another network while away from home. However, the registration procedure cannot be completed successfully when Home Agent is protected by the VPN gateway which guards MN's home network and discards the unauthorized packets incoming from outside as a lack of security association(SA) between the Care-of address and security policy of the home network so that the binding registration message without SA is discarded smoothly by the VPN gateway. This paper presents the authentication and key exchange scheme using the AAA infrastructure for a user in Internet to access the home network behind the VPN gateway. By defining the role of authentication and tunnel processing for each agent or relay entity, this paper presents the procedure to register the current location to its Home Agent with secure manner. Performance result shows cost improvement up to 40% comparing with existing scheme in terms of the packet loss cost, the property of mobility and traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8B
• /
• pp.1105-1114
• /
• 2010

The Proxy Mobile IPv6 (PMIPv6) has been standardized by the IETF NETLMM WG for network-based mobility management. The PMIPv6 can provide IP mobility for Mobile Nodes (MNs) with low handover latency and less wireless resource usage. But, since the PMIPv6 is basically designed for local mobility management, it cannot support directly global mobility management between different PMIPv6 domains. In the PMIPv6, since all traffic is routed through a Local Mobility Anchor (LMA), it causes a long end-to-end delay and triangular routing problem. Therefore, in this paper, we propose a fast network-based global mobility management scheme and route optimization scheme with a new network entity, called Global Mobility Agent (GMA). Numerical analysis and simulation results show that the proposed scheme is able to support global mobility between different public domains with low handover latency and low end-to-end delay, compared with the PMIPv6.

• The KIPS Transactions:PartC
• /
• v.14C no.6
• /
• pp.503-508
• /
• 2007

Since the Wibro service realize mobile network on the public, it has been considered that it is not enough to support real time service at vehicular speed. The standard Fast Mobile IPv6 Handover Protocol using HMIPv6 may guarantee seamless service as long as the Mobile Node moves in the same domain MAP however it does not regard fast handover over inter-MAP domain. Thus Macro Mobility Handover in HMIPv6 was proposed to reduce handover latency in inter-MAP domain. But it is still not enough to support real-time service. So we propose an Improved FHMIPv6 over 802.16e network to reduce the overall handover latency. We embedded Layer 3 handover messages of the FHMIPv6 into the Layer 2 handover messages. So the MN is able to $^-nish$ overall handover procedure earlier in our scheme. The numerical results show the performance of IFHMIPv6 has improved about 32% in comparison with FHMIPv6.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3B
• /
• pp.408-420
• /
• 2010

On a Mobile Ad hoc NETwork(MANET), it is difficult to detect and prevent misbehaviors nodes existing between end nodes, as communication between remote nodes is made through multiple hop routes due to lack of a fixed networked structure. Therefore, to maintain MANET's performance and security, a technique to identify misbehaving middle nodes and nodes that are compromise by such nodes is required. However, previously proposed techniques assumed that nodes comprising MANET are in a friendly and cooperative relationship, and suggested only methods to identify misbehaving nodes. When these methods are applied to a larger-scale MANET, large overhead is induced. As such, this paper suggests a system model called Secure Cluster-based MANET(SecCBM) to provide secure communication between components aperANET and to ensure eed. As such, this pand managems suapemisbehavior nodes. SecCBM consists apetwo stages. The first is the preventis pstage, whereemisbehavior nodes are identified when rANET is comprised by using a cluster-based hierarchical control structure through dynamic authentication. The second is the post-preventis pstage, whereemisbehavior nodes created during the course apecommunication amongst nodes comprising the network are dh, thed by using FC and MN tables. Through this, MANET's communication safety and efficiency were improved and the proposed method was confirmed to be suitable for MANET through simulation performance evaluation.

• Journal of Intelligence and Information Systems
• /
• v.11 no.1
• /
• pp.153-167
• /
• 2005

In this paper, we consider the problem of exploring unknown environments with a mobile robot or an autonomous character agent. Traditionally, research efforts to address the space exploration problem havefocused on the graph-based space representations and the graph search algorithms. Recently EXPLORE, one of the most efficient search algorithms, has been discovered. It traverses at most min$min(mn, d^2+m)$ edges where d is the deficiency of a edges and n is the number of edges and n is the number of vertices. In this paper, we propose DFS-RTA* and DFS-PHA*, two real-time graph search algorithms for directing an autonomous agent to explore in an unknown space. These algorithms are all built upon the simple depth-first search (DFS) like EXPLORE. However, they adopt different real-time shortest path-finding methods for fast backtracking to the latest node, RTA* and PHA*, respectively. Through some experiments using Unreal Tournament, a 3D online game environment, and KGBot, an intelligent character agent, we analyze completeness and efficiency of two algorithms.

• The Journal of the Korea Contents Association
• /
• v.7 no.1
• /
• pp.94-102
• /
• 2007

Today, packet services for wireless internet is provided by WiBro WLAN 3G, but it is hard to be satisfied seamless connection in each of networks and wide-area service will increase the number of BS(base station) because WiBro and WLAN has been coverage smaller than 3G. that is, communicate which can use continuous and seamless data service is available when user is moving. Therefore, service provider need to integrate network for reducing management expenses. In this paper, we propose advanced handoff algorithm which is considered by 'user demand bandwidth', 'MN(Mobile Node) movement speed' and 'MN service area' and show that simulating result is superior to 'bandwidth allocation', 'QoS(Quality of Service) rate' and 'handoff failure rate'

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.3
• /
• pp.61-67
• /
• 2008

Proxy MIPv6 (PMIPv6) is that network-based mobility management protocol that network supports mobile node's mobility on behalf of the MN. In PMIPv6, when two MNs located within the same PMIPv6 domain want to communicate each other, sub-optimal path is established between the two MN. Route optimization method for PMIPv6 is proposed to resolve the problem. However, the method still suffer from the performance degradation due to out-of-sequence packet problem. In this paper, we propose the route optimization mechanism in PMIPv6 based on Flush message to resolve the out-of-sequence packet problem. The proposed mechanism is evaluated by performing simulations, and the simulation results show that the proposed one gives better performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.344-357
• /
• 2015

With the increase in a number of access technologies and data rates, a continuous connection among different networks is demand of the future wireless networks. In the last decade, user connectivity among different access networks remained a challenging job. Therefore, in this article, we proposed a user-centric and user-perspective based network selection mechanism for fast handover management in heterogeneous wireless networks. The proposed scheme selects the most appropriate network among available networks on the basis of resources i.e. cost, data rate, and link quality. Initially, we load the Media Independent Information Service (MIIS) with the information of cost and data rate provided by different network operators. Similarly, Mobile Node (MN) is also loaded with the user preferred cost and data rate for different applications. The MN obtains the information of cost and data rate from MIIS server upon a predefined threshold, and make a decision for handover according to its current cost and data rate. Furthermore, we employ an optimal threshold mechanism for initiation of the handover execution phase to minimize false handover indications. The proposed scheme is based on a survey for network selection and its implementation in C programming language to validate its performance and accuracy. The simulation result shows that the proposed scheme performs superior then the schemes present in the current literature.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.901-910
• /
• 2010

$IP^2$, as an extended concept of the next generation IMT network, is a concept of basically supporting mobility using two steps of IP address (i.e. IPha (IP Host address) and IPra (IP routing address)) in IP backbone network. Current $IP^2$system has a shortcoming of excess usage of network resources caused by sending paging messages to all cells in LA (Location Area) in paging procedure. Considering the evolving direction of network, which is taking mobility with various speed and integration of devices into consideration, this shortcoming must be overcome. In this paper, we proposed a method to reduce time and memory for paging by maintaining current information of MN (Mobile Node) not in Active state with proxy server. Performance evaluation based on NS-2 simulations has shown that the efficiency of network resources is improved in the proposed method.