• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.5
• /
• pp.113-118
• /
• 2015

Mobile wireless networks have received a lot of attention as a future wireless network due to its rapid deployment without communication infrastructure. In these networks communication path between two arbitrary nodes break down because some links in the path are beyond transmission range($r_0$) due to the mobility of the nodes. The set of total path break down time(${\bigcup}T_i$), which is the union of path break down time of every node pair, can be a good measure of the connectivity of the dynamic mobile wireless network. In this paper we show that the distribution of the total path break down time can be approximated as a exponential probability density function and confirms it through experimental data. Statistical knowledge of break down time enables quantitative prediction of delay, packet loss between two nodes, thus provides confidence in the simulation results of mobile wireless networks.

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

Single shortest path routing is known to perform poorly for Internet traffic engineering (TE) where the typical optimization objective is to minimize the maximum link load. Splitting traffic uniformly over equal cost multiple shortest paths in OSPF and IS-IS does not always minimize the maximum link load when multiple paths are not carefully selected for the global traffic demand matrix. However, among all the equal cost multiple shortest paths in the network, a set of TE-aware shortest paths, which reduces the maximum link load significantly, can be found and used by IP routers without any change of existing routing protocols and serious configuration overhead. While calculating TE-aware shortest paths. the destination-based forwarding constraint at a node should be satisfied, because an IP router will forward a packet to the next-hop toward the destination by looking up the destination prefix. In this paper, we present a problem formulation of finding a set of TE-aware shortest paths in ILP, and propose a simple heuristic for the problem. From the simulation results, it is shown that TE-aware shortest path routing performs better than default shortest path routing and ECMP in terms of the maximum link load with the marginal configuration overhead of changing the next-hops.

• Korean Journal of Construction Engineering and Management
• /
• v.11 no.4
• /
• pp.68-79
• /
• 2010

During the last two decades, several tele-operated and machine-vision-assisted systems have been developed in construction and maintenance area such as pavement crack sealing, sewer pipe rehabilitation, and excavation. In developing such tele-operated and machine-vision-assisted systems, trajectory plans are very important tasks for optimal motions of robots whether their environments are structured or unstructured. This paper presents an optimal trajectory planning algorithm used for a machine-vision-assisted automatic pavement crack sealing system. In this paper, the performance of the proposed optimal trajectory planning algorithm is compared with the greedy trajectory plans which are used in previously developed pavement crack sealing systems. The comparison is based on computational cost versus overall gains in crack sealing efficiency. Finally, it is concluded that the proposed algorithm plays an important role in productivity improvement of the automatic pavement crack sealing system developed.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.38 no.7
• /
• pp.743-749
• /
• 2014

In this study, a noncircular drawing (NCD) sequence for manufacturing high-strength and high-ductility pearlitic steel wires was investigated. Multipass NCD was conducted up to the 12th pass at room temperature with two processing routes (defined as the NCDA and NCDB), and compared with the wire drawing (WD). During the torsion test, delamination fracture in the drawn wire was observed in the 10th pass of the WD whereas it was not observed until the 12th pass of the NCDB. From X-ray diffraction, the circular texture component that increases the likelihood of delamination fracture of the drawn wire was rarely observed in the NCDB. Thus, the improved ability of the multipass NCDB to manufacture high-strength pearlitic steel wires with high torsional ductility compared to the WD (by reducing the likelihood of delamination fracture) was demonstrated.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.11-20
• /
• 1995

A new graph problem is formulated to limit the maximum path length of a general directed graph when a minimal set of vertices together with their incident edges are removed from the graph. An optimal algorithm and a heuristic algorithm are proposed and the proposed heuristic algorithm is shown to be effective through experiments using a collection of graphs obtained from large sequential circuits. The heuristic algorithm is based on a feedback vertex set algorithm based on graph reduction.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2015.01a
• /
• pp.167-168
• /
• 2015

유전자 알고리즘은 문제 크기가 커짐에 따라 해집합이 폭발적으로 늘어나 최적해를 찾기 힘든 최적화 문제에 주로 적용되는 알고리즘으로, 최근에는 지리정보시스템(GIS)의 경로 최적화 문제, 게임에서의 길찾기, 인공지능에 많이 적용되고 있다. 마이크로 유전자 알고리즘은 일반 유전자 알고리즘에 비해 작은 크기의 모집단을 사용함으로써 알고리즘의 효율을 높일 수 있는 장점이 있다. 따라서, 본 논문에서는 무향 Rural Postman Problem 해법으로 마이크로 유전자 알고리즘의 적용 방법을 제안한다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.04a
• /
• pp.381-383
• /
• 1999

WDM(Wavelength Division Multiplexing) Ring에서 경로과 고정된 파장할당문제는 Circular Arc Graph(CAG)에서의 vertex coloring문제와 동일하다. 본 연구에서는 극대독립집합(Maximal Independent Set)으로 vertex를 cover하는 정수계획법 모형을 제시하고 이를 효율적으로 풀 수 있는 column generation approach와 실험결과를 제시하겠다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.13-15
• /
• 2003

본 논문에서는 XML 문서의 자동변환을 위해 2단계의 상향식 매칭 방법을 제안한다. 제안된 방법은 단말 노드 사이의 유사도 비교를 통해 임계값을 넘는 후보 매칭집합을 결정하고, 단말노드가 포함되어 있는 경로의 유사도 비교를 통해 적절한 일대일 매칭을 추출한다. 특히, 노드 사이의 유사도 비교를 위해 축약어 사전, 일반 동의어 사전, 도메인 온톨로지를 적용한다. 실제 전자상거래용 XML 스키마를 대상으로 실험한 결과 제안된 방법은 평균적으로 97%의 정확률을 보였다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.45-48
• /
• 2003

Ad hoc network는 무선 노드들의 집합으로서 어떤 인프라스트럭처 도움 없이 그들 서로가 multi-hop 경로를 통해 통신한다. 네트워크를 구성하는 노드들의 움직임이 빈번히 발생하기 때문에 클러스터간 노드들의 재 가입이 계속되므로 네트워크의 안정성을 유지하기 어렵다. 그러므로 최대한 네트워크 토폴로지의 안정성을 유지하는 것이 필요하다. 본 논문에서는 ad hoc network를 구성하는 노드들을 클러스터로 형성한 후 제한된 broadcast 메커니즘을 이용하여 네트워크의 제어 메시지 flooding 수를 줄이는 효율적인 라우팅 방법을 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11A
• /
• pp.876-882
• /
• 2003

The future wireless communication systems will use spatial multiplexing with Multiple Input Multiple Output(MIMO) system to take advantage of large channel capacity gains. In such systems it will be desirable to select a sub-set of available transmit or receive antennas to reduce cost and complexity. In this paper we propose a novel antenna selection schemes for MIMO systems be suitable for multipath environment. Also, we analyze the capacity and define the outage probability for a novel antenna selection schemes for MIMO systems in multipath environment.