• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.717-720
• /
• 2000

Event-driven communication protocols such as CAN(Controller Area Network) have inherent packet delays due to the contention process for the use of network medium. These delays are stochastic in nature because most packets arrive at random time instants. The stochastic property of the delay adversely influences the control system's performance in terms of stability, responsiveness and steady-state error. Another problem for safety-critical application such as brake-by-wire systems is the reliability of the communication modules that can fail abruptly. This paper deals with two methods to overcome the above problems : (i) scheduling method that can maintain packet delays under some acceptable level, and (ii) redundancy management of communication modules that prescribes dual-redundancy modules' behavior when one of them fails.

• Journal of Positioning, Navigation, and Timing
• /
• v.12 no.2
• /
• pp.201-209
• /
• 2023

Time comparison techniques are required for generating and keeping Coordinated Universal Time (UTC) and to distribute standard clocks. These techniques play an important role in various fields, including science, finance, military, and communication. Among these techniques, Two-Way Satellite Time and Frequency Transfer (TWSTFT) ensures a relatively high accuracy, with a time comparison accuracy at a nanosecond level. However, TWSTFT systems have some limitations, such as the dependency on extra network links. In this paper, we propose an improved method for TWSTFT system operation and design a message structure for the suggestion. Additionally, we estimate the data rate and redundancy for the new TWSTFT signal with the designed message structure.

• Journal of IKEEE
• /
• v.21 no.2
• /
• pp.130-135
• /
• 2017

Normally, in data transmission, extra parity bits are added to the input message which were derived from its input and a pre-defined algorithm. The same algorithm is used by the receiver to check the consistency of the delivered information, to determine if it is corrupted or not. It recovers and compares the received information, to provide matching and correcting the corrupted transmitted bits if there is any. This paper aims the following objectives: to use an alternative error detection-correction method, to lessens both the fixed number of the required redundancy bits 'r' in cyclic redundancy checking (CRC) because of the required polynomial generator and the overhead of interspersing the r in Hamming code. The experimental results were synthesized using Xilinx Virtex-5 FPGA and showed a significant increase in both the transmission rate and detection of random errors. Moreover, this proposal can be a better option for detecting and correcting errors.

• Journal of Communications and Networks
• /
• v.11 no.6
• /
• pp.564-573
• /
• 2009

In this paper, we consider a wireless multiple path network in which a transmitting node would like to send a message to the receiving node with a certain probability of success. These two nodes are separated by N erasure paths, and we devise two algorithms to determine minimum redundancy and optimal symbol allocation for this setup. We discuss the case with N = 3 and then extend the case to an arbitrary number of paths. One of the algorithms minimum redundancy algorithm in exponential time is shown to be optimal in several cases, but has exponential running time. The other algorithm, minimum redundancy algorithm in polynomial time, is sub-optimal but has polynomial worstcase running time. These algorithms are based off the theory of maximum-distance separable codes. We apply the MRAET algorithm on maximum-distance separable, Luby transform, and Raptor codes and compare their performance.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.11a
• /
• pp.395-401
• /
• 2004

In the current high network-centralized computing and enterprising environment, it is getting essential to transmit data reliably at very high rates. Until now previous client/server model based NFS(Network File System) or AFS(Andrew's Files System) have met the various demands but from now couldn't satisfy those of the today's scalable high-performance computing environment. Not only performance but data sharing service redundancy have risen as a serious problem. In case of NFS, the locking issue and cache cause file system to reboot and make problem when it is used simply as ip-take over for H/A service. In case of AFS, it provides file sharing redundancy but it is not possible until the storage supporting redundancy and equipments are prepared. Lustre is an open source based cluster file system developed to meet both demands. Lustre consists of three types of subsystems : MDS(Meta-Data Server) which offers the meta-data services, OST(Objec Storage Targets) which provide file I/O, and Lustre Clients which interact with OST and MDS. These subsystems with message exchanging and pursuing scalable high-performance file system service. In this paper, we compare the transmission speed of gigabytes file between Lustre and NFS on the basis of concurrent users and also present the high availability of the file system by removing more than one OST in operation.

• Archives of design research
• /
• v.18 no.1 s.59
• /
• pp.49-58
• /
• 2005

Focusing on the information sender, message, channel, and receiver, the existing information theory deals with the noise, information contents, and probability of choice, which involve in the process of information transmission. In the current digital environment, besides simply conveying information itself through media, the important issue is how to efficiently convey information. Therefore, we need to analyze the theory in different perspective, and to research the Information redundancy for the methodology of information design. The redundancy causes the receiver to have attraction to the information and to reduce its contents due to its supplement and repetition. So it can play a role of efficient communication method. The concept of redundancy is applied to the communication of art such as literature, architecture, painting, and design to accomplish efficient communication. In order to get persuasive information design for the receiver's perspective we need to make use of this concept. The redundancy can be applied with the technical aspect of multimedia and Interaction, which add supplemental expression, or sort of event for the receiver's experience and memory. In the process of constructing information it can be applied with the structure of gaming redundancy, entropy, the accumulating communication code using entertaining feature, and storytelling methodology. The noise and entropy could be used for the means of making redundancy, not the obstacle to information. The redundancy gives the receiver attraction on the information and makes them have strong will of interpreting it so that the purpose of conveying information will be accomplished efficiently.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.4
• /
• pp.30-39
• /
• 1998

Currently, LAMA(Local Automatic Message Accounting) is a billing mechanism which is being used for billing process, in which billing dat is written on MT(Magnetic Tape), collected at each regional billing center and then processed once a month. However, in order to prepare further development of telecommunication network and future new services, computerization of billing process and new daily billing processing system are urgently needed. Therefore Korea Telecom had developed a CAMA (Centralized Automatic Message Accounting) system for M10CN switch. In the CAMA system, billing data generated in switches is transfered on-line using approproate protocols and various transmission media and immediately processed. The CAMA system for M10CN switch consists of three parts such as ED (Extraction Device), TD(Transmission Device) and HC(Host Collector). The system also has redundancy to maintain continuance and confidence of system operation.

• Journal of Korea Multimedia Society
• /
• v.10 no.1
• /
• pp.94-101
• /
• 2007

Partial dominant pruning(PDP) is regarded as the most practical scheme, reducing redundant messages arisen in broadcasting over ad hoc networks, in such a way that only part of nodes are allowed to forward the received broadcast message. In this paper we propose an extend PDP version called DPDP(directional PDP) such that it reduces not only the number of selected forward nodes, but also the number of antenna elements deployed by the forward nodes. It turns out through simulation that as the number of antenna elements increases, the number of selected forward nodes by DPDP slightly outnumbers that obtained using PDP but both the number of antenna elements deployed by the forward nodes and the redundancy ratio of the received message per node always outperform respectively those given by PDP.

• Journal of Biomedical Engineering Research
• /
• v.26 no.2
• /
• pp.65-71
• /
• 2005

The main obstacles for adopting a mobile health information system to existing hospital information system are the redundancy of clinical data and the additional workload for implementing the new system. To obtain a seamless communication and to reduce the workload of implementation, an easy and simple implementation strategy is required. We propose a mobile clinical information system (MobileMed) which is specially designed for the easy implementation. The key elements of MobileMed are a smart interface, an HL7 message server, a central clinical database (CCDB), and a web server. The smart interface module transfers the key information to the HL7 message server as new clinical tests data is recorded in the existing laboratory information system. The HL7 message server generates the HL7 messages and sends them to the CCDS. As a central database the CCDS collects the HL7 messages and presents them to the various mobile devices such as PDA. Through this study we might conclude that the architecture for the mobile system will be efficient for real-time data communication, and the specially designed interface will be an easy tool for implementing the mobile clinical information system.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.11
• /
• pp.9-16
• /
• 2012

In this paper, we focus on end-to-end transfer delay improvement by using network coding and propose a scheme where a message is divided into several packets which are network coded generating additional redundancy with the results that the number of transmitted packets increases. In networks with high coefficient of variation of transfer time, increased number of packets could reduce the transfer time of the message to a destination. For the proposed scheme, we investigate the optimum number of divided packets and redundancy considering transfer delay reduction and additional transmission cost caused by using network coding under the restriction of maximum transmission packet size. From the results of the investigation, we see that the proposed scheme is effective in networks having high variability of transfer time and would be very useful and practical especially for the case that expedited deliveries of messages are needed.