• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.879-882
• /
• 2003

이동 컴퓨팅 환경이 보편화 되면서 이동 노드에게 QoS를 제공하려는 시도들이 늘고 있다. 이동 노드에게 QoS를 제공하기 위해서는 몇 가지 문제들이 있다. 본 논문에서는 세 가지 문제들에 대해서 알아보고 개선방안을 제시하였다. 첫 번째 문제는 호스트의 이동에 의한 경로 변경이다. RSVP의 경우 경로가 변경되면 기존의 자원 예약을 사용할 수 없으며, 다시 자원 예약을 해야 하는 문제가 있었다. 이 문제는 RSVP 및 교차 라우터의 기능을 확장하여 기존의 경로와 새로운 경로의 중첩되는 경로를 재사용하도록 함으로써 개선하고자 하였다. 두 번째 문제는 이동 호스트가 방문 네트워크에 있을 때 데이터는 HA를 거쳐서 전달되며 송신자가 이동 호스트에게 직접 전달하는 것보다 비효율적이다. 이 문제는 본 논문에서 정의한 LDIS(Location Discovery)와 SESSION_Update를 이용하여 송, 수신자가 상대방의 CoA를 항상 유지하게 하여 QoS 설정 및 데이터 전송을 직접 하도록 함으로써 개선하고자 하였다. 세 번째 문제는 인터넷이 여러 형태의 네트워크들로 구성되어 있으며, 각 네트워크들은 공통적인 QoS 기술을 사용하지 않는 것이다. 이 문제는 GR(Gateway Router)의 기능 확장과 네트워크의 내부 QoS 설정을 외부 네트워크의 QoS 설정과 독립시킴으로써 개선하고자 하였다.

• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.289-302
• /
• 2005

The mobile agent has very various performance according to the element of communication number of times between hosts, quantity of transmission data agent's size, network state etc. specially, migration method is caused much effect in whole performance of distributed system. Most existing migration methods have simplicity structure that it moves doing to accumulate continuously result after achieving task by visiting host in the fixed order. Therefore, in case there are situation such as fault, obstacle, and service absence etc. This can be inefficient due to mobile agent increased network required time. In this paper, we design and implementation Multicast Migration Model for minimizing network required time by solving this problems. Multicast Migration Model includes components such as mobile agent including call module and naming agent, which provides object replication information and distributed server's location transparence. And we evaluate and compare with existing migration method applying prototype system to verify implemented migration model.

• Journal of KIISE:Databases
• /
• v.32 no.1
• /
• pp.56-70
• /
• 2005

The results of location-dependent queries(LDQ) generally depend on the current locations of query issuers. Many mechanisms, e.g. broadcast scheme, hoarding, or racking policy, have been developed to improve the system peformance and provide better services, which are specialized for LDQs. Considering geographical adjacency of data and characteristics oi target area, caching policy and broadcast scheme affect the overall performance in LDQ. For this reason, we propose both the caching policy and broadcast scheme, which these features are reflected in. Based on the adjacency of data in LDQ, our broadcast scheme use Hilbert curve to cluster data. Moreover, in order to develop the caching policy suitable for LDQ on urban area, we apply the moving distance of a MH(Mobile Host) to our caching policy We evaluate the performance of the caching policy measuring the workload of MHs and the correctness of LDQ results and the performance of the broadcast scheme measuring the average setup-time of MHs in our experiments. Finally, we expect that our caching policy Provides more correct answers when executing LDQ in focal cache and leads significant improvement of the performance of MHs. It also seems quite probable that our broadcast scheme leads improvement of battery life of the MH.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.322-324
• /
• 2001

분산 환경에서 여러 호스트들간의 자료를 공유하는 것은 네트워크에 부하를 줄이고 가용도를 높일 수 있지만 복제된 공유 자료들의 일치성을 유지하는 것이 필요하다. 전통적으로 분산된 공유자료의 일치성을 위해서 무효화방식(invalidate protocol), 갱신방식(update protocol) 그리고 이주방식(migratory protocol)등이 사용되었다. 분산 환경뿐만 아니라 이동컴퓨팅 환경에서도 분산된 호스트들간에 공유자료의 일치성을 유지하기 위해서 적절한 프로토콜을 선택하는 것은 중요하다. 본 논문에서는 이동 컴퓨팅 환경에 효과적으로 적용 할 수 있는 공유자료의 일치성 유지하기 위한 프로토콜을 제안하고 성능 분석을 하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.439-441
• /
• 2003

사용자의 인터넷 환경이 점차 무선 접속을 통한 인터넷의 사용과 실시간 응용 데이터의 사용이 늘어가는 추세에 따라. 이동 인터넷 서비스를 하기 위한 방안으로 Mobile If와 Mobile IPv6가 제시되었다. 본 논문에서는 Mobile IPv6 환경에서 Neighbor Discovery 중 Router Solicitation과 Router Advertisement가 호스트의 이동성 지원에 미치는 영향을 분석하였다. Neighbor Discovery 메시지들의 주기를 변경하여, 실제 구현, 측정하여 Handoff의 효율성과 전송 대역폭 overhead의 상관관계를 알아보았다.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.4 s.32
• /
• pp.167-172
• /
• 2004

Although Mobile IP proposed in IETF is effective. it has inefficiency in case mobile hosts communicate with each others while they are roaming frequently in a specific area. It occurs lots of latency because mobile hosts must be registered and establish an secure path under the internet emvironments and transmitting data on the path. Additionally this inefficiency is more aggravated in case mobile hosts has high mobility. Thus this paper propose a method using Anchor foreign agent by Anchor chain method which combine an pointer forwarding and a cache method plus a border router as a way to complement the above problem which exists in an mobility management in a specific area.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.213-217
• /
• 2003

An Ad-Hoc networks is a set of wireless mobile host which forms temporary networks without any concentrated controls or any helps of standard support services. Mobile host' routers are operated by their mobile hosts without fixed routers, therefore, the original routing protocol algorithm are not effective. There are two major Protocols in Ad-Hoc Network. A Table-Driven algorithm and an On-Demand, but the latter is presented more effective. We try to compare and analyze the performances of each protocol's host in this thesis.

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

Mobiel IP 기반의 이동 호스트의 핸드오프시 새로운 COA를 HA에 등록하는 과정에서 많은 지연이 발생한다. 본 논문에서는 802.11 무선 LAN 환경에서 Mobile IP 기반의 이동 호스트가 핸드오프를 수행할 때 발생하는 전송 지연을 줄이기 위한 방안을 제안한다. 제안된 방식은 핸드오프 시 발생하는 전송 지연을 줄이기 위해서 802.11 MAC에서 일반적인 트래픽과 이동 호스트가 새 COA를 HA에 등록하기 위해서 발생하는 등록 요청 메세지를 분리해서 백오프를 처리한다. NS-2를 이용하여 시뮬레이션 한 결과, 일반적인 트래픽과 둥록 요청 메세지를 분리해서 백오프를 처리한 경우 Mobile IP 핸드오프 과정에서 발생하는 지연이 줄어들었음을 보였다.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.589-596
• /
• 2002

Tn the data transmission service of the mobile host, it is needed to reduce the bandwidth and to make a reliable error recovery. there are two appropriate methods in that. One is FEC which retransmits the parity of error recovery, in case of happening of the loss after forming the parity of error recovery by grouping original data. The other is local recovery based on server which can block the implosion of transmission. The use of FEC and local recovery based on server at the same time enables the reliable multicast. This paper suggests algorithm that recovers the loss by FEC and local recovery based on server through the solution of the problems about triangle routing, tunnel convergence by dividing mobile host into two parts-the sender and the receiver. This model about the loss of algorithm tested the efficiency of performance by the homogeneous independent loss, the heterogeneous independent loss, the shared source link loss model. The suggested algorithm confirms effectiveness in the environment where there are much data and many receivers in mobile host.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.336-346
• /
• 2001

A wireless ad-hoc network is a temporal network formed by a collection of wireless mobile nodes without the aid of any existing network infrastnlcture or centralized administration. Currently, numerous routing protocols have been developed for changing messages between nodes in a wireless ad-hoc network. Applications of wireless ad-hoc network technology are various and proper routing protocol must be used according to application domain or network size. In a wireless ad-hoc network. some hosts want services from fixed networks. For supporting such services, it is necessary to interconnect wireless ad-hoc networks and fixed networks. The DSMIHDynamic Source Multipath Routing) protocol, proposed in this paper, focuses on supporting seamless communication services between the nodes within a wireless ad-hoc network and providing fixed networks to the mobile hosts in wireless an-hoc networks. In DSMR protocol, each node need not broadcast routing messages periodically. and mobile hosts that to send data packets initiate route request and route establishment procedure. By maintaining multiple paths in each node. faster route re-establishment is also possible in our scheme.