• Title/Summary/Keyword: real-time mechanism

Search Result 1,052, Processing Time 0.262 seconds

Improved Real-time Transmission Scheme using Temporal Gain in Wireless Sensor Networks (무선 센서 망에서 시간적 이득을 활용한 향상된 실시간 전송 방안)

  • Yang, Taehun;Cho, Hyunchong;Kim, Sangdae;Kim, Cheonyong;Kim, Sang-Ha
    • Journal of KIISE
    • /
    • v.44 no.10
    • /
    • pp.1062-1070
    • /
    • 2017
  • Real-time transmission studies in wireless sensor networks propose a mechanism that exploits a node that has a higher delivery speed than the desired delivery speed in order to satisfy real-time requirement. The desired delivery speed cannot guarantee real-time transmission in a congested area in which none of the nodes satisfy the requirement in one hop because the desired delivery speed is fixed until the packet reaches the sink. The feature of this mechanism means that the packet delivery speed increases more than the desired delivery speed as the packet approaches closer to the sink node. That is, the packet can reach the sink node earlier than the desired time. This paper proposes an improved real-time transmission by controlling the delivery speed using the temporal gain which occurs on the packet delivery process. Using the received data from a previous node, a sending node calculates the speed to select the next delivery node. The node then sends a packet to a node that has a higher delivery speed than the recalculated speed. Simulation results show that the proposed mechanism in terms of the real-time transmission success ratio is superior to the existing mechanisms.

An Extended AND-OR Graph-based Simulation and Electronic Commerce

  • Lee, Kun-Chang;Cho, Hyung-Rae
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1999.04a
    • /
    • pp.242-250
    • /
    • 1999
  • The objective of this paper is to propose an Extended AND-OR Graph (EAOG)-driven inferential simulation mechanism with which decision makers engaged in electronic commerce (EC) can effectively deal with complicated decision making problem. In the field of traditional expect systems research, AND-OR Graph approach cannot be effectively used in the EC problems in which real-time problem-solving property should be highly required. In this sense, we propose the EAOG inference mechanism for EC problem-solving in which heurisric knowledge necessary for intelligent EC problem-solving can be represented in a form of matrix. The EAOG method possesses the following three characteristics. 1. Realtime inference: The EAOG inference mechanism is suitable for the real-time inference because its computational mechanism is based on matrix computation.2. Matrix operation: All the subjective knowledge is delineated in a matrix form, so that inference process can proceed based on the matrix operation which is computationally efficient.3. Bi-directional inference: Traditional inference method of expert systems is based on either forward chaining or based on either and computational efficiency. However, the proposed EAOG inference mechanism is generically bi-directional without loss of both speed and efficiency.We have proved the validity of our approach with several propositions and an illustrative EC example.

  • PDF

Development of Delay Compensator for Network Based Real-time Control Systems (네트워크 기반 실시간 제어 시스템을 위한 지연 보상기 개발)

  • Kim, Seung-Yong;Kim, Hong-Ryeol;Kim, Dae-Won
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.82-85
    • /
    • 2004
  • This paper proposes the development of delay compensator to minimize performance degradation caused by time delays in network-based real-time control systems. The delay compensator uses the time-stamp method as a direct delay measuring method to measure time delays generated between network nodes. The delay compensator predicts the network time delays of next period in the views point of time delays and minimizes performance degradation from network through considering predicted time delays. Control output considering network time delays is generated by the defuzzification of probable time delays of next period. The time delays considered in the delay compensator are modeled by using a timed Petri net model. The proposed delay prediction mechanism for the delay compensator is evaluated through some simulation tests by measuring deviation of the predicted delays from simulated delays.

  • PDF

Method for Reduction of Power Consumption using Buffer Processing Time Control in Home Gateway (홈 게이트웨이에서 서비스 특성에 따른 버퍼 동작 시간 제어를 통한 전력 소비 감소 방안)

  • Yang, Hyeon;Yu, Gil-Sang;Kim, Yong-Woon;Choi, Seong-Gon
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.8
    • /
    • pp.69-76
    • /
    • 2012
  • This paper proposes an efficient power consumption scheme using sleep mode in home gateway. The scheme by this paper classifies incoming real time packet and non-real time packet in home gateway and delay non-real time packet. Therefore, the home gateway can have longer sleep time because non-real time packet can get additional delay time by proposing mechanism using timer. We use non-preemptive two priority queueing model for performance analysis. As a results, we verify that power consumption of proposed scheme is reduced more than existing scheme by delay of non-real time traffic.

Quick Semi-Buddy Scheme for Dynamic Storage Allocation in Real-Time Systems (실시간 시스템에서의 동적 스토리지 할당을 위한 빠른 수정 이진 버디 기법)

  • 이영재;추현승;윤희용
    • Journal of the Korea Society for Simulation
    • /
    • v.11 no.3
    • /
    • pp.23-34
    • /
    • 2002
  • Dynamic storage allocation (DSA) is a field fairly well studied for a long time as a basic problem of system software area. Due to memory fragmentation problem of DSA and its unpredictable worst case execution time, real-time system designers have believed that DSA may not be promising for real-time application service. Recently, the need for an efficient DSA algorithm is widely discussed and the algorithm is considered to be very important in the real-time system. This paper proposes an efficient DSA algorithm called QSB (quick semi-buddy) which is designed to be suitable for real-time environment. QSB scheme effectively maintains free lists based on quick-fit approach to quickly accommodate small and frequent memory requests, and the other free lists devised with adaptation upon a typical binary buddy mechanism for bigger requests in harmony for the .improved performance. Comprehensive simulation results show that the proposed scheme outperforms QHF which is known to be effective in terms of memory fragmentation up to about 16%. Furthermore, the memory allocation failure ratio is significantly decreased and the worst case execution time is predictable.

  • PDF

A Study on the Design and Validation of Switching Control Law (전환제어법칙 설계 및 검증에 관한 연구)

  • Kim, Chong-Sup
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.1
    • /
    • pp.54-60
    • /
    • 2011
  • The flight control law designed for prototype aircraft often leads to degraded stability and performance, although developed control law verify by non-real time simulation and pilot based evaluations. Therefore, the proper evaluation methods should be applied such that flight control law designed can be verified in real flight environment. The one proposed in this paper is IFS (In-Flight Simulator). Currently, this system has been implemented into the F-18 HARV (High Angle of Attack Research Vehicle), SU-27 and F-16 VISTA (Variable stability In flight Simulation Test Aircraft) programs. The IFS necessary switching control law such as fader logic and integrator stand-by mode to reduce abrupt transient and minimize the integrator effect for each flight control laws switching. This paper addresses the concept of switching mechanism with fader logic of "TFS (Transient Free Switch)" and stand-by mode of "feedback type" based on SSWM (Software Switching Mechanism). And the result of real-time pilot evaluation reveals that the aircraft is stable for inter-conversion of flight control laws and transient response is minimized.

Software Design of Packet Analyzer based on Byte-Filtered Packet Inspection Mechanism for UW-ASN

  • Muminov, Sardorbek;Yun, Nam-Yeol;Park, Soo-Hyun
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.12
    • /
    • pp.1572-1582
    • /
    • 2011
  • The rapid growth of UnderWater Acoustic Sensor Networks (UW-ASNs) has led researchers to enhance underwater MAC protocols against limitations existing in underwater environment. We propose the customized robust real-time packet inspection mechanism with addressing the problem of the search for the data packet loss and network performance quality analysis in UW-ASNs, and describe our experiences using this approach. The goal of this work is to provide a framework to assess the network real-time performance quality. We propose a customized and adaptive mechanism to detect, monitor and analyze the data packets according to the MAC protocol standards in UW-ASNs. The packet analyzing method and software we propose is easy to implement, maintain, update and enhance. We take input stream as real data packets from sniffer node in capture mode and perform fully analysis. We were interested in developing software and hardware designed tool with the same capabilities which almost all terrestrial network packet sniffers have. Experimental results confirm that the best way to achieve maximum performance requires the most adaptive algorithm. In this paper, we present and offer the proposed packet analyzer, which can be effectively used for implementing underwater MAC protocols.

A Real-Time Scheduling Mechanism in Multiprocessor System for Supporting Multimedia (멀티미디어 지원을 위한 다중 프로세서 시스템에서 실시간 스케줄링 기법)

  • 임순영;이재완;전칠환
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.1 no.2
    • /
    • pp.159-168
    • /
    • 1997
  • This paper presents a mechanism which supplies tasks with fast turn-around time on real-time multimedia environments. Tasks are classified into periodic and aperiodic tasks according to their executing period, and the types of them are classified into three groups : critical tasks, essential tasks and common tasks by the degree of its urgency. In the case of periodic tasks, we defer the execution of it within the extent to keep the deadline as long as possible and serve the aperiodic tasks, and provide aperiodic tasks with fast turn-around time. Changing the priority of each task is allowed within the same type and it is scheduled by using the dynamic priority. The emergency tasks are executed within deadline in any circumstances, and the least laxity one is served first when many real-time tasks are waiting for execution. The result of simulation shows that the proposed mechanism is better than the EDZL, known as suboptimal in multiprocessor systems, in the point of rum-around time.

  • PDF

Detecting Complex 3D Human Motions with Body Model Low-Rank Representation for Real-Time Smart Activity Monitoring System

  • Jalal, Ahmad;Kamal, Shaharyar;Kim, Dong-Seong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.3
    • /
    • pp.1189-1204
    • /
    • 2018
  • Detecting and capturing 3D human structures from the intensity-based image sequences is an inherently arguable problem, which attracted attention of several researchers especially in real-time activity recognition (Real-AR). These Real-AR systems have been significantly enhanced by using depth intensity sensors that gives maximum information, in spite of the fact that conventional Real-AR systems are using RGB video sensors. This study proposed a depth-based routine-logging Real-AR system to identify the daily human activity routines and to make these surroundings an intelligent living space. Our real-time routine-logging Real-AR system is categorized into two categories. The data collection with the use of a depth camera, feature extraction based on joint information and training/recognition of each activity. In-addition, the recognition mechanism locates, and pinpoints the learned activities and induces routine-logs. The evaluation applied on the depth datasets (self-annotated and MSRAction3D datasets) demonstrated that proposed system can achieve better recognition rates and robust as compare to state-of-the-art methods. Our Real-AR should be feasibly accessible and permanently used in behavior monitoring applications, humanoid-robot systems and e-medical therapy systems.

Adaptive Multimedia Synchronization Using Waiting Time (대기시간을 이용한 적응형 멀티미디어 동기화 기법)

  • Lee, Gi-Seong;Lee, Geun-Wang;Lee, Jong-Chan;O, Hae-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.2S
    • /
    • pp.649-655
    • /
    • 2000
  • Real-time application programs have constraints which need to be met between media-data. These constraints represents the delay time ad quality of service between media-data to be presented. In order to efficiently describe the delay time and quality of service, a new synchronization mechanism is needed. Proposed paper is a dynamic synchronization that minimized the effects of adaptive transmission delay time. That is, the method meets the requirements of synchronization between media-dat by handling dynamically the adaptive waiting time resulted from variations of delay time. In addition, the mechanism has interval adjustment using maximum delay jitter time. This paper decreases the data loss resulted from variation of delay time and from loss time of media-data by means of applying delay jitter in order to deal with synchronization interval adjustment. Plus, the mechanism adaptively manages the waiting time of smoothing buffer, which leads to minimize the gap from the variation of delay time. The proposed paper is suitable to the system which requires the guarantee of high quality of service and mechanism improves quality of services such as decrease of loss rate, increase of playout rate.

  • PDF