• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.82.2-82
• /
• 2001

In this paper, when we design and implement an internet-based teleoperation control, some important points that should be considered (e.g., transmission characteristics, time delay prediction and transmission protocol are inspected and simulated. First, we will investigate data transmission characteristics at the Internet, and build a model for the transmission delay and packet loss through the characteristics of that effect. And then, we inspect how to predict transmission delay, and examine transmission protocols which are proper for the control-oriented Internet protocol. Finally, we apply it to a force-reflective teleoperation control system that consists of a six d.o.f haptic interface and a five d.o.f manipulator via the Internet.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.621-624
• /
• 2017

In this paper, we propose a protocol synchronizing to packet trains in a underwater acoustic networks with limitations such as long propagation delay, low data rate, high packet loss. The proposed protocol employs an one-way communication scheme to calculate packet arrival time differences of consecutively transferred packets and minimizes uncertain variation effect of long propagation delay. Simulation results shows the superiority of our protocol, compared with a previously proposed one under the given network conditions.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.1
• /
• pp.129-133
• /
• 2005

Slotted ALOHA(S-ALOHA) is widely used in local wireless network. We analyze the performance of contention-based model in wireless LAN using S-ALOHA protocol. We analyze the performance of binary exponential backoff (BEB) algorithm under the slotted ALOHA protocol: whenever a node's message which tries to reserve a channel is involved in a collision for the ith time, it chooses one of the next $2^i$ frames with equal probability and attempts the reservation again. We derive the expected access delay and throughput which is defined as the expected number of messages that reserve a channel in a frame. A simulation study is performed to verify our method.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.8
• /
• pp.23-28
• /
• 2015

TPSN(Timing-sync Protocol for Sensor Networks), the representative of time synchronization protocol for WSN(wireless sensor networks), was developed to provide higher synchronization accuracy and energy efficiency. So, TPSN's approach has been referenced by so many other WSN synchronization schemes till now. However, TPSN has a collision problem due to simultaneous transmission among competing nodes, which causes more network convergence delay for a network-wide synchronization. A Polling-based scheme for TPSN is proposed in this paper. The proposed scheme not only shortens network-wide synchronization time of TPSN, but also reduce collision traffic which lead to needless power consumption. The proposed scheme's performance has been evaluated and compared with an original scheme by simulation. The results are shown to be better than the original algorithm used in TPSN.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.930-937
• /
• 2004

In this paper, we analyze the delay performance for a Markovian source transported over a wireless channel with time-varying error characteristics. To improve the reliability of the channel, the end points of the wireless link implement a selective-repeat (SR) ARQ error control protocol. We provide an approximate discrete-time analysis of the end-to-end mean packet delay, which consists of transport and resequencing delays. Numerical results and simulations indicate that our approximate analysis is sufficiently accurate for a wide range of parameter values.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.3
• /
• pp.144-149
• /
• 2003

Encryption/decryption delay is minimized, because there are constraints in transporting a multimedia data through the Internet. Therefore, encryption algorithm is needed which is changed with considering network traffic and load. And during many users participate in the same multimedia service, an user who already left the service can receive and the method which decrypt the RTP payload is needed because of knowing the encryption key. Therefore in this paper, Security Control Protocol for RTP is designed and implemented for changing the encryption algorithm and the key.

• Journal of Communications and Networks
• /
• v.6 no.2
• /
• pp.147-155
• /
• 2004

In this paper, we propose an efficient sequencing technique, namely minimum Row time scheduling (MFTS), to manage variable-Iength message transmissions for single-hop passive starcoupled WDM optical networks. By considering not only the message length but also the state of the receivers and the tuning latency, the proposed protocol can reduce the average delay of the network greatly. This paper also introduces a new channel assignment technique latency minimizing scheduling (LMS), which aims to reduce the scheduling latency. We evaluate the proposed algorithm, using extensive discrete-event simulations, by comparing its performance with shortest job first (SJF) algorithm. We find that significant improvement in average delay could be achieved by MFTS algorithm. By combining the proposed message sequencing technique with the channel selection technique, the performance of the optical network could be further improved.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.1
• /
• pp.177-182
• /
• 2014

In this paper, we propose an energy efficient sink node based MAC protocol for Wireless Sensor Networks (WSNs). The proposed sink node-based MAC (SB-MAC) protocol uses a RB(rapid beacon) frame to save sender's energy consumption and to reduce transmission delay. The RB frame is a modified IEEE 802.15.4 beacon frame. The RB frame contains the length of the sender nodes data. Using this information other nodes except sender and receiver nodes can be stay sleep mode long time to reduce energy consumption. Results have shown that the SB-MAC protocol outperformed other protocols like X-MAC and RI-MAC in terms of packet delivery delay and energy consumption. The SB-MAC protocol is especially energy efficient for the networks with one sink node and many senders.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.997-1010
• /
• 2014

Today, as the hierarchical cellular system is getting more attention than before, some recent studies introduce delay based admission control (AC) scheme which delays the admission to the macro-embedded small cell for a relatively short time to prevent unnecessary handover caused by the short-term visitors of the small cell area. In such delay based ACs, when we use improper delay parameter, the system frequently makes incorrect handover decisions such as where unnecessary handover is allowed due to too short delaying, or where necessary handover is denied due to too long delaying. In order to avoid these undesirable situations as much as possible, we develop a new delay parameter decision method based on probabilistic cell residence time approximations. By the extensive numerical and analytical evaluations, we determine the proper delay parameter which prevents the incorrect handover decision as much as possible. We expect our delay parameter decision method can be useful system administration tips in hierarchical cellular system where delay based AC is adopted.

• Journal of Korea Multimedia Society
• /
• v.19 no.10
• /
• pp.1808-1815
• /
• 2016

TPSN(Timing-sync Protocol for Sensor Networks), the representative of time synchronization protocol, has been already developed to provide time synchronization among nodes in wireless sensor networks. Even though the TPSN's method has been referenced by so many other time synchronization schemes for resource-constrained networks like wireless sensor networks or low power personal area networks, it has some inefficiency in terms of power consumption and network-wide synchronization time (or called convergence time). The main reason is that each node in TPSN needs waiting delay to solve the collision problem due to simultaneous transmission among competing nodes, which causes more power consumption and longer network convergence time for a network-wide synchronization. In this paper an improved scheme is proposed by changing message exchange method among nodes. The proposed scheme not only shortens network-wide synchronization time, but also reduce collision traffic which lead to needless power consumption. The proposed scheme's performance has been evaluated and compared with an original scheme by simulation. The results are shown to be better than the original algorithm used in TPSN.