• The Transactions of the Korea Information Processing Society
• /
• v.5 no.3
• /
• pp.763-773
• /
• 1998

본논문은 TCP/IP를 사용하는 기존의 LAN상에 이동 호스트들이 셀의 형태로 덧붙여진 환경에서 이동 호스트와 고정 호스트간의 지속적인 세션을 지원하는 개선된 IP 체계인 SIMIP을 제안하였다. 이동형 프로토콜 설계시 라우팅 최적화가 매우 중요한 항목이고 이는 이동 호스트의 위치정보 관리방법과 직접적인 관계가 있다. 기존의 아이비엠과 마쓰시다 제안은 이를 집중화하였으며 콜롬비아와 소니제안은 이를 분산화하였다. MH 위치정보를 집중화하면 트라이앵글 문제로 인해 최적의 라우팅 경로를 지원할 수 없으며 집중화된 라우터의 실패 발생시는 위험도가 매우 크다. 반면에 분산화하면 위의 문제들은 해결되지만 캡슐화되는 주소를 찾기위해 CACH 또는 AMT와 같은 복잡한 기법이 요구된다. SIMIP은 MH위치정보를 DMR에 집중화하였으나 DMR 실패 발생시는 복수의 GMR중에서 하나가 자동적으로 DMR로 대체되어 위험도를 최소화시켰고, 'DMR 경로변경'에 의해 최적의 라우팅 경로를 지원하였다는 점에서 다른 제안들과 차이가 있다. 이동에 따른 주소변경을 해결하기 위해 가상네트워크 기법을 적용하였고, 이동 호스트로의 데이터 송신시 디폴트 라우팅 개념을 이용하였고, 이동라우터간 터널링에 IPIP 캡슐화를 사용하였다. SIMIP은 다른 제안에 비해 실용성있고, 신뢰성이 강하며, 구현이 용이하므로 산업계에서 활용가치가 있으리라본다.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.75-81
• /
• 2012

This paper has proposed Message Count Control Mechanism based Link State Update(LSU) Algorithm that has not had a strong influence on the depreciation of QoS routing performance. Most existing LSU algorithms have the limit that cannot control the count of LSU message. Especially, adaptive algorithms have a bad performance when traffic are excessive and fickle. We classify as the importance of LSU message that have a influence on available bandwidth and determine the transmission of the message according to update rate per a unit of time. We have evaluated the performance of the proposed model and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.517-520
• /
• 2009

Healthcare application system has been actively researched to apply WSN technology to healthcare area with a mobile sensor node of low cost, low power, and small size. Sensor node has the problem for transmission range of RF power and time delay of the wireless routing connectivity between sensor nodes. In this paper, we proposes a new method utilizing mobile sensor nodes with relay sensor nodes for quick network routing changing using query technique in healthcare system. A query processor to control and manage the routing changing of sensor nodes in a wireless sensor network was designed and implemented. The user's PC transmits the beacon message which will change the quick link routing according to activity status of patient in wireless sensor network. We describe the implementation for query protocol that is very effective of power saving between sensor nodes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.4
• /
• pp.180-187
• /
• 2002

Many real-time multimedia applications, such as video conferencing have stringent end-to-end delay constraints and consume large amount of network resources. In order to support these applications efficiently, multicast routing algorithms computing least cost multicast trees that satisfy a given end-to-end delay constraint are needed. However, finding such a tree is known to be computationally expensive. Therefore, we propose a heuristic distributed multicast routing algorithm that reduces a “finding multicast tree”that satisfies a given end-to-end delay constraint and minimizes the average resulting tree cost. Also, simulation results show that the proposed algorithm has much better average cost performance than other existing algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.489-491
• /
• 2009

Recently, a range of diverse networks are undergoing speedy evolution and inspiring variety applications. Among many networks, mobile Ad-Hoc networks (MANETs) are active working with a part of routing protocols. But, the majority of routing protocols have required a unique identifier, such as an IP address. At this while, IP address assignment scheme in MANET remains unsolved. When a centralized agent server is not exist, IP address is an critical issue such as a single MANET. This paper look over previous work about basic principles, also we suggest simple solution to overcome the power of two ($2^m$).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10A
• /
• pp.1517-1531
• /
• 1999

The Internet is recently evolving into the directions which is capable of incorporating stream-type services such as voice and video services. However, the existing Internet can only support a best-effort delivery model and thus it is difficult to satisfy these requirements as well as to provide the QoS beyond a certain degree. Accordingly, it is imperative to develop QoS based routing algorithm in order to allow the routing by the user's QoS demand and to be applied into wide area networks. In this thesis, we presented new routing algorithms and made performance evaluations. The proposed algorithms allow the routing by the user’s QoS demand level in order to provide the diverse Internet application services based on ATM network environment that is expected to play a role as an infrastructure of high-speed communication network. They also have a feature of shortening the waiting time for address analysis and have a quality-proven characteristics with enhanced network scalability.

• Journal of KIISE:Information Networking
• /
• v.27 no.3
• /
• pp.339-347
• /
• 2000

최선형 서비스(best effort service) 방식의 현재 인터넷은 실시간 응용의 출현과 보다 나은 서비스를 기대하는 사용자들에 의해 많은 변화가 요구되고 있다. 이러한 요구를 만족시키기 위해서 새로운 프로토콜, 트래픽 제어 및 QoS 라우팅 등에 관한 연구가 진행되고 있으며, 최근 트래픽 제어를 통해 서로 다른 수준의 서비스를 제공하는 차별화 서비스(differentiated service)모델에 관하여 많은 연구가 진행중이다. 두 가지 우선 순위를 바탕으로 사용자에게 어느 정도 예측 가능한 대역폭을 제공하는 RIO 모델은 차별화 서비스의 대표적인 모델이다. 하지만 RIO 모델에서 제공하는 대역 분배 방식은 네트워크 용량이 충분치 못한 상황에서는 서비스 차별화가 이뤄지지 않으며, 잉여 대역폭의 적절한 분배가 이뤄지지 않는다. 본 논문에서는 시뮬레이션을 통하여 네트워크 상황에 따른 RIO모델의 대역 분배 성능을 분석하였으며, 이를 개선하여 보다 효과적인 서비스 차별화가 이뤄지도록 하였다.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.361-367
• /
• 2003

Ad-hoc network is a multi-hop wireless network formed by a collection of mobile nodes without the aid of any establish infrastructure and this network can provide an extremely flexible method for establishing communications for fire, safety, rescue operations, battle field or other fields requiring rapidly deployable communications with survivable, efficient dynamic networking. Recently new expended mechanism is proposed as Ad-hoc relay system, so guarantee of QoS for multimedia applications is needed more and more. In this paper, we propose ARM based QoS Distribution Monitoring Mechanism to provide Quality of Service guarantees to multimedia application with MANET.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.397-399
• /
• 2005

무선 센서노드를 활용한 다양한 네트워크 설계 기술은 실생활의 각종 정보 수집에서부터 환경 모니터링까지 폭넓은 활용범위를 바탕으로 저전력 노드 설계 기술, 노드간 라우팅 프로토콜, 초소형 운영체제 및 미들웨어기술 등 관련 연구가 활발히 수행되고 있으며, 실내 센서네트워크에 분포된 노드의 절대위치를 측정하는 위치인식 시스템은 노드의 이동성, 다수성 그리고 환경의 제약성으로 인해 이를 보완할 시스템이 요구되고 있다. 이에 본 논문에서는 고정 센서노드의 배치밀도에 따라 위치정보를 선별적으로 처리하는 위치데이터 처리기와 다중 위치데이터의 발생을 원천적으로 차단하는 노드간 라우팅 기법을 통해, 센서노드의 이동성과 다중성을 효과적으로 보완하는 실내 이동객체 위치인식 시스템을 설계하고 서비스 구현을 위한 센서네트워크 플랫폼을 제안한다.

• The Journal of the Korea Contents Association
• /
• v.11 no.12
• /
• pp.78-87
• /
• 2011

A variety of intelligent application using the sensor network system is being studied. In general, the sensor network consists of nodes which equipped with a variety of sensing module and is utilized to collect environment information. Recently, the demands of multimedia data are increasing due to the demands of more detailed environmental monitoring or high-quality data. In this paper, we overcome the limitations of low bandwidth in Zigbee-based sensor networks and propose a routing algorithm for real-time multimedia data transmission. In the previously proposed algorithm for multimedia data transmission occurs delay time of routing setup phase and has a low data transmission speed due to bandwidth limitations of Zigbee. In this paper, we propose the hybrid routing algorithm that consist of Zigbee and Bluetooth and solve the bandwidth problem of existing algorithm. We also propose the disjointed multipath setup algorithm based on competition that overcome delay time of routing setup phase in existing algorithm. To evaluate the superiority of the proposed algorithm, we compare it with the existing algorithm. Our experimental results show that the latency was reduced by approximately 78% and the communication speed is increased by approximately 6.9-fold.