• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1178-1181
• /
• 2009

Geographic forwarding algorithms을 사용하는 Georouting protocol에서는 route maintenance을 위해서 고정된 주기마다 beacon message을 이웃노드에 전송하는 fixed periodical beacon based route algorithm을 사용하여 mobile node 정보를 습득한다. Fixed periodical beacon scheme에서의 기존 연구 이슈는 이웃노드 정보의 신뢰성을 유지하기 위해서 다양한 mobility environment 환경에 맞도록 beacon 전송주기를 적절히 결정하는 연구가 진행되어 왔다. 이와 같은 연구에서는 long periodical interval 사용 시 이웃노드의 위치정보 error을 발생시킬 확률이 높으며 또한 short periodical interval 의 경우 네트워크 내에 high route overhead 을 유발시키는 단점을 가지고 있다. 따라서 고정된 주기 방법은 다양한 mobility environment에 잘 적용되지 못하며 또한 mobility environment 에서 발생하는 route maintenance 내에 이웃노드 정보에 대한 불확실성 문제가 빈번이 발생하여 경로 설정에 잘못된 정보를 제공하여 경로 신뢰성(path reliability)과 낮은 전송률 (transmission rate)을 야기한다. 본 논문에서는 이런 이웃노드 정보의 불확실성 문제를 극복하기 위해서 mobile node가 스스로 자신의 위치를 체크하여 routing table을 능동적으로 갱신하는 방법을 이용하여 이 문제를 극복할 수 있도록 하였다. 모의 실험은 ns2를 이용하여 실시하였으며 결과는 low/high mobility scenario에서는 기존 방법 보다 routing overhead 을 줄이면서 높은 전송률 (transmission rate)을 보인다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.3
• /
• pp.193-204
• /
• 2012

This paper specifies a low-cost global mobility management architecture and protocol procedure called LC-$GM^2$, which is based on Proxy Mobile IPv6. In LC-$GM^2$, mobility management is performed by the network entity. The benefit is the elimination of the wireless link data delivery tunnel overhead between a mobile node and the access router. To compare with the well-known Hierarchical Mobile IPv6 mobility management protocol and GPMIP, the location update, packet delivery, and total cost functions generated by a mobile node during its average domain residence time are formulated for each protocol based on Fluid-flow mobility model. Then, the impacts of various system parameters on the cost functions are analyzed. The analytical results indicate that the proposed global mobility management protocol can guarantee lower total costs.

• International Journal of Advanced Culture Technology
• /
• v.1 no.2
• /
• pp.7-12
• /
• 2013

Mobility management is an important issue in Mobile Ad Hoc Networks (MANETs) because location information of mobile nodes is frequently changed and it aggravates the performance in MANETs drastically. In this paper, we propose a fuzzy logic based mobility management scheme using group quorum system by considering the mobile nodes' locality in order to manage location information of mobile nodes in MANETs efficiently. The proposed scheme selects mobility databases adaptively from group quorum system by considering the degree of locality of a mobile node. The performance of the proposed scheme is evaluated by an analytical model and compared with that of existing mobility management scheme.

• Journal of KIISE:Information Networking
• /
• v.31 no.4
• /
• pp.393-404
• /
• 2004

Recently, mSCTP (Mobile SCTP) has been proposed as a transport layer approach for supporting mobility. mSCTP is based on the ‘multi-homing’ feature of Stream Control Transmission Protocol(SCTP), and utilize the functions to dynamically add or delete IP addresses of end points to or from the existing connectionin order to support mobility. In this paper, we propose a mechanism to determine when to add or delete an W address, utilizing the link layer radio signal strength information in order to enhance the performance of mSCTP We also propose a mechanism for a mobile node to initiate the change of data delivery path based on link layer radio signal strength information. In addition, if it takes long time to acquire new data path, we propose an approach for reducing handover latency. The simulation results show that the performance of proposed transport layer mobility support mechanism is competitive compared to the traditional network layer mobility supporting approach. Especially, when the moving speed of mobile node is fast, it shows better performance than the traditional network layer approaches.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.6
• /
• pp.17-24
• /
• 2011

In this paper, we propose an Entropy-based Routing Protocol using Mobility (ERPM) for supporting ubiquitous convergence services efficiently in mobile ad-hoc wireless networks. The main features that the ERPM introduces to obtain the goals can be summarized as follows. First, ERPM can construct stable routing routes based on the entropy concepts using mobility of nodes. Second, ERPM can quantitatively evaluate the stability of route by entropy concepts using mobility of nodes. Third, ERPM can select the most stable route in the view points of mobility of routes between a source node and a destination node, where multiple paths are available. The performance evaluation of the proposed ERPM performed via simulation using OPNET and analysis shows that the ERPM can support the construction of stable routing routes and increase the transmission ratio of data efficiently.

• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.352-361
• /
• 2004

In this paper, we study how to achieve the maximum capacity under delay constraints for large mobile wireless networks. We develop a systematic methodology for studying this problem in the asymptotic region when the number of nodes n in the network is large. We first identify a number of key parameters for a large class of scheduling schemes, and investigate the inherent tradeoffs among the capacity, the delay, and these scheduling parameters. Based on these inherent tradeoffs, we are able to compute the upper bound on the maximum per-node capacity of a large mobile wireless network under given delay constraints. Further, in the process of proving the upper bound, we are able to identify the optimal values of the key scheduling parameters. Knowing these optimal values, we can then develop scheduling schemes that achieve the upper bound up to some logarithmic factor, which suggests that our upper bound is fairly tight. We have applied this methodology to both the i.i.d. mobility model and the random way-point mobility model. In both cases, our methodology allows us to develop new scheduling schemes that can achieve larger capacity than previous proposals under the same delay constraints. In particular, for the i.i.d. mobility model, our scheme can achieve (n-1/3/log3/2 n) per-node capacity with constant delay. This demonstrates that, under the i.i.d. mobility model, mobility increases the capacity even with constant delays. Our methodology can also be extended to incorporate additional scheduling constraints.

• Journal of Information Processing Systems
• /
• v.3 no.1
• /
• pp.1-7
• /
• 2007

In mobile ad hoc networks, an application scenario requires mostly collaborative mobility behavior. The key problem of those applications is scalability with regard to the number of multicast members as well as the number of the multicast group. To enhance scalability with group mobility, we have proposed a multicast protocol based on a new framework for hierarchical multicasting that is suitable for the group mobility model in MANET. The key design goal of this protocol is to solve the problem of reflecting the node's mobility in the overlay multicast tree, the efficient data delivery within the sub-group with group mobility support, and the scalability problem for the large multicast group size. The results obtained through simulations show that our approach supports scalability and efficient data transmission utilizing the characteristic of group mobility.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7B
• /
• pp.991-1000
• /
• 2010

The Hierarchical Mobile IPv6 (HMIPv6) has been proposed to accommodate frequent mobility of the Mobile Node. HMIPv6 can effectively reduce the signaling overhead and latency. However, it has a problem that the registration of a mobile node concentrates on the furthest MAP(Mobility Anchor Point) when the mobile node enters into a new domain. This paper proposes a new load distribution mechanism by using the concept of Nash Bargaining Solution. The main advantage of the proposed scheme can prevent load concentration from being registered to the specified MAP based on the weight value according to the available resource-ratio of a MAP. With a simulation study, the proposed scheme can improve network performance under widely diverse traffic load intensities.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.05a
• /
• pp.351-356
• /
• 2004

The binding update of the Mobile IPv6 which does a route optimization in basic by the node which moves frequently brings about the signaling traffic increase of binding update. It supplements this the MAP(Mobile Anchor Point) for to let, and Hierarchical Mobile IPv6 which considers a macro mobility and a micro rambling regional mobility was proposed. But Mobile IPv6 when transmitting the packet, always does to pass by the mP, the packet intensive actual condition of the MAP to occur it does not guarantee a route optimization. In this study, It accomplishes the course improvement which considers the mobility of mobile node and it interprets the relaxation quality of packet intensive actual condition with the MAP

• Journal of information and communication convergence engineering
• /
• v.14 no.2
• /
• pp.89-96
• /
• 2016

In mobile communication, there are various types of handoff for the support of all forms of mobility. Proxy mobile IPv6 (PMIPv6) enables local network-based mobility management of a mobile node without any effect of mobility-related signaling. Recently, PMIPv6 has been considered for supporting mobility management in LTE/SAE-based mobile networks. To support seamless mobility in heterogeneous mobile networks, the overall cost of handoffs needs to be minimized and the procedure should be guaranteed to be secure. However, the reduction of the authentication cost has not been fully investigated to provide seamless connectivity when mobile users perform a handoff between the PMIPv6 domains. This paper proposes secure pre-authentication schemes, completing an authentication procedure before performing a handoff, for a fast handoff in PMIPv6. Analytic models have been used for measuring the authentication latency and for the overhead cost analysis. In addition to providing fast authentication, the proposed pre-authentication schemes can prevent threats such as replay attacks and key exposure.