• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.68-73
• /
• 2006

센서 노드의 송수신 상태를 분석하여 노드의 생존성 향상과 효율적인 프로토콜 설계를 하려고 한다. 센서 노드의 분석을 위한 실험 환경은 다음과 같다. 센서 노드의 생존성-가용 배터리, 센서 노드의 출력-검색 가능 영역, 센서 노드의 통신 경로-라우팅 테이블 생성, 센서 노드의 대역폭-송신 데이터의 크기이다. RFID 태그와 리더를 통한 관리 시스템과 재해방지를 위한 다양한 센서를 통한 정보 수집 시스템과 의사결정 시스템에 적용 될 수 있다. 그리고 다양한 센서 데이터로부터 수신된 데이터의 자료수집, 센서분류, 수신율 조절 시스템을 위한 프로토콜 설계 자료로 활용 가능하다.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.43 no.6
• /
• pp.488-496
• /
• 2015

This paper proposes a framework to determine the routes of multiple unmanned aerial vehicles (UAVs) to conduct multiple tasks in different locations considering the survivability of the vehicles. The routing problem can be formulated as the vehicle routing problem (VRP) with different cost matrices representing the trade-off between the safety of the UAVs and the mission completion time. The threat level for a UAV at a certain location was modeled considering the detection probability and the shoot-down probability. The minimal-cost path connecting two locations considering the threat level and the flight distance was obtained using the Dijkstra algorithm in hexagonal cells. A case study for determining the optimal routes for a persistent multi-UAVs surveillance and reconnaissance missions given multiple enemy bases was conducted and its results were discussed.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.76-87
• /
• 2014

Today the energy consumption of ICT networks is about 10% of the worldwide power consumption and is predicted to increase remarkably in the near future. For this reason, this paper studies energy saving strategies assuring the network-level QoS. In the strategies, the energy consumption of NIC(network interface card) on both endpoint of links decreases by selecting links and making them sleep when the total traffic volume of the IP network is lower than a threshold. In this paper, we propose a heuristic routing algorithm based on so-called delegating/delegated routers, and evaluate its characteristics using computer simulation considering network-level QoS. The selection of sleep links is determined in terms of the number of traffic paths (called min_used path) or the amount of traffics(called min_used traffic) through those kinks. To our experiment, the min_used traffic method shows a little better energy saving but the increased path length compared to the min_used path method. Those two methods have better energy saving characteristics than the random method. This paper confirms that the delegating/delegated router-based routing algorithm results in energy saving effects and sustains network-level QoS in IP networks.

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

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.5
• /
• pp.21-26
• /
• 2012

Intra-session network coding has been proposed to improve throughput by simplifying scheduling of multi-hop wireless network and efficiency of packet transmission. Multi-rate transmission has been used in multihop wireless networks. An opportunistic routing with multirate shows throughput improvement compared with single rate. In this paper, we propose a method of throughput improvement in multi-hop wireless network by using multi-rate and intra-session network coding. We suggest a method to select an local optimal transmission rate at each node. The maximum throughput is evaluated by using linear programming (LP). To solve the LP, we use MATLAB and lp_solve IDE program. The performance evaluation results show that end-to-end throughput is improved by using multirate and intra-session network coding can achieve better throughput than opportunistic routing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.158-166
• /
• 2004

Address lookup is one of the most essential functions of the Internet routers and a very important feature in evaluating router performance. Due to the facts that the Internet traffic keeps growing and the number of routing table entries is continuously growing, efficient address-lookup mechanism is indispensable. In recent years, various fast address-lookup schemes have been proposed, but most of those schemes are not practical in terms of the memory size required for routing table and the complexity required in table update In this paper, we have proposed a parallel IP address lookup architecture based on multiple hashing. The proposed scheme has advantages in required memory size, the number of memory accesses, and table update. We have evaluated the performance of the proposed scheme through simulation using data from MAE-WEST router. The simulation result shows that the proposed scheme requires a single memory access for the address lookup of each route when 203kbytes of memory and a few-hundred-entry TCAM are used.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.620-623
• /
• 2014

Network topology for communication between vehicles are quickly changing because vehicles have a special movement pattern, especially character which is quickly changed by velocity and situation of road. Because of these feature, it is not easy to apply reliable routing on VANET(Vehicular Ad-hoc Network). Clustering method is one of the alternatives which are suggested for overcoming weakness of routing algorithm. Clustering is the way to communicate and manage vehicles by binding them around cluster head. Therefore choosing certain cluster head among vehicles has a decisive effect on decreasing overhead in relevant clustering and determining stability and efficiency of the network. This paper introduces new cluster head selection algorithm using RSU(Road Side Unit) different from existing algorithms. We suggest a more stable and efficient algorithm which decides a priority of cluster head by calculating vehicles' velocity and distance through RSU than existing algorithms.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.606-608
• /
• 2011

무선 센서 네트워크는 특정지역에 센서 노드를 설치하여 주변 정보 또는 특정 목적의 데이터를 수집하고, 그 정보를 수집하는 싱크(Sink)로 구성되어 있다. 무선 센서 네트워크의 수명은 망을 구성하는 센서 노드의 베터리 소비에 따라 수명이 결정 되고 하나의 노드가 죽기 시작하면서부터 급격하게 센서 노드의 베터리 소비가 커져 빠르게 죽는다. 무선 센서 네트워크를 구성하는 센서노드는 라우팅, 센싱을 수행하기 때문에 베터리 소비에 많은 부담을 가지고 있다. 본 논문은 무선 센서 네트워크의 대표적 클러스터링 기반 라우팅 기법인 LEACH(Low - Energy Adaptive Clustering Hierarchy)프로토콜에 SVM(Support Vector Machine)을 적용하여 센서노드의 균형적인 베터리 소비로 망을 효율적으로 관리하고 망의 수명을 개선 할 수 있는 방법을 제안 한다. 이러한 센서 노드의 균형적인 베터리 소비로 무선센서 네트워크의 수명을 개선 한다. 실험결과 기존의 LEACH 프로토콜보다 우수한 성능을 보인다.

• Journal of KIISE:Information Networking
• /
• v.28 no.2
• /
• pp.251-261
• /
• 2001

The traffic on the Internet has been growing exponentially for some time. This growth is beginning to stress the current-day routers. However, switching technology offers much higher performance. So the label switching network which combines IP routing with switching technology, is emerged. EspeciaJJy in the data driven label switching, flow classification and cache table management are needed. Flow classification is to classify packets into switching and non-switching packets, and cache table management is to maintain the cache table which contains information for flow classification and label switching. However, the cache table management affects the performance of label switching network considerably as well as flowclassification because the bigger cache table makes more packet switched and maintains setup cost lower, but cache is restricted by local router resources. For that reason, there is need to study the cache replacement scheme for the efficient cache table management with the Internet traffic characterized by user. So in this paper, we propose several cache replacement schemes for label switching network. First, without the limitation at switching capacity in the router. we introduce FIFO(First In First Out). LFC(Least Flow Count), LRU(Least Recently Used! scheme and propose priority LRU, weighted priority LRU scheme. Second, with the limitation at switching capacity in the router, we introduce LFC-LFC, LFC-LRU, LRU-LFC, LRU-LRU scheme and propose LRU-weighted LRU scheme. Without limitation, weighted priority LRU scheme and with limitation, LRU-weighted LRU scheme showed best performance in this paper.

• Journal of the Korea Society for Simulation
• /
• v.22 no.4
• /
• pp.149-156
• /
• 2013

In this research, we dealt with an optimization problem which aims to minimize total cost of resources usage and network routing in a smart node environment. Toward this, we briefly introduced technology trends in smart nodes, methods in resource optimization fields, economic effects of smart network and content delivery (or distribution) network (CDN). Moreover, based on CDN we proposed and implemented a mathematical (mixed integer) programming model to combine replica placement and requests distribution problem (RPRDP) and routing problem. Computational result of an example on RPRDP+Routing problem is also provided.