• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.1
• /
• pp.57-62
• /
• 2014

The benefits of infrastructure support are shown by analyzing a throughput scaling law of an erasure network in which multiple relay stations (RSs) are regularly placed. Based on suitably modeling erasure probabilities under the assumed network, we show our achievable network throughput in the hybrid erasure network. More specifically, we use two types of physical models, a exponential decay model and a polynomial decay model. Then, we analyze our achievable throughput using two existing schemes including multi-hop transmissions with and without help of RSs. Our result indicates that for both physical models, the derived throughput scaling law depends on the number of nodes and the number of RSs.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.911-916
• /
• 2016

The nearest-neighbor multihop routing with/without infrastructure support is known to achieve the optimal capacity scaling in a large packet-erasure network in which multiple wireless nodes and relay stations are regularly placed and packets are erased with a certain probability. In this paper, a throughput scaling law is shown for an infrastructure-supported erasure network where wireless nodes are randomly distributed, which is a more feasible scenario. We use an exponential decay model to suitably model an erasure probability. To achieve high throughput in hybrid random erasure networks, the multihop routing via highway using the percolation theory is proposed and the corresponding throughput scaling is derived. As a main result, the proposed percolation highway based routing scheme achieves the same throughput scaling as the nearest-neighbor multihop case in hybrid regular erasure networks. That is, it is shown that no performance loss occurs even when nodes are randomly distributed.

• Bulletin of the Korean Space Science Society
• /
• 2011.04a
• /
• pp.25.5-26
• /
• 2011

이 연구에서는 네트워크 기반의 다중기준국을 이용하여 육상교통환경에서 항법위성의 궤도력에 따른 위치결정 성능향상의 정도를 분석하였다. 위성항법보정시스템(Differential Global Positioning System)을 활용하였을 경우 항법위성의 궤도력 오차정보가 소거되지 않는다는 가정 하에 방송궤도력이 아닌 International GNSS Service(IGS) 정밀궤도력중 신속궤도력(Ultra-Rapid)을 이용하여 궤도력 오차에 따라 위치결정 정확도가 향상됨을 확인하였다. 일반적으로 사용하는 위성항법보정시스템을 활용한 위치결정 방법은 기준국과 사용자의 거리에 따라서 그 성능이 달라진다. 이는 궤도 오차, 대류층 및 전리층 오차 등이 거리에 의존적이기 때문이다. 다중기준국을 활용하는 방법은 거리가 멀어짐에 따라 소거되지 않는 오차등을 극복하기 위한 기술이며 사용자 주변을 둘러싼 기준국들의 측정값을 조합하여 보상을 하거나 정확하게 모델링하여 사용자에게 오차정보를 보정정보로 전송하여 위치결정의 성능을 향상시키는 방법이다. 분석된 결과는 네트워크 기반의 다중기준국 환경에서 사용자와 기준국간의 거리에 따른 공간이격 오차정보 보정정보 생성 연구에 활용하며 이를 통해 육상교통 사용자의 위치결정 정확도 성능을 향상하는데 기여할 것으로 기대된다.

• Journal of the Korean Society of Safety
• /
• v.11 no.1
• /
• pp.16-26
• /
• 1996

In a series of original papers, [1-17] efficient methods and algorithms have been presented, for the exact solution of many reliability problems represented by binary networks. A starting point of these methods was the concept of domination, firstly introduced in ,elation with reliability problems in [2]. It's application to directed networks resulted in the development of a topological formula for the classical problem of the two terminal reliability. This result was extended later to the all-terminal and the k-terminal reliability problems. All papers mentioned above use a path oriented representation for the network topology. In practical applications, however, it is common and often advantageous to work with cut sets. This article considers the Domination theory for reliability problem of a network. Some topological formula are derived and the power and the application of this formula are shown through the alternative proof of topological formula of A. Satyanarayana [2].

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

• Spatial Information Research
• /
• v.15 no.2
• /
• pp.111-121
• /
• 2007

The GPS positioning offer 3D position using code and carrier phase measurements, but the user can obtain the precise accuracy positioning using carrier phase in Real Time Kinematic(RTK). The main problem, which RTK have to overcome, is the necessary to have a reference station(RS) when using RTK should be generally no more than 10km on average, which is significantly different from DGPS, where distances to RS can exceed several hundred kilometers. The accuracy of today's RTK is limited by the distance dependent errors from orbit, ionosphere and troposphere as well as station dependent influences like multipath and antenna phase center variations. For these reasons, the author proposes Network based GPS Carrier Phase Differential Positioning using Multiple RS which is detached from user receiver about 30km. An important part of the proposed system is algorithm and software development, named DAUNet. The main process is corrections computation, corrections interpolation and searching for the integer ambiguity. Corrections computation of satellite by satellite and epoch by epoch at each reference station are calculated by a Functional model and Stochastic model based on a linear combination algorithm and corrections interpolation at user receiver are used by area correction parameters. As results, the users can obtain the cm-level positioning.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.119-126
• /
• 2012

Local monitoring is an effective technique in securing data of wireless sensor networks. Existing solutions require high communication cost for detecting false data and this results in a network lifetime being shortened. This paper proposes novel techniques of monitoring based secure data aggregation and filtering false data in wireless sensor networks. The aim is to reduce energy consumption in securing data aggregation. An aggregator and its monitoring node perform data aggregation in a 60o sextant cluster. By checking Message Authentication Codes (MAC), aggregation data will be dropped by a forward aggregator if data aggregated by the aggregator and data monitored by the monitoring node are inconsistent. The simulation shows that the proposed protocol can reduce the amount of average energy consumption about 64% when comparing with the Data Aggregation and Authentication protocol (DAA)[1]. Additionally, the network lifetime of the proposed protocol is 283% longer than that of DAA without any decline in data integrity.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.435-446
• /
• 2001

In this paper, a new fairness control method is proposed to distribute DQDB-SR (Distributed-Queue Dual-Bus with Slot Reuse) network bandwidth fairly to all stations on client-server environments. By using an access limit that follows a characteristic of client-sever load patterns and a bandwidth borrowing and returning mechanism, the proposed mechanism imparts fairness bandwidth control capability to DQDB-SR. To implement the proposed mechanism, we find the optimal placement of erasure nodes that maximizes network capacity for DQDB-SR, and calculate the access limit. At overload conditions, simulation results show that the proposed mechanism does not deteriorate network throughput, and outperforms other fairness control mechanisms in a success rate and an average packet transfer delay.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.11a
• /
• pp.248-249
• /
• 2023

블록체인의 데이터 중복 저장 문제를 해결하기 위해 소거 코드 기반의 분산 저장 방법이 제안되었고, 이에 따라 청크 데이터의 효율적인 전파가 중요해졌다. 본 연구는 이를 위해 QUIC 프로토콜을 도입하여 청크 데이터의 신속한 전파 기능을 구현하였다. 더불어 Reed-Solomon 코드 기반 시스템에서 QUIC 프로토콜의 효용성을 검증한 결과, QUIC 프로토콜은 분산 저장 시스템에서 청크 데이터 전파와 재인코딩 성능에 결정적 역할을 수행함을 확인하였다. 이는 QUIC 프로토콜이 블록체인과 같은 네트워크 환경에서 효과적으로 사용될 수 있음을 나타낸다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.3
• /
• pp.310-317
• /
• 1993

This paper presents a mechanism for improving performance of the IEEE 802.6 MAN(Metropolitan Area Network), a dual-bus structured high-speed communication network, by a more efficient use of bandwidth. The MAN protocol is able to handle various traffic and offers better transmission speed than the conventional LAN, but the unidirectional bus structure and propagation delay of request bits results in unfairness since higher nodes use more bandwidth. As the number of stations and the distances between them are increased, the problem becomes mere serious. As a solution, this paper presents a method that every station enables to identify the used slots, and that a specified class denoted 'erasure station' has with the functions of destination release, slot reuse. As a result, it is export to improve network bandwidth values of each station and the throughput and delay time was analytically analyzed, and it is shown that according to computer simulation results, this mechanism improves the network performance.