• IEMEK Journal of Embedded Systems and Applications
• /
• v.15 no.2
• /
• pp.95-101
• /
• 2020

In situations where mobile robots are operated either by autonomous systems or human operators, such as smart factories, priority-based teleoperation is crucial for the multiple operators with different priority to take over the right of the robot control without conflict. This paper proposes a priority-based teleoperation system for multiple operators to control the robots. This paper also introduces an efficient joystick-based robot control command generation algorithm for differential-drive mobile robots. The proposed system is implemented with ROS (Robot Operating System) and embedded control boards, and is applied to Pioneer 3AT mobile robot platform. The experimental results demonstrate the effectiveness of the proposed joystick control command algorithm and the priority-based control input selection.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.27 no.1
• /
• pp.17-29
• /
• 2024

This study was conducted to select the restoration priority of forest damage sites in Gangwon Province. We first identified the status of damaged areas. We then selected restoration evaluation indicators through a literature review. We then set weights for these indicators through expert surveys. We next acquired data that can represent these indicators and spatially mapped them. Finally, we prioritized the restoration target sites by taking the weights. The results of the study showed that disaster sensitivity and ecologicality are important criteria for selecting the restoration priority of damage sites. The analysis showed that damage sites in Doam, Jeongseon, Samcheok and Inje are in urgent need of restoration. The results of this study are significant in that they selected the restoration priority of damage sites in Gangwon Province based on the restoration priority evaluation criteria selected based on expert surveys. However, the priority restoration areas derived from the results of this study are not actually implementing restoration projects at present. Therefore, it is judged that it would be efficient in various aspects to establish the restoration priority area based on scientific analysis techniques and carry out the project for efficient implementation of the restoration project. In this study, it can be pointed out that the priority of restoration of damage sites was derived based on data from the past due to the limitation of data acquisition. However, the fact that the priority restoration area inferred based on past data has been restored over time has improved the reliability of the study by verifying the usefulness of the priority extraction technique. In the future, if the priority of damage sites is extracted by extracting the restoration target area boundary through the latest data based on the methodology applied in this study, it is considered that it will be available as a result that can be applied to the field.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.1367-1369
• /
• 2013

Applying Application-Level Multicast technology (ALM) to Distributed Interactive Applications (DIAs) becomes more and more popular. Especially for DIAs embedded priority that the sender forwards data to receivers due to their respective priorities. The priority-based directed minimum spanning tree (PST) algorithm was designed for these DIAs. However, the PST has no efficient priority selection and filtering mechanism. The system will consume a tremendous amount of resource for reconstructing distribution tree and becomes unstable and unscalable. In this paper, First, We propose a novel priority-based application level multicast algorithm: Predict-and-Quantize for Priority with directed minimum Spanning Tree (PQPST), which can efficiently predict efficient priorities for the receivers and quantize the predicted priorities to build the multicast distribution tree. Second, we propose Priority Discrepancy Heuristic Mechanism (PDHM), which sets different thresholds of priority discrepancy within the priority discrepancy interval to control the distribution tree construction can efficiently decrease the repeated distribution tree construction, and we get the best heuristic priority discrepancy interval by PQPST. According to the simulation results, the PQPST and PDHM can efficiently improve the performance of the PST algorithm.

• The KIPS Transactions:PartA
• /
• v.16A no.3
• /
• pp.189-198
• /
• 2009

The traditional interrupt-based protocol processing at end hosts has two priority-inversion problems. First, low-priority packets may interrupt and delay high-priority process executionssince interrupts have the highest priority in most operating systems. Second, low-priority packet may delay high priority packets when they arrive almost simultaneously since interrupt processing is performed in a FCFS (first come, first served) order. These problems can be solved by a priority-based protocol processing policy and implementation. However, general priority-based schemes commonly have the problem of starvation and cannot support the each network flow requiring the mutually exclusive QoS since the packets are processed in the FCFS order. Therefore, the priority-based schemes are not appropriate for different QoS-demanding applications. In this paper, we present a bottom-half-based approach that relies on priority- and budget-based processing. The proposed approach allows us to solve both the starvation and priority-inversion problems, and further enables effective QoS isolation between different network connections. This feature also enables bounding the protocol processing time at an end host. We finally show through experiments that the proposed approach achieves QoS isolation and control.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.3C
• /
• pp.224-232
• /
• 2012

Priority MAC is an important issue in every communication system when we consider differentiated service applications. In this paper, we propose a mechanism to support priority MAC based on multi-parameters for IEEE 802.15.7 visible light communication (VLC). By using three parameters such as number of backoff times (NB), backoff exponent (BE) and contention window (CW), we provide priority for multi-level differentiated service applications. We consider beacon-enabled VLC personal area network (VPAN) mode with slotted version for random access algorithm in this paper. Based on a discrete-time Markov chain, we analyze the performance of proposed mechanism under non-saturation environments. By building a Markov chain model for multi-parameters, this paper presents the throughput and transmission delay time for VLC system. Numerical results show that we can apply three parameters to control the priority for VLC MAC protocol.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.3
• /
• pp.509-516
• /
• 2018

TCP is a well-known communication protocol which is widely used for reliable message transmissions. The urgent mechanism of TCP plays a key role to transmit messages with a high priority. If a high priority message occurs at the transmitting node, the urgent mechanism informs the receiving node about the presence of a high priority message prior to its transmission so that the receiving node can be prepared for handling this message in advance. This implies that the existing urgent mechanism of TCP does not guarantee an immediate or faster delivery of the high priority message itself. Therefore, the ability of priority-based transmission is required on TCP not only to ensure reliable transmissions of normal messages but also to offer a differentiated service according to the priority of message. This paper presents a priority-based transmission algorithm over TCP using a priority queue in a multi-threaded environment. The effectiveness of the proposed algorithm is explored using an experimental setup in which various messages with different priority levels are transmitted.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.35-42
• /
• 2003

In this paper, we classified the wavelength reservation mechanisms of optical burst switching (OBS), and investigated the path length priority effect of the offset time/delayed reservation (OT/DR)-based scheme like the just-enough-time (JET) protocol. And, we showed that the fiber delay line (FDL)-based scheme can avoid the path length priority effect in multiple hop network environments. Also, we proposed a novel FDL/DR with hop-by-hop priority increasing (HPI) scheme which can improve the end-to-end throughput by increasing the priority of bursts hop-by-hop using the input FDLs at each node. The simulation results showed that the proposed FDL/DR with HPI scheme could avoid the path length priority effect and enhance the end-to-end throughput in multiple hop network environments.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.162-168
• /
• 2007

TCAM(Ternary content-addressable memory) has been widely used to perform fast routing lookup. It is able to accomplish the LPM(longest prefix matching) search in O(1) time without considering the number of prefixes and their lengths. As compared to software-based solutions, especially for IPv6, TCAM can oner sustained throughput and simple system architecture. However, There is no research for Priority-TCAM which can assign priority to each memory block. This paper addresses the difference or priority-TCAM compared to the existing TCAM and proposes CAO-PA algerian to manage the lookup table efficiently.

• ETRI Journal
• /
• v.28 no.3
• /
• pp.371-374
• /
• 2006

We propose and analyze a priority queuing scheme that gives priority in the same class of calls according to their total resource requirements (TRRs). The proposed scheme gives a higher priority to the calls that have a lower TRR over the calls that have a higher TRR. The numerical results show that the proposed priority queuing scheme provides better performance than the traditional queuing schemes in call blocking probability.

• Environmental Analysis Health and Toxicology
• /
• v.19 no.1
• /
• pp.81-91
• /
• 2004

Although it is suggested that risk -based management plan is needed to manage air pollution effectively, we have no resources enough to evaluate all aspects of substances and set priorities. So we need to develop a logical and easy risk-based priority setting method. However, it if impossible that only one generic system that is consistent with all the use is developed. In this study, we proposed a human health risk based priority-setting method for hazardous air pollutants, and ranked priorities for this method. First of all, after investigating previous chemical ranking and scoring systems, we chose appropriate indicators and logics to goal of this study and made a chemical priority ranking method using these. As results, final scores in priority ranking method were derived for 25 substances, and ethylene oxide, acrylonitrile and vinyl chloride were included in high ranks. In addition, same substances were highly ranked when using default values like when using no default, but the scores of hydrofluoric acid and ryan and compounds were sensitive to default values. This study could be important that priorities were set including toxicity type and quality and local inherent exposure conditions and we can set area-specific management guidelines and survey plans as a screening tool.