• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.12
• /
• pp.683-689
• /
• 2000

Two-dimensional(2-D) fiber-optic code-division multiple-access(FO-CDMA) system utilizes the optical orthogonal signature pattern code(OOSPC) to encode and decode 2-D data. Encoded 2-D data are spatially multiplexed and transmitted through an image fiber and receiver recovers the intended data by means of thresholding process. OOSPC's construction methods based on expansion of the optical orthogonal code, which is used in one-dimensional(1-D) FO-CDMA system, are introduced. Each OOSPC's performances are compared by using the bit error rate(BER) of interfering OOSPC's of other users. From the results we verify that a balanced incomplete block design(BIBD) construction has the best performance among other mehtods. We also propose a decomposed bit-plane method for parallel transmission and recovery of 256 gray-scale images using OOSPC's constructed by the BIBD method. The simulation result encourages the feasibility of parallel transmission and recovery of multiuser's images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.130-137
• /
• 2005

Wireless communication environment is changing rapidly as we use new wireless communication technology such as WiBro to access high speed Internet. As a result, reliable data transmission using TCP is also expected to increase. Since TCP assumes that it is used in wired network, TCP suffers significant performance degradation over wireless network where packet losses are related to non-congestion loss. Especially RTO imposes a great performance degradation of TCP. In this paper, we analyze the loss recovery probabilities based on previous researches, and use simulation results of our algorithm to show that it prevents performance degradation by quickly detecting and recovery losses without RTO during fast recovery.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.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.

• Journal of the Korea Society of Computer and Information
• /
• v.29 no.6
• /
• pp.175-182
• /
• 2024

In wireless sensor networks, batteries limit lifespan, and heavy data transmission around the sink causes the hotspot problem. To address this, data collection amounts are allocated to child nodes to limit transmission. However, this approach has issues with nodes far from the sink having excessive energy and failing to transmit the allocated amount due to data transmission errors. This paper proposes a method to prevent sensor data loss through error recovery via retransmission. The method ensures that each node's retransmission volume stays within its allocated data amount and energy limits, using excess energy for error recovery. Simulations show that this technique effectively recovers data transmission errors, collects data, minimizes energy depletion around the sink, and increases data collection rates.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.589-596
• /
• 2002

Tn the data transmission service of the mobile host, it is needed to reduce the bandwidth and to make a reliable error recovery. there are two appropriate methods in that. One is FEC which retransmits the parity of error recovery, in case of happening of the loss after forming the parity of error recovery by grouping original data. The other is local recovery based on server which can block the implosion of transmission. The use of FEC and local recovery based on server at the same time enables the reliable multicast. This paper suggests algorithm that recovers the loss by FEC and local recovery based on server through the solution of the problems about triangle routing, tunnel convergence by dividing mobile host into two parts-the sender and the receiver. This model about the loss of algorithm tested the efficiency of performance by the homogeneous independent loss, the heterogeneous independent loss, the shared source link loss model. The suggested algorithm confirms effectiveness in the environment where there are much data and many receivers in mobile host.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.261-264
• /
• 1988

In this paper, a transmission protocol including error recovery strategy on the data link layer for Ethernet using CSMA/CD media accessing method was proposed. So when considering the actual transmission error probability on the channel, it's performance was analyzed through a simulation. Performming the simmulation, the required parameters was taken as those given by Ethernet controller interface board.

• Proceedings of the KIEE Conference
• /
• 2003.07a
• /
• pp.652-654
• /
• 2003

Embedded cost pricing is easy to be applied in the calculation of transmission cost and guarantees perfect recovery of revenue requirement. However, it caused in equity of cost distribution in the restructured electrical market. Though, marginal cost pricing has been studied to be applied to economic signal of members. But it has the cumbersome processes of the revenue reconciliation. This paper presents a new recovery of revenue requirement method that is satisfied with economic signal, using MLF.

• Proceedings of the KIEE Conference
• /
• 2001.11b
• /
• pp.192-194
• /
• 2001

The Transmission network provides physical transport, network security, and connection services. The five principles of Transmission pricing are economic efficiency, cost recovery, efficient regulation, simplicity and transparency, non-discrimination. The Transmission Charges are made up of transmission connection charge and transmission charge of network. The Transmission Losses will be considered through Marginal Transmission Loss Factors in the market operation. The transmission loss rentals are used for the reduction of the annual revenue requirement of the transmission network for the purpose of derivation of transmission use of network charge.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.11
• /
• pp.2067-2080
• /
• 1994

Recently, joint blind equalization and carrier recovery for digital mobile transmission system is of growing interest. In this paper, we describe new receiver structure of joint godard blind equalizer and various recovery loop for QAM modulated signal. After a brief review of Godard blind equalizer and MAP estimation Costas loop, Generalized Costas loop, Leclert loop, Angular form loop, we present two kinds of receiver structures for joint blind equalization and carrier recovery. Using a Monto Carlo simulation technique, we can confirm that two kinds of receiver structures operate very well in the steady state.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.1291-1312
• /
• 2013

Cloud computing changes the service models of information systems and accelerates the pace of technological innovation of consumer electronics. However, it also brings new security issues. As one of the important foundations of various cloud security solutions, entity authentication is attracting increasing interest of many researchers. This article proposes a layered security architecture to provide a trust transmission mechanism among cloud systems maintained by different organizations. Based on the security architecture, four protocols are proposed to implement mutual authentication, data sharing and secure data transmission in federated cloud systems. The protocols not only can ensure the confidentiality of the data transferred, but also resist man-in-the-middle attacks and masquerading attacks. Additionally, the security properties of the four protocols have been proved by S-pi calculus formal verification. Finally, the performance of the protocols is investigated in a lab environment and the feasibility of the security architecture has been verified under a hybrid cloud system.