• Journal of information and communication convergence engineering
• /
• v.6 no.3
• /
• pp.255-260
• /
• 2008

In the recently years, there has been a big interest in ad hoc wireless network as they have tremendous military and commercial potential. An Ad hoc wireless network is composed of mobile computing devices that use having no fixed infrastructure of a multi-hop wireless network formed. So, the fact that limited resource could support the network of robust, simple framework and energy conserving etc. In this paper, we propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. And the ontology clustering adopts a tree structure to enhance resilient against mobility and routing complexity. This proposed multicast routing protocol utilizes node locality to be improve the flexible connectivity and stable mobility on local discovery routing and flooding discovery routing. Also attempts to improve route recovery efficiency and reduce data transmissions of context-awareness. We also provide simulation results to validate the model complexity. We have developed that proposed an algorithm have design multi-hierarchy layered networks to simulate a desired system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.1911-1930
• /
• 2017

Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. The key to overlay routing is the placement and maintenance of the overlay infrastructure, especially, the selection and placement of key relay nodes. Spurred by the observation that a few relay nodes with high betweenness centrality can provide more optimal routes for a large number of node pairs, we propose a resilient routing overlay network construction method by introducing Super-Relay nodes. In detail, we present the K-Minimum Spanning Tree with Super-Relay nodes algorithm (SR-KMST), in which we focus on the selection and connection of Super-Relay nodes to optimize the routing quality in a resilient and scalable manner. For the simultaneous path failures between the default physical path and the overlay backup path, we also address the selection of recovery path. The objective is to select a proper one-hop recovery path with minimum cost in path probing and measurement. Simulations based on a real ISP network and a synthetic Internet topology show that our approach can provide high-quality overlay routing service, while achieving good robustness.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.461-465
• /
• 2007

MANET(Mobile Ad hoc Networks) is free-mobility formation of mobile nodes in the wireless networks. Generally, wireless networks has two main type of structures which Tree and Mesh. These general structure is difficult to do which connectivity, redundancy transmit and network continuant. In this paper, we would suggest a new ODDMRP(Ontology Doppler effect-based Dynamic Multicast Routing Protocol) technology for effective MANET which Ontology Doppler effect-based. ODDMRP consist of the parameters for node entropy when using Doppler effect which moving position of round node, moving time, and distribution chart in velocity also it express distance of destination node and property structure organization. It would be used to provide improvement to keep the optimal communication routing and also could be improve network stabilization, and continuation durability of connectivity.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.5
• /
• pp.525-532
• /
• 2004

In this paper, we proposed a multicast routing algorithm for QoS improvement in the wire/wireless integrated environment. We analyzed requests and characteristics of QoS, and then proposed a new algorithm that can improve QoS by adding node mobility to wire environment. This new algorithm constructs a dynamic multicast tree that can prevent a loss of packet and save the bandwidth. As a result of simulations comparing to another multicast algorithms, we showed that this new algorithm can simply and dynamically adjusts the construction of multicast tree with little delay and the most reducible bandwidth resources.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.11
• /
• pp.73-82
• /
• 2003

In this paper, a simultaneous buffer insertion and routing method is proposed under the constraints of wire and buffer locations by macro or IP blocks. A new grid graph is proposed to describe the regions in which buffers(or both wires and buffers) are not available. Under this grid we describe a method of constructing a buffeted tree that minimize the maximum source to sink delay. The method is based on the dynamic programming with pruning unnecessary partial solutions. The proposed method improved the slack time of the delay by 19% on the average while using less buffers and similar wire length.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.8
• /
• pp.11-18
• /
• 2001

In this paper, we propose a multicast routing scheme for an efficient and reliable support of multicast service to mobile hosts in IPv6 based networks. The purpose of this paper is to develop an algorithm to reduce both the number or multicast tree reconstruction and the multicast service disrupt time. The proposed multicast routing scheme is a hybrid method using the advantages of the bi-directional tunneling and the remote subscription proposed by the IETF Mobile IP working group. The proposed scheme satisfies the maximum tolerable transfer delay time and supports the maximum tunneling service. The simulation results show that the proposed scheme has better performance in the number of multicast tree reconstruction and the time of multicast service disrupt than the previous schemes does.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8A
• /
• pp.937-941
• /
• 2004

In this paper, we propose a efficient multicast routing algorithm in the wire/wireless integrated environment. Through simulations and comparing to another multicast algorithm, we reach a conclusion is that the routing algorithm can simply and dynamically adjusts the construction of multicast tree with little delay and the most reducible bandwidth resources.

• International journal of advanced smart convergence
• /
• v.5 no.3
• /
• pp.47-55
• /
• 2016

Router main task is to provide routing of Internet Protocol (IP) packets. Routing is achieved with help of the IP lookup. Router stores information about the networks and interfaces in data structures commonly called as routing tables. Comparison of IP from incoming packet with the IPs stored in routing table for the information about route is IP Lookup. IP lookup performs by longest IP prefix matching. The performance of the IP router is based on the speed of prefix matching. IP lookup is a major bottle neck in the performance of Router. Various algorithms and data structures are available for IP lookup. This paper is about reviewing various tree based structure and its performance evaluation.

• ETRI Journal
• /
• v.33 no.5
• /
• pp.704-711
• /
• 2011

This paper proposes hybrid distributed stochastic addressing (HDSA), which combines the advantages of distributed addressing and stochastic addressing, to solve the problems encountered when constructing a network in a ZigBee-based wireless sensor network. HDSA can assign all the addresses for ZigBee beyond the limit of addresses assigned by the existing distributed address assignment mechanism. Thus, it can make the network scalable and can also utilize the advantages of tree routing. The simulation results reveal that HDSA has better addressing performance than distributed addressing and better routing performance than other on-demand routing methods.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.249-252
• /
• 2007

센서 네트워크에서의 에너지 효율적인 통신을 위한 infrastructure를 제공하고자 가상 백본(Virtu Backbone) 개념이 등장했다. 최근에는 트리 구조를 이용하여 가장 백본을 구성한 EVBT (Energy-aware Virtual Backbone Tree)가 제안되었다. 본 논문에서는 EVBT의 문제점을 개선한 m-EVBT(modified-EVBT) 생성 알고리즘에 대해 다룬다. EVBT와 달리 m-EVBT 생성 알고리즘은 백본 트리에 속하지 않은 센서 노드들의 업스트림 링크의 선정에 물리적 거리가 아닌 에너지 소모량 청보를 이용한다. 이 정보는 백본 트리를 만들 때 이용되는 ECR(EVBT Construction Request) 패킷에 포함되어 전송된다. 시뮬레이션을 통해 m-EVBT는 EVBT에 비해 데이터 전송시 에너지를 절약하고, 백본 트리 구축에 드는 추가적인 비용도 작다는 것을 확인할 수 있었다.