• 한국정보통신학회논문지
• /
• 제18권1호
• /
• pp.57-62
• /
• 2014

다수의 중계기가 균등하게 분포된 무선 소거 네트워크의 용량 스케일링 법칙을 분석함으로써 인프라 구조 사용시 이득을 보인다. 가정하는 네트워크 하에서 소거 확률을 적절히 모델링함에 근거하여, 혼합 소거 네트워크에서 취득 가능한 네트워크 용량을 보인다. 보다 구체적으로, 지수 감쇠 모델 및 다항 감쇠 모델 이렇게 두 가지 물리적 모델을 사용한다. 중계기 도움이 없는 다중 홉 전송, 중계기 도움을 받는 다중 홉 전송 이렇게 두 가지 존재하는 기술을 사용하여 취득 용량을 분석한다. 유도된 용량 스케일링 법칙은 두 가지 물리적 모델 모두에 대해 노드 수 및 중계기의 수에 의존함을 확인한다.

• Journal of Communications and Networks
• /
• 제10권4호
• /
• pp.384-395
• /
• 2008

Random network coding can be viewed as a single block code applied to all source packets. To manage the concomitant high coding complexity, source packets can be partitioned into generations; block coding is then performed on each set. To reach a better performance-complexity tradeoff, we propose a novel concatenated network code which mixes generations while retaining the desirable properties of generation-based coding. Focusing on the code's erasure performance, we show that the probability of successfully decoding a generation on erasure channels can increase substantially for any erasure rate. Using both analysis (for small networks) and simulations (for larger networks), we show how the code's parameters can be tuned to extract best performance. As a result, the probability of failing to decode a generation is reduced by nearly one order of magnitude.

• 한국정보통신학회논문지
• /
• 제20권5호
• /
• pp.911-916
• /
• 2016

인프라구조 도움을 받는 최 인근 다중 홉 라우팅 및 순수 최 인근 다중 홉 라우팅은 다수 개의 무선 노드와 중계기가 균일하게 분포되며 패킷이 특정 확률로 삭제되는 거대한 패킷 소거 네트워크에서 최적의 용량 스케일링을 취득하는 것으로 알려져 있다. 본 논문에서는 보다 실제적인 시나리오로써 무선 노드가 랜덤하게 분포하는 인프라구조 도움을 받는 소거 네트워크에서의 용량 스케일링 법칙을 보인다. 소거 확률을 모델링하기 위해 지수적 감쇠 모델을 사용한다. 혼합 랜덤 소거 네트워크에서 고용량 취득을 위해 침투 이론을 사용한 고속도로 기반 다중 홉 라우팅을 제안하고, 대응되는 용량 스케일링을 분석한다. 주요 결과로써, 제안한 침투 고속도로 기반 라우팅 기술은 혼합 균일 소거 네트워크에서 최 인근 다중 홉을 사용한 경우와 동일한 용량 스케일링 취득이 가능함을 보인다. 즉, 노드가 랜덤하게 분포하는 상황에서도 성능 손실은 발생하지 않음을 확인한다.

• 한국정보과학회논문지:정보통신
• /
• 제31권1호
• /
• pp.1-10
• /
• 2004

본 연구는 erasure 코드를 이용한 응용계층 FEC 기법에 대해 설명한다 Erasure 코드는 디코딩 알고리즘이 간단하여 응용수준에서 패킷 단위 에러 복구에 효율적이다. 그러나 많은 양의 패리티 패킷을 보내는 것은 에러 복구율을 높일 수 있지만 네트웍 혼잡 상황을 악화시킬 수 있다. 따라서 네트웍 상태에 적응적으로 패리티 패킷의 양을 조절할 수 있는 부가정보조절 기법이 필요하다. 또한, 비디오 데이타와 같이 우선순위가 있는 데이타의 경우 마땅히 높은 우선순위의 데이타가 더 많은 부가정보를 가져야 한다 본 연구는 네트웍 상태(손실 정보와 혼잡 정보)와 데이타 중요도에 기반 한 패킷 손실 제어 기법을 제안하고 단순링크와 혼잡링크에서 그 성능을 평가한다.

• 전자공학회논문지A
• /
• 제30A권5호
• /
• pp.1-15
• /
• 1993

In DQDB networks, the bandwidth can be increased considerably be using the EN(Erasure Node) algorithms and DR(Destination Release) algorithms. However, the important issue in implementing them is using method of extra capacity fairly. To improve it, this paper proposes AEN(Adaptive Erasure Node) algorithm which erasure function is activated by network traffic load. Its functional architecture consists of SESM, RCSM, LMSM in addition to the basic DQDB state machines (DQSM, RQM). The SESM and RCSM state machines are placed in front of the DQSM and RQM state machines in order for the node to take advantage of the newly cleared slots. This paper also presents some simulation results showing the effect of AEN algorithm on access delay, throughput and segment erasing ratio in the single and multiple priority networks. The results show that the AEN algorithm offer the better performance characteristics than existing algorithms under overload conditions.

• Journal of Communications and Networks
• /
• 제13권2호
• /
• pp.160-166
• /
• 2011

In u-healthcare services based on wireless body sensor networks, reliable connection is very important as many types of information, including vital signals, are transmitted through the networks. The transmit power requirements are very stringent in the case of in-body networks for implant communication. Furthermore, the wireless link in an in-body environment has a high degree of path loss (e.g., the path loss exponent is around 6.2 for deep tissue). Because of such inherently bad settings of the communication nodes, a multi-hop network topology is preferred in order to meet the transmit power requirements and to increase the battery lifetime of sensor nodes. This will ensure that the live body of a patient receiving the healthcare service has a reduced level of specific absorption ratio (SAR) when exposed to long-lasting radiation. We propose an efficientmethod for delivering delay-intolerant data packets over multiple hops. We consider forward error correction (FEC) in an erasure correction mode and develop a mathematical formulation for packet-level scheduling of delay-intolerant FEC packets over multiple hops. The proposed method can be used as a simple guideline for applications to setting up a topology for a medical body sensor network of each individual patient, which is connected to a remote server for u-healthcare service applications.

• 한국통신학회논문지
• /
• 제41권12호
• /
• pp.1684-1691
• /
• 2016

최근 분산 저장 시스템에 erasure code를 활용하여 저장소 효율성을 높이려는 연구가 활발히 진행되고 있다. 재생 부호(regenerating codes)는 erasure code의 일종으로, 높은 저장소 효율성과 네트워크 효율성을 가지는 코드이다. (n,k,d)-재생 부호는 n개의 저장소 노드를 가지며, 손실된 노드가 발생하였을 때, 해당 노드는 d개의 살아남은 노드로부터 정보를 다운로드받아 복구될 수 있다. 하지만 일반적인 재생 부호는 노드 복구 시 정확히 d개의 도움 노드들을 사용해야 하며, 노드 손실이 빈번하거나, 노드 간 접속이 불안정한 환경에서, d개 이하의 노드들에만 접속 가능할 경우에 유연하게 대처할 수 없다. 본 논문에서는 약간의 복구 대역폭의 희생을 통하여, $$k{\leq_-}{\bar{d}}{\leq_-}d$$의 다양한 도움 노드의 수 ${\bar{d}}$개로 노드를 복구할 수 있는 유연한 코드 운용 방식을 제안하였다.

• 한국멀티미디어학회논문지
• /
• 제19권8호
• /
• pp.1487-1497
• /
• 2016

Explosively growing service of digital multimedia data increases the need for highly scalable low-cost storage. This paper proposes the new storage architecture based on torus network which does not need network switch and erasure coding for efficient storage usage for high scalability and efficient disk utilization. The proposed model has to compensate for the disadvantage of long network latency and network processing overhead of torus network. The proposed storage model was compared to two most popular distributed file system, GlusterFS and Ceph distributed file systems through a prototype implementation. The performance of prototype system shows outstanding results than erasure coding policy of two file systems and mostly even better results than replication policy of them.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권1호
• /
• pp.62-77
• /
• 2010

Emerging applications with high data rates will need to transport bulk data reliably in wireless sensor networks. ARQ (Automatic Repeat request) or Forward Error Correction (FEC) code schemes can be used to provide reliable transmission in a sensor network. However, the naive ARQ approach drops the whole frame, even though there is a bit error in the frame and the FEC at the bit level scheme may require a highly complex method to adjust the amount of FEC redundancy. We propose a bulk data transmission scheme based on erasure-resilient code in this paper to overcome these inefficiencies. The sender fragments bulk data into many small blocks, encodes the blocks with LT codes and packages several such blocks into a frame. The receiver only drops the corrupted blocks (compared to the entire frame) and the original data can be reconstructed if sufficient error-free blocks are received. An incidental benefit is that the frame error rate (FER) becomes irrelevant to frame size (error recovery). A frame can therefore be sufficiently large to provide high utilization of the wireless channel bandwidth without sacrificing the effectiveness of error recovery. The scheme has been implemented as a new data link layer in TinyOS, and evaluated through experiments in a testbed of Zigbex motes. Results show single hop transmission throughput can be improved by at least 20% under typical wireless channel conditions. It also reduces the transmission time of a reasonable range of size files by more than 30%, compared to a frame ARQ scheme. The total number of bytes sent by all nodes in the multi-hop communication is reduced by more than 60% compared to the frame ARQ scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권3호
• /
• pp.1193-1209
• /
• 2015

Network coding is promising to maximize network throughput and improve the resilience to random network failures in various networking systems. In this paper, the problem of providing efficient confidentiality for practical network coding system against a global eavesdropper (with full eavesdropping capabilities to the network) is considered. By exploiting a novel combination between the construction technique of systematic Maximum Distance Separable (MDS) erasure coding and traditional cryptographic approach, two efficient schemes are proposed that can achieve the maximum possible rate and minimum encryption overhead respectively on top of any communication network or underlying linear network code. Every generation is first subjected to an encoding by a particular matrix generated by two (or three) Vandermonde matrices, and then parts of coded vectors (or secret symbols) are encrypted before transmitting. The proposed schemes are characterized by tunable and measurable degrees of security and also shown to be of low overhead in computation and bandwidth.