• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.11
• /
• pp.1058-1064
• /
• 2004

This paper presents a distributed precedence queue mechanism to resolve unexpected transmission delay of a lower priority transaction in a CAN based system, which keeps a fixed priority in data transaction. The mechanism is implemented in the upper sub-layer of the data link layer(DLL), which is fully compatible with the original medium access control layer protocol of CAN. Thus the mechanism can be implemented dynamically while the data transactions are going on without any hardware modification. The CAN protocol was originally developed to be used in the automotive industry, and it was recently applied for a broader class of automated factories. Even though CAN is able to satisfy most of real-time requirements found in automated environments, it is not to enforce either a fair subdivision of the network bandwidth among the stations or a satisfactory distribution of the access delays in message transmission. The proposed solution provides a superset of the CAN logical link layer control, which can coexist with the older CAN applications. Through the real experiments, effectiveness of the proposed mechanism is verified.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.57-60
• /
• 2005

In this paper, a dynamic priority-based QoS (DPQoS) provision scheme is proposed for the required QoS from one end of the network to the other in wireless mobile networks. The DPQoS model is used to meet diversity multimedia traffic requirements. This model is come up with a framework for the wireless network of which consists of a core-IP network and also a number of wireless access networks. For the true end-to-end QoS, it is required that the core network is able to support the required QoS for the wireless users. This paper shows a solution to optimize the performance for different traffic classes according to the traffic characteristics. The performance of the proposed scheme is evaluated at delay aspects such as delay and throughput.

• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• pp.633-636
• /
• 1998

The next generation of wireless communication seems to be multimedia communications based on ATM and requires the efficient MAC(Medium Access Control) protocol to support multimedia traffic with the various characteristics of QoS(Quality of Service). A Proposed D-PRMA++ MAC protocol is operated dynamically by the retransmission probability and the number of reservation channel on the side of MS(Mobile Station) Also, On the side of BS(Base Station) it analyzes the parameters receive d from all MS and allocates the slots by priority in order to guarantee QoS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9B
• /
• pp.1305-1313
• /
• 2010

Last few years, wireless personal area network (WPAN) has been widely researched for various healthcare applications. Due to restriction of device hardware (e.g., energy and memory), we need to design a highly-versatile MAC layer protocol for WBAN (Wireless Body Area Network). In addition, when an emergency occurs to a patient, a priority mechanism is necessitated for a urgent message to get through to the final destination. This paper presents a priority mechanism referred to as hybrid priority MAC for WBAN. Through extensive simulation, we show the proposed MAC protocol can minimize the average packet latency for urgent data. Thus, when patients have an emergency situation, our MAC allows adequate assistance time and medical treatment for patients. The simulation based on NS-2 shows that our Hybrid Priority MAC has the good performance and usability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2587-2600
• /
• 2012

It has been demonstrated that choosing an appropriate relay node can improve the transmission rate for the system. However, such system improvement brought by the relay selection may be degraded with the presence of the malicious relay nodes, which are selected but refuse to cooperate for transmissions deliberately. In this paper, we formulate the relay selection issue as a restless bandit problem with the objective to maximize the average rate, while considering the credibility of each relay node, which may be different at each time instant. Then the optimization problem is solved by using the priority-index heuristic method effectively. Furthermore, a low complexity algorithm is offered in order to facilitate the practical implementations. Simulation results are conducted to demonstrate the effectiveness of the proposed trust-based relay selection scheme.

• Journal of information and communication convergence engineering
• /
• v.3 no.1
• /
• pp.56-61
• /
• 2005

In this paper, we present a video rate control scheme for storage and delivery in which the time-varying viewing interests are controlled by human gaze. To track the gaze, the pupil's movement is detected using the three-step process : detecting face region, eye region, and pupil point. To control bit rates, the quantization parameter (QP) is changed by considering the static parameters, the video object priority derived from the pupil tracking, the target PSNR, and the weighted distortion value of the coder. As results, we achieved human interfaced visual model and corresponding region-of-interest rate control system.

• The Journal of Korea Robotics Society
• /
• v.17 no.1
• /
• pp.16-24
• /
• 2022

This paper presents a method that can reduce the computational cost of the hierarchical quadratic programming (HQP)-based robot controller. Hierarchical controllers can effectively manage articulated robots with many degrees of freedom (DoFs) to perform multiple tasks. The HQP-based controller is one of the generic hierarchical controllers that can provide a control solution guaranteeing strict task priority while handling numerous equality and inequality constraints. However, according to a large amount of computation, it can be a burden to use it for real-time control. Therefore, for practical use of the HQP, we propose a method to reduce the computational cost by decreasing the size of the decision variable. The computation time and control performance of the proposed method are evaluated by real robot experiments with a 15 DoFs dual-arm manipulator.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12A
• /
• pp.1367-1374
• /
• 2004

Efforts for standardization of medium access control (MAC) protocol in IEEE802.11e have been made to support quality of service (QoS) in IEEE802.11 MAC protocol. Enhanced distributed coordination function (EDCF) of 802.11e MAC protocol is modified to support QoS for packets that have differentiated priority. However, EDCF still has e problem of throughput optimization and priority support. Therefore, we have proposed a scheme called adaptive EDCF for both supporting priority of packets and throughput optimization. We have derived the relation between the number of nodes and contention window size for throughput optimization. Based on the analytic results, we have evaluated the performance of the proposed scheme using OPNET simulations. The simulation results show that using the proposed scheme can Improve the overall throughput regardless of the number of nodes and the decrement of the throughput with increasing the number of nodes can be alleviated. Additionally, we have shown that the adaptive EDCF can support priority of packets more effectively than existing EDCF.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1A
• /
• pp.62-69
• /
• 2005

Efforts for standardization of medium access control (MAC) protocol in IEEE802.11e have been made to support quality of service (QoS) in IEEE802.11e MAC protocol. Enhanced disoibuted coordination function (EDCF) of 802.11e MAC protocol is modified to support QoS for packets that have differentiated priority. However, EDCF still has the problem of throughput optimization and priority support. Therefore, we have proposed a scheme called adaptive EDCF for both supporting priority of packets and throughput optimization. We have derived the relation between the number of nodes and contention window size for throughput optimization. Based on the analytic results, we have evaluated the performance of the proposed scheme using OPNET simulations. The simulation results show that using the proposed scheme can improve the overall throughput regardless of the number of nodes and the decrement of the throughput with increasing the number of nodes can be alleviated. Additionally, we have shown that the adaptive EDCF can support priority of packets more effectively than existing EDCF.

• The KIPS Transactions:PartA
• /
• v.10A no.5
• /
• pp.487-492
• /
• 2003

To satisfy the requirements for QoS of Users using multimedia content stream service, it is required to control mechanism for QoS based on class priority, URFA classifies the user by two classes (super class, base class) and controls the admission ratio of user's requests by user's class information. URFA increases the admission ratio class and utilization ratio of stream server resources.