• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.641-644
• /
• 2010

Proxy Mobile IPv6에서는 같은 Local Mobility Anchor 내의 다른 Mobile Access Gateway에 있는 Mobile Node 들의 패킷 전송에 있어서 발생하는 삼각 라우팅 문제는 여전히 존재한다. 이 문제점을 해결하기 위해 인터넷 드래프트 Liebsch와 Dutta에서 제안된 두 가지 Route Optimization 기법의 동작과정을 알아보고, 상호 데이터 전송 상황에서 더 나은 성능을 제공하는 Correspondent Route Optimization 기법을 제안한다. 통신을 맺고 있던 Mobile Node가 Local Mobility Anchor 내 다른 Mobile Access Gateway의 범위로 이동할 경우 발생하는 핸드오버 상황에서 Correspondent Route Optimization 기법을 사용하여 signaling cost를 줄이는 방법을 제안한다. 제안한 Route Optimization 기법은 Correspondent Flag를 추가하여 Mobile Access Gateway 간 Corresponding Binding을 완료하여, Route Optimization을 설정한다. 제안한 Correspondent Route Optimization 기법은 기존의 기법보다 상호 데이터 전송 상황에서 Route Optimization에 필요한 메시지 수가 적기 때문에 시그널링 비용이 감소한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.941-945
• /
• 2007

이동 서비스를 지원하기 위한 프로토콜 중 현재 가장 주목 받고 있는 Proxy Mobile IPv6 (PMIPv6)에서 Mobile Node (MN)는 Local Mobility Anchor (LMA)와 Mobile Access Gateway (MAG)의 지원으로 무선 접속을 위한 기능 이외의 추가적인 동작 과정 없이 이동성을 가질 수 있다. PMIPv6 에서의 LMA 는 MN 에게 이동 서비스를 지원함에 있어서 가장 중추적인 역할을 하기 때문에 어떤 LMA 가 MN 에게 서비스를 지원하느냐에 따라 이동 서비스의 질은 직접적인 영향을 받는다. 따라서 본 논문에서는 이동 서비스에 영향을 미칠 수 있는 요소인 LMA 와 MAG 사이의 통신 비용과 LMA가 이동 서비스를 제공하고 있는 MN 의 수를 고려하여 Fuzzy Logic 을 이용한 LMA 선택 기법을 제안한다. 본 논문에서 제안하는 기법은 다수의 LMA 를 제공하는 사업자에게 있어서 적당한 LMA를 선택하여 서비스를 제공할 수 있도록 함으로써 MN 에게 항상 양질의 이동 서비스를 제공할 수 있도록 한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.11
• /
• pp.2992-3007
• /
• 2012

Recently there has been an increasing interest in exploring the radio irregularity research problem in Wireless Sensor Networks (WSNs). Measurements on real test-beds provide insights and fundamental information for a radio irregularity model. In our previous work "LMAT", we solved the path planning problem of the mobile anchor node without taking into account the radio irregularity model. This paper further studies how the localization performance is affected by radio irregularity. There is high probability that unknown nodes cannot receive sufficient location messages under the radio irregularity model. Therefore, we dynamically adjust the anchor node's radio range to guarantee that all the unknown nodes can receive sufficient localization information. In order to improve localization accuracy, we propose a new 2-hop localization scheme. Furthermore, we point out the relationship between degree of irregularity (DOI) and communication distance, and the impact of radio irregularity on message receiving probability. Finally, simulations show that, compared with 1-hop localization scheme, the 2-hop localization scheme with the radio irregularity model reduces the average localization error by about 20.51%.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.875-878
• /
• 2008

Proxy MIPv6 환경에서 Local Mobility Anchor는 이동 단말에 대해 이동성을 제공하기 위한 등록과정과 데이터의 터널링을 제공한다. 다수의 Mobile Access Gateway에 위치하는 모든 이동 단말에 대해 서비스를 제공하여야 하기 때문에 Local Mobility Anchor는 병목현상을 일으킬 수 있으며 이것은 Local Mobility Anchor에 의해 관리되는 모든 이동 단말에 대해 전체적인 이동 서비스의 실패로 이어질 수 있다. 본 논문에서는 이러한 문제를 해결하기 위해 다수의 Local Mobility Anchor에 부하를 분배하며 특정한 Local Mobility Anchor에 부하가 집중될 경우 효과적으로 재분배하기 위한 기법을 소개한다. 본 논문에서 제안하는 기법을 통해 다수의 이동 단말에게 서비스를 제공하는 Proxy MIPv6 환경에서도 안정적이고 양질의 서비스를 제공하며 자원을 효율적으로 이용할 수 있을 것으로 기대된다.

• 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

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.5
• /
• pp.77-87
• /
• 2018

Many researches have been focused on localization in WSNs. However, the solutions for localization in static WSN are hard to apply to the mobile WSN. The solutions for mobile WSN localization have the assumption that there are a significant number of anchor nodes in the networks. In the resource limited situation, these solutions are difficult in applying to the static and mobile mixed WSN. Without using the anchor nodes, a localization service cannot be provided in efficient, accurate and reliable way for mixed wireless sensor networks which have a combination of static nodes and mobile nodes. Also, accuracy is an important consideration for localization in the mixed wireless sensor networks. In this paper, we presented a method to satisfy the requests for the accuracy of the localization without anchor nodes in the wireless sensor networks. Hop coordinates measurements are used as an accurate method for anchor free localization. Compared to the other methods with the same data in the same category, this technique has better accuracy than other methods. Also, we applied a minimum spanning tree algorithm to satisfy the requests for the efficiency such as low communication and computational cost of the localization without anchor nodes in WSNs. The Java simulation results show the correction of the suggested approach in a qualitative way and help to understand the performance in different placements.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3480-3500
• /
• 2017

Accurate locating for the mobile target remains a challenge in various applications of wireless sensor networks (WSNs). Unfortunately, most of the typical localization algorithms perform well only in the WSN with densely distributed sensor nodes. The non-localizable problem is prone to happening when a target moves into the WSN with sparsely distributed sensor nodes. To solve this problem, we propose a collaborative and predictive localization algorithm (CPLA). The Gaussian mixture model (GMM) is introduced to predict the posterior trajectory for a mobile target by training its prior trajectory. In addition, the collaborative and predictive schemes are designed to solve the non-localizable problems in the two-anchor nodes locating, one-anchor node locating and non-anchor node locating situations. Simulation results prove that the CPLA exhibits higher localization accuracy than other tested predictive localization algorithms either in the WSN with sparsely distributed sensor nodes or in the WSN with densely distributed sensor nodes.

• Journal of KIISE:Information Networking
• /
• v.31 no.2
• /
• pp.158-170
• /
• 2004

Mobile IP is a base protocol to support host mobility in IP-based wireless network. It is well known that the protocol contains two main delay factors on a handoff process; one is to detect a host movement, and the other is to register the host's current location to its home network. This paper examines Layer 2(L2) handoff procedure in the IEEE 802.11 Wireless LAN, and identifies these L2 triggers that can be usefully applied to Layer 3(L3) handoff. Then, the MCAA(Multiple-Casting using Anchor Agent) mechanism is proposed. It makes use of the L2 trigger and the network topology to construct an anchor agent dynamically, and the multiple-casting scheme to prevent an ongoing packet to be lost. Using a network simulator, the proposed mechanism has been evaluated the handoff delay and the packet lost point of view, in comparison with the regional registration protocol which is the most well known micro mobility support mechanism.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.1489-1492
• /
• 2003

이동 컴퓨팅 환경에서 사용자의 이동 특성은 실시간 멀티미디어 서비스를 제공하기 위해서 요구되는 QoS(Quality of Service)에 심각한 영향을 미친다. RSVP(Resource reservation Protocol)는 유선을 기반으로 실시간 서비스를 제공하기 위해서 제안된 프로토콜로써 이동 환경에 적용하기에는 부적합하다. MRSVP(Mobile RSVP)는 RSVP를 기반으로 사용자의 이동이 QoS에 미치는 영향을 최소화하기 위해서 사용자가 이동할 것으로 예상되는 영역에 대한 자원을 미리 예약하는 프로토콜이다. 본 논문은 기존의 MRSVP를 확장하여 Mobile IP 지역등록(Regional Registration) 프로토콜과 이웃 라우터 발견 메커니즘(Neignbor Router Discovery Mechanism)을 결합하여 동적 앵커 에이전트(DAA: Dynamic Anchor Agent)를 계층적으로 구성하는 QoS지원 방안을 제안한다. 이는 기존의 MRSVP에서 미리 예약되는 자원예약 범위를 네트워치 위상을 고려하여 지역적으로 제한함으로써 자원예약을 최소화하는 반면에 기존의 MRSVP와 유사한 수준의 QoS 보장을 목적으로 한다.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.10
• /
• pp.994-1001
• /
• 2009

CSS (Chirp Spread Spectrum) specified in IEEE 802.15.4a can be used for ranging applications. In this paper, we apply the CSS to estimate the coordinates of a mobile robot. Four anchor nodes are installed at known positions and a tag node is attached to the target mobile robot. By CSS ranging, we measure the distances between each anchor and the tag node. Based on the measured distances, the coordinates of the mobile robot can be calculated by the method of trilateration. However the calculated coordinates are not accurate because of the errors of the measured distances. Therefore we propose an algorithm for reducing the effect of the errors. The proposed algorithm is executed with the extended Kalman filter. Through localization experiments, we show the performance of the proposed algorithm and the accuracy of the estimated position.