• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.10
• /
• pp.357-364
• /
• 2014

The first mission for the IoT based hyper-connectivity communication is developing a device-to-device communication technique in infra-less low-power and lossy networks. In a low-power and lossy wireless network, IoT devices and routers cannot keep the original path toward the destination since they have the limited memory. Different from the previous light-weight routing protocols focusing on the reduction of the control messages, the proposed scheme provides the light-weight IPv6 address auto-configuration, IPv6 neighbor discovery and routing protocol in a IoT capable infra-less wireless networks with the bloom filer and enhanced rank concepts. And for the first time we evaluate our proposed scheme based on the modeling of various probability distributions in the IoT environments with the lossy wireless link. Specifically, the proposed enhanced RPL based light-weight routing protocol improves the robustness with the multi-paths locally established based on the enhanced rank concepts even though lossy wireless links are existed. We showed the improvements of the proposed scheme up to 40% than the RPL based protocol.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.52-54
• /
• 2006

최근 데이타 중심 저장 방식의 센서 네트워크에서 다차원 범위 질의를 위한 인덱스들이 제시되고 있다. 기존에 제시된 다차원 범위 질의 인덱스는 일반적으로 다차원 속성 도메인과 센서 노드의 공간 도메인을 직접 매핑하여 데이타를 관리하는 구조로 되어있다. 그러나, 이러한 구조는 센서 노드의 공간 도메인을 정적으로 분할하기 때문에 센서 노드를 포함하지 않는 영역이 생성되어 데이타 저장 및 질의 처리에서 불필요한 통신이 발생하는 문제가 있다. 본 논문은 이러한 문제를 해결하기 위해 센서 노드의 공간 도메인이 센서 노드를 포함하도록 센서 네트워크 영역을 동적으로 분할하는 다차원 범위 질의 인덱스를 제안한다. 제안하는 인덱스는 센서 노드의 위치에 따라 센서 네트워크 영역을 동적으로 분할하여 데이타 저장 및 질의 처리시 목적 영역으로의 라우팅 경로를 최적화한다. 그리고, 분할된 영역은 모두 센서 노드를 포함함으로 센서 노드에서 발행하는 저장 부하를 분산시켜 전체 네트워크에서 발생하는 전체 통신비용을 줄인다. 실험 결과 제안한 인덱스는 DIM보다 전체 센서 네트워크와 hotspot의 통신비용에서 각각 최대 35%, 60%의 성능 향상을 보였다.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.6
• /
• pp.823-830
• /
• 1995

A reactive piloting policy for Flexible Assembly Lines (FAL) is proposed, where the sequencing of the operations as well as the assignment of tasks to manipulators are not predetermined but driven by the actual state of the FAL For all work-in-process coming from a manipulator, the next destination is determined by minimizing a temporal criterion taking into account the time needed to reach the destination, the load of the manipulator to reach, the durati on of the operation to be completed in the destination manipulator, and the availability of product components in this manipulator. The purpose of proposed piloting policy is to manufacture a given quantity of products as rapidly as possible by balancing the amount of work allocated to manipulators and to reduce the efforts required for scheduling the production of short series of diversified products. After introducing the characteristics of assembly processes and FAL modelization, the proposed algorithm is evaluated by simulations. The simulations of the proposed algorithm showed satisfactory results.

• 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.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.19 no.5
• /
• pp.645-653
• /
• 2016

The terrestrial wireless backbone network and satellite communications system have been independently developed depending on their own purposes and operational concepts, which results in different characteristics in terms of network architecture and routing protocol operation. In this paper, we propose a method for structurally integrating them in consideration of routing mechanism in an autonomous system. Our approach is that the routers of satellite network operate the OSPF in PTP mode on their interfaces connected to the routers of terrestrial wireless backbone network with grid connectivity, whereas the OSPF in satellite network whose topology is of hub-spoke type runs in NBMA mode. We perform some simulations to verify that the satellite communications system can be integrated and interwork with the terrestrial wireless backbone network by our proposed approach. From simulation results, it is also found that the increases of network convergence time and routing overhead are acceptable.

• Journal of Korea Multimedia Society
• /
• v.11 no.4
• /
• pp.544-553
• /
• 2008

The general sensor network uses bundle method to collect fixed information from sensor node. However, this method is difficult to actively cope with major sensing objects in healthcare environment including status and position change of person and change of surrounding environment. In order to support the healthcare environment, certain information should be provided in accordance with the change of status of person and surrounding circumstance and also must cope with the change of network type by movement of person. This paper analyzes LEACH protocol which guarantees effectiveness of network as it constitutes clusters between Agilla model that is a representative multi agent middle ware and surrounding nodes. Based on the result of this analysis, it suggests LEACH_Mobile protocol which guarantees node mobility that is the weakest point of LEACH protocol. Moreover, it designs mobility agent middleware which supports dynamic function change of node and mobility agent module which supports dynamic function change of mobile node as components of LEACH_Mobile routing module. In addition, it is definitely increase performance which in mobile node of transfer data rate through LEACH_Mobile protocol of simulation result.

• Journal of Advanced Navigation Technology
• /
• v.23 no.4
• /
• pp.302-308
• /
• 2019

Aircraft data network (ADN) is a data networking for signal transmission among avionic systems in aircraft, and it mostly has been applied MIL-STD-1553B that guarantees high reliability considering its application environments. However, commercial Ethernet has been widely applied for ADN recently, and its range of applications have increased. Ethernet provides high speed of data transmission, however, it could not guarantee quality of service (QoS) so high as MIL-STD-1553B. In this paper, we propose dynamic routing and priority based data transmission schemes in order to improve the QoS of legacy Ethernet. Our propose schemes can be applied to Ethernet switch, and it is able to manage network traffic efficiently, and reduce the time for data transmission. We analyze the packet transmission time for both legacy and proposed schemes in Ethernet environments using simulation, and we show that our proposed scheme can reduce the time for data transmission compare to legacy spanning tree protocol.

• Journal of Internet Computing and Services
• /
• v.14 no.5
• /
• pp.11-26
• /
• 2013

In the wireless Internet, it is so restrictive to use the IPSec. The MIPv4 IPSec's path cannot include wireless links. That is, the IPSec of the wireless Internet cannot protect an entire path of Host-to-Host connection. Also wireless circumstance keeps a path static during the shorter time, nevertheless, the IKE for IPSec SA agreement requires relatively long delay. The certificate management of IPSec PKI security needs too much burden. This means that IPSec of the wireless Internet is so disadvantageous. Our paper is to construct the Mobile IPSec proper to the wireless Internet which provides the host-to-host transport mode service to protect even wireless links as applying excellent WP-IBE scheme. For this, Mobile IPSec requires a dynamic routing over a path with wireless links. FA Forwarding is a routing method for FA to extend the path to a newly formed wireless link. The FA IPSec SA for FA Forwarding is updated to comply the dynamically extended path using Source Routing based Bind Update. To improve the performance of IPSec, we apply efficient and strong future Identity based Weil Pairing Bilinear Elliptic Curve Cryptography called as WP-IBE scheme. Our paper proposes the modified protocols to apply 6 security-related algorithms of WP-IBE into the Mobile IPSec. Particularly we focus on the protocols to be applied to construct ESP Datagram.

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

무선 ad-hoc 네트워크는 중앙 집중화된 관리 시스템이나 지원 서비스 없이 동적으로 임시 네트워크를 구성하는 이동 호스트(MH)들의 집합이다. 이러한 네트워크는 백본 호스트나 다른 MH로의 연결을 제공하기 위한 고정된 제어장치를 갖지 않으며, 각 MH가 라우터로 동작하며 전달받은 패킷을 다른 MH로 전달한다. 이러한 무선 ad-hoc 네트워크에서 단순히 최선의 서비스만을 제공하던 기존의 방법과 달리, 많은 사용자가 요구하는 QoS 서비스를 지원하기 위하여 기존 네트워크를 효율적으로 최대 활용하는 방안에 대한 연구가 활발히 진행되고 있다. 본 논문에서는 무선 ad-hoc 네트워크 내에서 QoS 서비스를 제공하기 위한 기법으로 각각의 이동 호스트들은 QoS DAG 그래프를 유지하며 이러한 그래프를 바탕으로 만들어진 QoS 정보 패킷을 이웃 이동 호스트들에게 지역 브로드캐스트 함으로써 전역적인 QoS 정보의 검색과 운용없이, 유용한 QoS 정보를 전역적으로 각 이동 호스트가 유지할 수 있고 이를 바탕으로 효율적인 QoS 라우팅이 수행되어지는 기법이다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.11
• /
• pp.1-6
• /
• 2010

In Sensor Networks, the problem of finding the optimal routing path dynamically, which passes through all terminals or nodes once per each, may come up. Providing a generalized scheme of approximations that can be applied to the kind of problems, and formulating the bounds of the run time and the results of the algorithm made from the scheme, one may evaluate mathematically the routing path formed in a given network. This paper, dealing with Euclidean TSP(Euclidean Travelling Sales Person) that represents such problems, provides the scheme for constructing the approximated Euclidean TSP by parallel computing, and the ground for determining the difference between the approximated Euclidean TSP produced from the scheme and the optimal Euclidean TSP.