• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6A
• /
• pp.437-444
• /
• 2009

Underwater sensor networks (USN) for ocean development and disaster prevention have been emerged as one of interesting research topics recently. Since a high-speed and inexpensive communication modem is a prerequisite for deployment of USN, we design and implement an underwater modem by utilizing general-purpose waterproof ultrasonic sensors in this paper. We also make experiments in indoor and outdoor environment with two modems facing each other to conduct a point-to-point communication. According to the experiments, we can achieve the data rates of 1.5 kbps in a water tank and 2 kbps in a pond. Also, the maximum communication distance between two modems is about 30 meters. Besides, we conduct a point-to-multipoint experiment imitating USN by deploying a gateway, a sink node and three sensor nodes in a water tank.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.383-386
• /
• 2007

허프 변환(Hough transform)은 영상에서 몇 개의 파라미터로 표현되는 기하학적 요소 추출을 위해 널리 사용되고 있는 방법 중 하나이다. 하지만 허프 변환은 영상의 한 픽셀이 허프 공간(Hough space)의 한 방정식에 대응되는 일대다 특성으로 인해 잡음에 민감한 특성을 갖는다. 이러한 잡음 민감성은 검출되는 직선의 개수뿐만이 아니라 검출된 직선의 품질에도 영향을 미칠 수 있다. 즉, 실제 직선에서 벗어난 직선이 검출되거나 하나의 실제 직선에 대해 여러 개의 직선이 검출되는 등의 직선 왜곡이 발생할 수 있다. 이러한 직선 왜곡은 잡음 이외에도 허프 공간의 설정, 특히 각 해상도의 설정에 영향을 받는다. 이 논문에서는 기존의 허프 변환에서 발생하는 이러한 직선 왜곡을 분석하고, 잡음 민감성을 줄이기 위해 제안된 경계선 강도 허프 변환(Edge Strength Hough Transform, ESHT)에서 이러한 왜곡이 적게 발생함을 보인다. 또한 ESHT에서만 발생할 수 있는 왜곡을 분석하고 해결방안을 제시한다. 제시한 방법에 의해 직선의 왜곡이 감소하는 것은 실험 결과를 통해 확인할 수 있다.

• Journal of the Korean association of regional geographers
• /
• v.10 no.4
• /
• pp.689-697
• /
• 2004

The Main results of this paper about the river channel of Shincheon(river) are as follows: First, the argument that Shincheon had a different river channel from existing one before 1778 would be wrong. Second, the origin of the place name, Shincheon has been traced up to the year of 1778 also would be wrong. Third, Daegucheon(river) regarded as a distributary of Shincheon would be the different stream originated from Samjeong valley and near by hills. Forth, Daegucheon had mostly dried up and disappeared during the Japanese colonial times while part of Daegucheon had changed its channel into Icheoncheon(river). Fifth, the river channel of Shincheon since the historic age has been unchanged.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.4
• /
• pp.500-509
• /
• 1999

In this paper, we consider an optimal routing problem when point-to-point and point-to-multipoint connection traffics are offered in an ATM network. We propose a mathematical model for cost-minimizing configuration of a logical network for a given ATM-based BISDN. Our model is essentially identical to the previous one proposed by Kim(Kim, 1996) which finds a virtual-path configuration where the relevant gains obtainable from the ATM technology such as the statistical multiplexing gain and the switching/control cost-saving gain are optimally traded-off. Unlike the Kim's model, however, ours explicitly considers the VP's QoS(Quality of Service) for more efficient utilization of bandwidth. The problem is a large-scale, nonlinear, and mixed-integer problem. The proposed algorithm is based on the local linearization of equivalent-capacity functions and the relaxation of link capacity constraints. As a result, the problem can be decomposed into moderate-sized shortest path problems, Steiner arborescence problems, and LPs. This fact renders our algorithm a lot faster than the previous nonlinear programming algorithm while the solution quality is maintained, hence application to large-scale network problems.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.6
• /
• pp.1169-1176
• /
• 2018

The C-band omni-directional antenna for drone control is mounted on the top or bottom and used to configure the communication link. The communication link is affected by the LOS depending on the mounting position of the omni-directional antenna. In this paper, two kinds of embedded antennas were designed with a commercial simulation tool CST MWS, and EM analysis was performed to consider the mounting environment. Also, we propose the PTMP ground antenna to control a large number of drones. The ground antenna has a communication link of 30km, and it consists of four sector antennas in the horizontal direction and one directional antenna at the top.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2020.11a
• /
• pp.5-7
• /
• 2020

재난문자 전송은 기지국에서 다수의 단말기로 재난문자를 전달하는 단방향 프로토콜인 CBS 긴급 재난문자 서비스를 이용한다. 이 CBS 전송 기법은 일대다(One-to-Many) 방식을 이용한다. 현 CBS 프로토콜은 일종의 방송 방식으로 기지국은 긴급재난문자를 수신한 단말기로부터 어떠한 확인 메시지도 전달받지 못한다. 그러나 재난관리기관은 효율적인 재난 대응을 위하여 재난지역의 재난문자 수신자로부터 유용한 정보를 전달받을 필요가 있다. 즉 CBS 재난문자를 수신한 단말기들로부터 재난관리기관 서버로 CBS 메시지에 대한 응답 메시지를 전달받는 방식으로 유용한 정보를 취합할 수 있다. 이러한 전달방식을 위해 다대일(many-to-one) 통신 기법이 고려된다.

• The KIPS Transactions:PartC
• /
• v.14C no.3 s.113
• /
• pp.255-266
• /
• 2007

RSVP (Resource reSerVation Protocol) is the Internet standard protocol for supporting QoS (Quality of Service) requirements by reserving network resources between the sender and the receiver. Several problems, such as common path identification and resource pre-reservation, should be solved to apply RSVP in wireless mobile environments. To resolve these problems, this paper proposes DBRA (Dynamic Branch Router Approach) based on two designated entities, candidate access routers and a branch router. While several RSVP sessions between a branch router and candidate routers are managed, DBRA makes use of only one RSVP session between the sender and a branch router. Based on a network simulation, the proposed scheme has been compared with MRSVP (Mobile RSVP) and HMRSVP (Hierarchical MRSVP) in terms of the average packet transmission rate, bandwidth utilization and RSVP session failure rate.

• Journal of Korea Multimedia Society
• /
• v.7 no.9
• /
• pp.1195-1207
• /
• 2004

Schema matching is prerequisite to an automated transformation of XML documents. Because previous works about schema matching compute all semantically-possible matchings, they produce many-to-many matching relationships. Such imprecise matchings are inappropriate for an automated transformation of XML documents. This paper presents an efficient schema matching algorithm that computes precise one-to-one matchings between two schemas. The proposed algorithm consists of two steps: preliminary matching relationships between leaf nodes in the two schemas are computed and one-to-one matchings are finally extracted based on a proposed path similarity. Specifically, for a sophisticated schema matching, the proposed algorithm is based on a domain ontology as well as a lexical database that includes abbreviations and synonyms. Experimental results with real schemas from an e-commerce field show that the proposed method is superior to previous works, resulting in an accuracy of 97% in average.

• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.439-448
• /
• 2009

The development of wireless communications provides mobility and accessibility to the wire communication users. Wireless sensor network is one of the leading wireless communication techniques. The security mechanism for wired network communication cannot be applied to wireless sensor network because of the limited resource and computing capability of nodes. Furthermore, communication errors frequently occur and the speed is low. Thus, efficient key management scheme is required in low-speed environment. In this paper, we proposed an efficient and secured master key-based scheme compared to the existing scheme. The advantage of our scheme is that establishing and renewing the pair-wise key is possible. In addition, it provides functions such as establishing group keys and renewing it. Furthermore, adding nodes is enabled through our scheme. The master key-based scheme can be applied to military operations and to radio communications for confidential communications.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.727-740
• /
• 2006

Schema matching is important as a prerequisite to the transformation of XML documents. This paper presents a schema matching method for the transformation of XML documents. The proposed method consists of two steps: preliminary matching relationships between leaf nodes in the two XML schemas are computed based on proposed ontology and leaf node similarity, and final matchings are extracted based on a proposed path similarity. Particularly, for a sophisticated schema matching, the proposed ontology is incrementally updated by users' feedback. furthermore, since the ontology can describe various relationships between concepts, the proposed method can compute complex matchings as well as simple matchings. Experimental results with schemas used in various domains show that the proposed method is superior to previous works, resulting in a precision of 97% and a recall of 83 % on the average. Furthermore, the dynamic ontology increased by 9 percent overall.