• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.41-44
• /
• 2013

As appearance of high-quality service such as UDTV application, high-speed and high-capacity communication services are required. For this, communication systems increase the data processing speed and use various error correction techniques. In this paper, we implement the Viterbi decoder applied in 1000BASE-T with 4 pairs UTP cable. The minimum operating speed of the Viterbi decoer should be more than 125 MHz because 125 MHz PAM-5 signal is transmitted on each pair of cables in 1000BASE-T. To do this, we implement the decoder by using the pipeline and parallel processing and verify the operation with 125 MHz by using a logic analyzer. Finally, we will show that the decoder recovers the original data for the added random error data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2027-2034
• /
• 1997

Frame relay is a fast packet switching technology that performs relaying and multiplexing frames with variable lengths over a wide area link at the T1 or E1 speed, by elminating error and flow control in the network. In frame relay networks, congestion control is typically performed through the rate enforcement with a discard eligibility (DE) bit, and the explicit negative feedback meachanisms using explicit congetion notification bits. In this paper, we consider the congestiong control scheme using the rate enforcement mechanism with DE bit for frame relay network. Assuming that each frame with exponentially distributed length arrives according to the Poission fashion, we can treat the frame relay switch as an M/M/1/K priority queueing system with pushout basis. We analyze and present the blocking probabilities and waiting time distributions of frames.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4B
• /
• pp.236-244
• /
• 2012

The minimum energy broadcast problem is for all deployed nodes to minimize a total transmission energy for performing a broadcast operation in wireless networks. In this paper, we propose a Tabu search algorithm to solve efficiently the minimum energy broadcast problem on the basis of meta-heuristic approach in wireless sensor networks. In order to make a search more efficient, we propose a novel neighborhood generating method and a repair function of the proposed algorithm. We compare the performance of the proposed algorithm with other existing algorithms through some experiments in terms of the total transmission energy of nodes and algorithm computation time. Experimental results show that the proposed algorithm is efficient for the minimum energy broadcast problem in wireless sensor networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.9
• /
• pp.555-560
• /
• 2014

Recently, there are many researches on sharing group session key for members in a group. Among them, Harn and Lin proposed a scheme based on the Shamir's group session key and Liu, Cheng, Cao, and Jiang improved it to reduce the specific weakness. Especially, these schemes are based on the finite integer ring to protest the insider attack, in which a valid member can derived another member's secret using known information. In this paper, it is shown that the finite integer ring implies the failure of the reconstruction of group session key depending on the adopted parameters. We fix this problem and propose new group session key transfer scheme using the Shamir's secret sharing.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.400-402
• /
• 2005

전파(propagation) 오류가 빈번한 무선 이동 네트워크에서는 전송 성능을 향상하기 위해 FEC(Forward Error Correction) 알고리즘을 채택한다. 그러나 정적인 FEC 코드 제어 방식은 연속적으로 변화하는 전파 오류율에 알맞은 정정 코드(check code)를 적용하지 못해 성능이 저하된다. 일례로 측정한 고 오류 무선 센서 네트워크에서는 초단위 평균 BER(Bit Error Rate) 또는 분단위 평균 BER이 0에서 최대 $10^{-3}$까지 연속적으로 변화한다. 이러한 무선 환경에서 전파 오류를 $100\%$ 복구하기 위한 정정 코드를 채택하는 경우에는, 불필요한 정정 코드량은 전체 데이터에 최대 $20\%$를 차지한다. 본 논문에서는 무선 채널의 BER을 직접 측정하지 않고 패킷 전송 성공 여부에 따라 정정 코드의 량, 즉 FEC단계를 동적으로 변화하는 AFECCC (Adaptive FEC Code Control) 알고리즘을 소개한다. AFECCC는 트레이스 기반(trace-driven) 시뮬레이션에서 정적 FEC 방식에 비해 최대 $5\%$ 이상, 또한 실제 센서 네트워크에서는 정적 FEC 알고리즘에 비해 최대 $15\%$ 성능이 향상되었다.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.241-248
• /
• 2006

Mobile computing has such characteristics as portability, wireless network, mobility, etc. These characteristics cause various problems to mobile terminals like frequent disconnection, high error rate, and varying network status. These problems motivate us to develop an adaptive error control mechanism for supporting multimedia service in mobile computing environment. In this paper, we propose the Adaptive Error Control(AEC) scheme using client's buffer size and current error rate. After categorizing the status into four groups according to client's buffer size and current error rate, this scheme applies an appropriate error control scheme to each status. In this scheme, thresholds of buffer size and error rate are determined by the data transmission time, play rate and average VOP size, and by the probability of error for a sequence of packets. The performance of proposed scheme is evaluated by flaying MPEG-4 files on an experimental client/server environment, respectively. The results show that error correcting rate is similar to other schemes while the time for correcting error reduce a little. In addition, the size of data for correcting error is decreased by 23% compared with FEC and Hybrid FEC, respectively. Theses results demonstrate that the proposed scheme is more suitable in mobile computing environment with small bandwidth and varying environment than existing schemes.

• Journal of the Korea Society for Simulation
• /
• v.25 no.2
• /
• pp.31-40
• /
• 2016

Wireless sensor networks have been used in many applications such as marine environment, army installation, etc. The sensor data is very important, because all these applications depend on sensor data. The possibility of communication failures becomes high since the surrounding environment of a wireless sense network has an sensitive effect on its communications. In particular, communication failures in underwater communications occur more frequently because of a narrow bandwidth, slow transmission speed, noises from the surrounding environments and so on. In cases of communication failures, the sensor data can be lost in the sensor data delivery process and these kinds of sensor data losses can make critical huge physical damages on human or environments in applications such as fire surveillance systems. For this reason, although a few of studies for storing and compressing sensor data have been proposed, there are lots of difficulties in actual realization of the studies due to none-existence of the framework using network communications. In this paper, we propose a framework for reducing loss of the sensor data and analyze its performance. The our analyzed results in non-framework application show a decreasing data recovery rate, T/t, as t time passes after a network failure, where T is a time period to fill the storage with sensor data after the network failure. Moreover, all the sensor data generated after a network failure are the errors impossible to recover. But, on the other hand, the analyzed results in framework application show 100% data recovery rate with 2~6% data error rate after data recovery.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.127-134
• /
• 2005

Lost packet robustness is an most important quality measure for voice over IP networks(VoIP). Recovery of the lost packet from the received information is crucial to realize this robustness. So, this paper proposes the lost packet recovery method from the received information for real-time communication for CELP coder. The proposed BS-PLC (Both Side Packet Loss Concealment) based WSOLA(Waveform Shift OverLab Add) allow the lost packet to be recovered from both the 'previous' and 'next' good packet as the LP parameter and the excitation signal are respectively recovered. The burst of packet loss is modeled by Gilbert model. The proposed scheme is applied to G.729 most used in VoIP and is evaluated through the SNR(signal to noise) and the MOS(Mean Opinion Score) test. As a simulation result, The proposed scheme provide 0.3 higher in Mean Opinion Score and 2 dB higher in terms of SNR than an error concealment procedure in the decoder of G.729 at $20\%$ average packet loss rate.

• Journal of KIISE:Information Networking
• /
• v.35 no.2
• /
• pp.99-111
• /
• 2008

In recent years, the needs for WLANs(Wireless Local Area Networks) technology which can access to Internet anywhere have been dramatically increased particularly in SOHO(Small Office Home Office) and Hot Spot. However, unlike wired networks, there are some unique characteristics of wireless networks. These characteristics include the burst packet losses due to unreliable wireless channel. Note that burst packet losses, which occur when the distance between the wireless station and the AP(Access Point) increase or when obstacles move temporarily between the station and AP, are very frequent in 802.11 networks. Conversely, due to burst packet losses, the performance of 802.11 networks are not always as sufficient as the current application require, particularly when they use TCP at the transport layer. The high packet loss rate over wireless links can trigger unnecessary execution of TCP congestion control algorithm, resulting in performance degradation. In order to overcome the limitations of WLANs environment, MAC-layer LDA(Loss Differentiation Algorithm)has been proposed. MAC-layer LDA prevents TCP's timeout by increasing CRD(Consecutive Retry Duration) higher than burst packet loss duration. However, in the wireless channel with high packet loss rate, MAC-layer LDA does not work well because of two reason: (a) If the CRD is lower than burst packet loss duration due to the limited increase of retry limit, end-to-end performance is degraded. (b) energy of mobile device and bandwidth utilization in the wireless link are wasted unnecessarily by Reducing the drainage speed of the network buffer due to the increase of CRD. In this paper, we propose a new retransmission module based on Cross-layer approach, called BLD(Burst Loss Detection) module, to solve the limitation of previous link layer retransmission schemes. BLD module's algorithm is retransmission mechanism at IEEE 802.11 networks and performs retransmission based on the interaction between retransmission mechanisms of the MAC layer and TCP. From the simulation by using ns-2(Network Simulator), we could see more improved TCP throughput and energy efficiency with the proposed scheme than previous mechanisms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9C
• /
• pp.840-848
• /
• 2007

A multiple description coding (MDC) scheme for 3-D Data is presented. First, a plane-based 3-D data is split into two descriptions, each of which has identical contribution in 3-D surface reconstruction. In order to maximize the visual quality of reconstructed 3-D data, then, plane parameters are modified according to channel error condition. Finally, these descriptions are compressed and transmitted over distinct channels. In decoder, if two descriptions are available, we reconstruct a high quality 3-D data. If only one description is transmitted, however, 3-D surface recovery scheme reduces artifacts on erroneous 3-D surface, yielding a smooth 3-D surface. Therefore, the proposed algorithm guarantees acceptable quality reconstruction of 3-D data even though one channel is totally lost.