• Journal of Satellite, Information and Communications
• /
• v.9 no.1
• /
• pp.45-50
• /
• 2014

In this paper, broadband wireless smart city network coverage was implemented targeting a city (Wonju) using the wireless mesh network. Through this, we could provide wireless network that can easily add network and be repaired easily and have high economic effect. In order to implement broadband wireless smart city network coverage, wireless mesh network has been designed through pre-survey of the region and appropriate selecting of equipment. In addition, the designed network is examined, evaluated and compared with existing network though simulation. The aim of this paper is to prove high cost saving effect of wireless mesh network and its superior performance and to suggest future oriented integrated network of Green IT though research.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.4
• /
• pp.701-712
• /
• 2012

The concept of $k$-shortest disjoint paths is considered important because the establishment of primary and backup forwarding paths exploiting shorter distance and faster propagation time is a dominant consideration for the design of a survivable backbone network. Therefore, we need to evaluate how well the concept of $k$-shortest disjoint paths is exploited for the design of a survivable ship backbone network considering the international standard related to ship backbone networks, the IEC61162-410 standard specifying how to manage redundant message transmissions among ship devices. Performance evaluations are conducted in terms of following objective goals: link capacity, hop and distance of primary and backup paths, even distribution of traffic flows, restoration time of backup forwarding paths, and physical network topology connectivity.

• Korean Journal of Remote Sensing
• /
• v.39 no.2
• /
• pp.143-156
• /
• 2023

To precisely and reliably analyze the contents of the satellite imagery, recognizing the clouds which are the obstacle to gathering the useful information is essential. In recent times, deep learning yielded satisfactory results in various tasks, so many studies using deep neural networks have been conducted to improve the performance of cloud detection. However, existing methods for cloud detection have the limitation on increasing the performance due to the adopting the network models for semantic image segmentation without modification. To tackle this problem, we introduced the multi-branch neural architecture search to find optimal network structure for cloud detection. Additionally, the proposed method adopts the soft intersection over union (IoU) as loss function to mitigate the disagreement between the loss function and the evaluation metric and uses the various data augmentation methods. The experiments are conducted using the cloud detection dataset acquired by Arirang-3/3A satellite imagery. The experimental results showed that the proposed network which are searched network architecture using cloud dataset is 4% higher than the existing network model which are searched network structure using urban street scenes with regard to the IoU. Also, the experimental results showed that the soft IoU exhibits the best performance on cloud detection among the various loss functions. When comparing the proposed method with the state-of-the-art (SOTA) models in the field of semantic segmentation, the proposed method showed better performance than the SOTA models with regard to the mean IoU and overall accuracy.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1305-1308
• /
• 2002

본 논문에서는 이더넷(Ehternet)의 네트워크 진단과 분석을 위해 필수적인 트래픽 발생기(traffic generator)를 설계하고 구현한다. 이더넷 트래픽은 패킷의 양과 프로토콜의 종류 그리고 패킷의 길이 등에 영향을 받는다. 본 연구에서 구현하고자 하는 트래픽 발생기는 이 세가지 항목을 편리한 사용자 인터페이스를 통해 선택하여 다양한 네트워크 트래픽을 발생하는 것을 목표로 한다. 구현된 트래픽 발생기 VTG 는 허브, 라우터 등 네트워크 장비의 성능 평가와 패킷을 모니터링하는 소프트웨어들인 네트워크 진단 시스템과 침입탐지 시스템 등의 성능 평가 및 검증을 위해 사용될 수 있다.

• The KIPS Transactions:PartC
• /
• v.8C no.3
• /
• pp.319-326
• /
• 2001

본 논문에서는 다단계상호연결 네트워크에 기반한 입력버퍼 구조의 ATM 스위치에 관해서 언급한다. 제안된 방법은 HOL 블록킹으로 인해 균일 트래픽(uniform traffic) 하에서 최대 약 58.6%의 처리율을 넘지 못하는 문제를 해결 할 수 있는 방법을 제시하며, 또한 오류허용 기능을 확장시키기 위하여 베이스라인 네트워크에서 버디 연결 매핑 및 제한연결 매핑 특성을 이용한 다중경로를 제공할 수 있는 버퍼 기법에 관하여 언급한다. 시뮬레이션에 의한 성능 평가 결과, 기존 방식과 비교하여 좋은 처리율과 셀 손실율을 보였으며, 더욱이 오류 스위치의 증가에도 불구하고 처리율의 수준은 적정한 셀 지연 범위 내에서 유지될 수 있음을 보여주고 있다.

• Journal of Satellite, Information and Communications
• /
• v.11 no.3
• /
• pp.123-126
• /
• 2016

Energy efficiency in heterogeneous network is considered as one of the main issues when deploying the wireless sensor network. In heterogeneous network, the random distribution of initial energy at each node could lead to an instability of the network. Therefore, a resonable policy must be established in order to maintain the fairness in energy consumption and extend the working time of each node in the network. In this paper, we evaluate the performance of the distributed clustering protocol (DCP) in heterogeneous network on different scenarios. Simulation results are compared with the results of a LEACH protocol in a heterogeneous network. In addition, the performance of system in heterogeneous network are also compared with the homogeneous network to illustrate the effect of imbalance in the initial energy on the life time of each node in the system. The result illustrates that the DCP protocol demonstrates better performance than LEACH protocol in both the heterogeneous and the homogeneous networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.4
• /
• pp.572-580
• /
• 2021

In order to reduce transmission delay and increase reliability in networks, mainly high-performance and high-power network equipment is used to guarantee network quality. In this paper, we propose an optimization algorithm to minimize the energy consumed when transmitting traffic in networks with a bundle link composed of multiple physical cables. The proposed optimization algorithm is a meta-heuristic method, which uses tabu search algorithm. In addition, it is designed to minimize transmission energy by minimizing the cables on the paths of the source and destination nodes for each traffic. In the proposed optimization algorithm, performance evaluation was performed in terms of the number of cables used in the transmission and the link utilization for all traffic on networks, and the performance evaluation result confirmed the superior performance than the previously proposed method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1283-1286
• /
• 2005

본 논문에서는 인터넷 사용자들의 이동 요구사항을 고려하여 현 인터넷 환경에 이동 IP 네트워크를 적용하려는 ISP들을 돕기 위해서 MIPv4와 MIPv6 네트워크의 성능을 비교하였다. 특히, 이동 노드와 상대 노드간의 손실된 패킷의 양과 지속적인 연결을 중심으로 Mobile IPv4와 Mobile IPv6 네트워크상의 TCP 성능을 살펴본다. 이동 노드간의 TCP의 성능은 MIPv6가 MIPv4에 비해서 우수함을 보여준다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.10
• /
• pp.2237-2246
• /
• 2010

In this paper, the performance of a RCO-MAC protocol is evaluated using a different traffic model. Data frames are assumed to generate based on an exponential distribution from one source node and then directly to be stored into the input buffer in the source node. System throughput, average access delay and average system delay are used as a performance measure. Performance evaluation is carried out by the computer simulation. Numerical results show that the RCO-MAC scheme offers 18% higher system throughput than the rDCF scheme. In addition, the numerical results show that the RCO-MAC protocol also offers the better average system delay under any traffic load than that by the rDCF scheme, which was not obtained in the previous research due to the saturated traffic model.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.2
• /
• pp.193-201
• /
• 2008

Using Network Coding in P2P systems yields great benefits, e.g., reduced download delay. The core notion of Network Coding is to allow encoding and decoding at intermediate nodes, which are prohibited in the traditional networking. However, improper implementation of Network Coding may reduce the overall performance of P2P systems. Network Coding cannot work with general arithmetic operations, since its arithmetic is over a Finite Field and the use of an efficient Finite Field arithmetic algorithm is the key to the performance of Network Coding. Also there are other important performance parameters in Network Coding such as Field size. In this paper we study how those factors influence the performance of Network Coding based systems. A set of experiments shows that overall performance of Network Coding can vary 2-5 times by those factors and we argue that when developing a network system using Network Coding those performance parameters must be carefully chosen.