• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.80-83
• /
• 2009

The most popular communication protocol is those defined by the IEEE 802.11 WLAN to support broadband internet connection. The demand for real-time multimedia service is increasing through WLAN on the road. The Hand-off function of mobile terminal is essential to support mobility. But, the hand-off function of IEEE 802.11 WLANs has the latency up to 300ms, and recent research has focusing on channel scanning and reconnection to AP and certification process of AP. It is also the lack of consideration in related works that hand-off happens frequently when the mobile node is moving. This paper proposed the hand-off algorithm that guarantees high throughput and estimates the point which may occur hand-off using GPS information and RSSI. We implement the proposed hand-off function that achieves the best performance.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.1-10
• /
• 2006

It is widely accepted that the coverage with high user densities can only be achieved with small cell such as micro- and pico-cell. The smaller cell size causes frequent handovers between cells and a decrease in the permissible handover Processing delay. This may result in the handover failure. in addition to the loss of some Packets during the handover. In these cases. re-transmission is needed in order to compensate errors, which triggers a rapid degradation of throughput. In this paper, we propose a new handover scheme in the next generation mobile communication systems, in which the handover setup process is done in advance before a handover request by predicting the handover cell based on mobile terminal's current position and moving direction. Simulation is focused on the handover failure rate and Packet loss rate. The simulation results show that our proposed method provides a better performance than the conventional method.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.15 no.6
• /
• pp.60-71
• /
• 2019

As IoT systems such as smart farms and smart cities become popular, a large amount of data collected from many sensor nodes is sent to a server in the Internet, which causes network traffic explosion, delay in delivery, and increase of server's workload. To solve these problems, the concept of fog computing has been proposed to store data between IoT systems and servers. In this study, we implemented a software platform of the fog node and applied it to the prototype smart farm system in order to check whether the problems listed above can be solved when using the fog node. When the fog node is used, the time taken to control an IoT device is lower than the response time of the existing IoT device-server case. We confirmed that it can also solve the problem of the Internet traffic explosion and the workload increase in the server. We also showed that the intelligent control of IoT system is feasible by having the data visualization in the server and real time remote control, emergency notification in the fog node as well as data storage which is the basic capability of the fog node.

• Journal of Korea Society of Industrial Information Systems
• /
• v.24 no.2
• /
• pp.41-46
• /
• 2019

The application of series compensator in a power system affects other devices such as circuit breakers transient recovery voltage (TRV) problem. In this paper, we analyze the TRV effect on a line circuit breaker in the cases with and without thyristor-controlled series capacitor (TCSC) via simulation, and suggest an effective method to overcome the increase of TRV due to the TCSC installation. It also discusses the impact of proposed protection on metal oxide varistor (MOV). A 345 kV transmission line in Korea was selected as a study case. Grid system was modelled using PSCAD (Power Systems Computer Aided Design) / EMTDC(Electro Magnetic Transient Direct Current). The TRV was analyzed by implementing a short circuit fault along the transmission line and at the breaker terminal. The proposed protection scheme, the TRV satisfies the standard. However, the MOV energy capacity increased as the delay time increased. This result can solve the TRV problem caused by the expected transmission line fault in a practical power system.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.4
• /
• pp.163-181
• /
• 2004

Group key agreement protocols are designed to solve the fundamental problem of securely establishing a session key among a group of parties communicating over a public channel. Although a number of protocols have been proposed to solve this problem over the years, they are not well suited for a high-delay wide area network; their communication overhead is significant in terms of the number of communication rounds or the number of exchanged messages, both of which are recognized as the dominant factors that slow down group key agreement over a networking environment with high communication latency. In this paper we present a communication-efficient group key agreement protocol and prove its security in the random oracle model under the factoring assumption. The proposed protocol provides perfect forward secrecy and requires only a constant number of communication rounds for my of group rekeying operations, while achieving optimal message complexity.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2023.05a
• /
• pp.315-315
• /
• 2023

급격한 기후변화에 기인하여 전 세계적으로 거듭되는 돌발홍수로 인한 피해가 급격히 증가하고 있는 실정이다. 우리나라에서도 최근 중소 규모의 하천 뿐 아니라 도시 생활하천, 도심지 저지대에서 갑작스런 홍수와 침수로 인해 많은 인명과 재산 피해를 경험하고 있다. 이런 문제를 인식하여 최근 정부차원에서 다양한 센서와 인공지능에 기반하는 많은 인프라 및 연구 투자가 이루어지고 있지만, 높은 설치 및 운영 비용과 우리나라의 복잡한 하천 환경 특성으로 인해 소하천이나 도심지 저지대에서는 그 효율성을 제대로 발휘하지 못하고 있다. 따라서 본 논문에서는 주변환경의 변화에 강인한 복합 센서단말을 통해, 하천 정보(유량, 유속, 수위 등)을 실시간 측정하고, 해당지역의 특성을 고려한 하천 또는 저지대의 위험도를 스스로 판단할 수 있는 기술을 제안한다. 또한, 본 논문에서는 제안한 저비용 초소형의 단말 장치로 지점의 하천 정보를 실시간 측정하여 IoT망을 통해 3차원 하천 디지털트윈 모델로 전달하여, 유속과 수위를 그대로 재연함으로써, 하천 침수 위험 감시의 효율성을 검증하였다. 3차원 DEM(Digital Elevation Models) 데이터와 실제 하천을 관측한 데이터를 이용한 디지털트윈 검증 결과, 데이터 전송 지연시간을 감안하여 3초 이내에 하천의 수위와 유속이 3차원 모델에 반영되는 것을 확인하였다. 이 결과로부터 열악한 환경에서도 실시간 하천 상황을 원거리에서 모니터링 할 수 있으며, 강우와 유출에 따른 하천 홍수 메카니즘을 새롭게 시뮬레이션할 수 있는 방법론을 제시할 수 있을 것으로 기대한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.306-309
• /
• 2022

Recently, the frequency of earthquakes is rapidly increasing in Korea. As a result, concerns about earthquakes are increasing. Response and recovery in the event of an earthquake are also important, but it is necessary to identify management vulnerabilities in advance and perform prevention and preparation activities. K-water collects real-time earthquake data by operating an earthquake accelerator to manage facilities safe from earthquakes. In addition, real-time data is transmitted to external organizations. Therefore, various efforts are being made to improve the quality of data. In order to reduce the management vulnerability of the earthquake monitoring system in advance, high-quality data can be produced by minimizing the delay time of data collection and establishing a real-time quality analysis system and base for earthquake data using big data. Accordingly, it is expected to protect the lives and property of the people from earthquake disasters by securing dam safety management and high-quality earthquake data and providing rapid data to external institutions.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.12
• /
• pp.109-117
• /
• 2009

In this paper, we propose an efficient service discovery scheme that combines peer-to-peer caching advertisement and node ID-based selective forwarding service requests. P2P caching advertisement quickly spreads available service information and reduces average response hop count since service information store in neighbor node cache. In addition, node ID-based service requests can minimize network transmission delay and can reduce network load since do not broadcast to all neighbor node. Proposed scheme does not require a central lookup server or registry and not rely on flooding that create a number of transmission messages. Simulation results show that proposed scheme improved network loads and response times since reduce a lot of messages and reduce average response hop counts using adaptive selective nodes among neighbor nodes compared to traditional flooding-based protocol.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.3
• /
• pp.75-88
• /
• 2009

This paper presents a video quality assessment method based on quality degradation factors of real-time multimedia streaming services. The video quality degradation is caused by video source compression and network states. In this paper, we propose a blocky metric on an image domain to measure quality degradation by video compression. In this paper, the proposed boundary strength index for the blocky metric is defined by ratio of the variation of two pixel values adjacent to $8{\times}8$ block boundary and the average variation at several pixels adjacent to the two boundary pixels. On the other hand, unnatural image movement caused by network performance deterioration such as jitter and delay factors can be observed. In this paper, a temporal-Jerkiness measurement method is proposed by computing statistics of luminance differences between consecutive frames and play-time intervals between frames. The proposed final Perceptual Video Quality Metric (PVQM) is proposed by consolidating both blocking strength and temporal-jerkiness. To evaluate performance of the proposed algorithm, the accuracy of the proposed algorithm is compared with Difference of Mean Opinion Score (DMOS) based on human visual system.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.251-267
• /
• 2008

In this paper, we present a distributed topology control algorithm for constructing an optimized topology having a minimal search-time in unstructured peer-to-peer network. According to the proposed algorithm, each node selects the best nodes having higher hit-ratio than other nodes as many as the number being exponentially proportional to the hit-ratio of the node itself, and then it connects to them. The ensemble behavior of the proposed algorithm is very similar to the recrystrallizing phenomenon that is observed in nature. There is a partial order relationship among the hit-ratios of most nodes of constructed topology. Therefore once query message visits a node, it has a higher hit-ratio than the node that was visited last by the message. The query message even sent from freeloader can escape to the node having high hit-ratio by one hop forwarding, and it never revisits any freeloader again. Thus the search can be completed within a limited search time. We also propose the Chain-reactive search scheme using the constructed topology. Such a controlled multicasting reduces the query messages by 43 percent compared to that of the naive Gnutella using broadcasting, while it saves the search time by 94 percent. The search success rate of the proposed scheme is 99 percent.