• Proceedings of the KIEE Conference
• /
• 1997.11a
• /
• pp.101-105
• /
• 1997

This paper presents the worst-case time-delay in CAN(Controller Area Network) system through the mathematical model. Time-delay in the CAN system is devided into a generation delay, a transmission delay and a delivery delay. This paper also measures the performance represented in terms of the number of station, transmission speed, data size etc. by using the computer simulation.

• Journal of KIISE:Information Networking
• /
• v.29 no.5
• /
• pp.543-552
• /
• 2002

Wireless Session Protocol(WSP) which was updated and supplemented based on HyperText Transfer Protocol(HTTP) was designed by Wireless Application Protocol(WAP) forum regarding the characteristics of wireless environment. WSP improved the performance in wireless network, and introduced various facilities considering wireless environment. In this paper, we more improve the performance of WSP adding protocol message compression capability; we cail improved WSP protocol as WSP+. And, we analysis the performance of each protocol with WSP and WSP+ implementation. As a result of experiment, the capability which proposed in this paper reduced a response traffic about 45%. In $10^{-4}$ bit error rate, we also found the packet loss rate and time delay per transaction of WSP+ was improved over 40%. Finally, we found that the protocol message compression capability reduces message retransmission count in transaction layer and shorten the delay time per transaction by reducing a message size.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.6
• /
• pp.37-47
• /
• 2009

In VANET, each vehicle can obtain traffic information from other vehicles or infrastructure, and they frequently exchange life-critical safety message. Therefore, it is necessary among vehicles to establish a secure channel for keeping the driver's safe and protecting the channel against several attack challenges. TSVC is a representative scheme which needs low communication and computation to be performed. But, there is a delay when verifying the messages because it is designed based on TESLA. Thus, it is not acceptable to use TSVC for sending the time-critical messages. In this paper, we propose a novel message authentication scheme which reduces a delay for the verification of messages. Therefore, the proposed scheme can be suitable to transmitting time-critical messages. Furthermore, the scheme supports to privacy preservation and can robust against DoS attacks.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.4
• /
• pp.403-410
• /
• 2010

The switched Ethernet has many features for real-time communications such as providing traffic isolation, large bandwidth, and full-duplex links, and so on. The switched Ethernet, however, cannot guarantee the timely delivery of a real-time message because message delay increases when collisions occurs at the output ports and message loss can even occur due to the overflow at the output buffer. Recently, many research efforts have been done to use the switched Ethernet as an industrial control network. In the industrial control network, sensors periodically sense the physical environment and transmit the sensed data to an actuator, and the periodic messages from sensors to actuators have typically real-time requirements such that those messages must be transmitted within their deadlines. This paper first suggests a feasible condition for EDF (Earliest Deadline First)-based scheduling of periodic messages on a synchronized switched Ethernet and a message scheduling algorithm which satisfies the proposed feasible condition. Pedreiras, et al. [10] suggested a feasible condition for message scheduling on the Ethernet (shared media Ethernet), but there has been no research result on the scheduling condition on the switched Ethernet until now. We compared the real-time message scheduling capacity between the Ethernet and the switched Ethernet by simulation. The simulation result shows that the message scheduling capacity of the Ethernet has almost remained constant as the number of nodes on the network increases, but, in the case of the switched Ethernet, the message scheduling capacity has increased linearly according to the number of nodes on the network.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.107.6-107
• /
• 2002

$\textbullet$ An autonomous mobile robot was controlled through the Internet. $\textbullet$ For the direct control, the feedback data should be provided properly. $\textbullet$ Therefore, an efficient communication scheme should be defined. $\textbullet$ To overcome the transmission delay, the highly abstracted message format was used. $\textbullet$ As the feedback data, the real image sequences may suffer the transmission delay or loss of content. $\textbullet$ To resolve this, the feature information was used to construct the synthetic feedback information. $\textbullet$ By doing this, the operator could feel the hands-on control with an Internet-based robot.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.220-222
• /
• 2000

이동통신 시스템에서 가입자수가 증가하고 다양한 서비스가 구현됨으로써 전체적인 장비 또는 자원에 대한 부하가 증가하고 있다. 특히, 셀의 반경이 작아지고 단문(Short Message)을 활용한 다양한 부가 서비스가 개발됨으로써 이와 관련된 정보를 전달하는 페이징 메시지의 분류도 복잡해지고 페이징 채널의 부하도 커지고 있다. 본 연구에서는 먼저, 이동통신시스템에서 페이징 패널의 구조와 역할을 분석하고 페이징 채널에서 전송하는 메시지를 그 기능과 특성에 따라 분류한다. 긴급하게 전송되어야 하는 메시지를 보호하기 위한 우선권 부여 방법을 모색하고, 각 방법에 있어서 메시지 종류별 전송지연시간(Delay)을 수리적으로 도출하고 결과를 비교한다.

• Proceedings of the IEEK Conference
• /
• 2003.07d
• /
• pp.1697-1700
• /
• 2003

The multi-user online game is a typical example of networked graphic applications. Increasing the reality of such a game requires the minimization of problems due to the network delay. In this paper, we propose a game architecture that reduces the network delay needed for message transfer, and a method for synchronization of game states in clients . The proposed game architecture is region proxy-based, and it can require a less network delay than a conventional client-server style that is usually used in commercial games. In our synchronization method, messages are processed in a batch-mode style and the number of rollbacks needed for synchronization significantly decreases. Our experiment shows that our method provides better performance than previous TSS (Trailing State Synchronization).

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.5
• /
• pp.25-34
• /
• 1997

Relatively slow tuning speed of optical device causes the unwanted delay in high speed single-hop multiwavelength networks. To lessen the overhead, we present a channel access protocol with dynamjic message scheduling. Th eframe structure of proposed protocol adopts hybrid multiaccess scheme in which WDMA is used as a basic multiaccess technique and TDMA is used to provide subchannels within a wavelength band. This architecture has two merits : the network extention is not limited by available number of wavelengths, and the transmission delay caused by optical device tuning time can to minimize the number of tunings. It schedules messages that require same wavelength channels sequencely, so the total transmission delay is reduced by decreasement of wavelength changes. The performance of proposed protocol is evaluated through numerical analysis based on probability and queueing theory. The peformance of proposed protocol is evaluated through numerical analysis based on probability and queueing theory. The numeric results show that the peformance of proposed protocol is better than that of previous one.

• Journal of IKEEE
• /
• v.15 no.1
• /
• pp.104-112
• /
• 2011

During the ground operation of Korean army, the voice message is mainly used for exchanging informations related to the surveillance and reconnaissance, command and control, and precision strike. However, in order to the battlefield visualization among fighting powers participating in the ground force operation, automatic situational awareness and variable message format (VMF) for command and control are required. For securing core technologies necessary for the battlefield visualization, message standard and message handler are established through several applied researches. Besides, the VMF for equipping a weapon system is in development. In this paper, a study on the Korean variable message format (KVMF), where interoperability of integrated battle management system (BMS) is guaranteed due to performing joint, ground, and combined operations so that the situation awareness and strike system can be automated in almost real time, is presented. From the modeling and simulation (M&S) results of the message processor, delay time is varied in accordance with the number of nodes in unit platoon network, message length, and generation interval of routine messages. Therefore, it is shown that the system performance can be optimized by establishing proper network protocol for each situation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.4
• /
• pp.926-938
• /
• 1996

In this paper, we proposed a new multicast algorithm which is efficiently applicable to overlapped process group environments where one process may be involved in several process groups. Unlike the esisting algorithms, the proposed one provides an efficient group communication mechanism by generating the processgroup information in two-level tree. Using this algorithm, we improved the shortcoming of the existing algorithms by reducing the overhead in passing through unnecessary processes for message ordering. We have provided the causal ordering method as well as the total ordering method in group communication environments. As a result, we allow one process to deliver message to other processes with a short delay time, and reduced the overhead required for the message ordering. Also, we logically proved the proposed causal ordering method, and compared the performance of the proposed algorithm with ones of other existing algorithms by computer simulation.