• Journal of Korea Society of Industrial Information Systems
• /
• v.4 no.1
• /
• pp.1-6
• /
• 1999

This paper is on the analysis for the real-time software requirement. This method can be used for TNPN(Timed Numerical Peri Net) as a easy communication means with real-users. It is based on the RTTL(Real Time Temporal Logic) for correctness the system. TNPN is used to represent a behavior specification language, the validity of specified behaviors in TNPN is expressed in RTTL, and analyzed through the teachability graph. Thus, the requirement between user and system is satisfied Using the example of shared track, the validity of the property of real-time(safetiness, responsiveness, liveness, priority) is verified. Also this framework if given to connection with a object, natually.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1998.10a
• /
• pp.655-662
• /
• 1998

This paper is on the anlaysis for real-time software requirement . This method can be used for TNPIN(Timed Numerical Petri Net) as a easy communication means with a real-users. It is based on the RTTL(Real Time Temporal Logic) for correctness fo the system. TNPN is used to represent a behavior specification language, the validity of specified behaviors in TNPN is expressed in RTTL , and analyzed through the reachability graph. Thus , the requirement of between user and system is satisfied. By the example of shared track, the validity of the property of real-time (safetiness, responsiveness, liveness, priority) is verified. Also, this framework is give to connection with a object natually.

• Journal of information and communication convergence engineering
• /
• v.10 no.1
• /
• pp.21-26
• /
• 2012

As the new requirements for wireless sensor networks are emerging, real-time communications is becoming a major research challenge because resource-constrained sensor nodes are not powerful enough to accommodate the complexity of the protocol. In addition, an efficient energy management scheme has naturally been a concern in wireless sensor networks for a long time. However, the existing schemes are limited to meeting one of these two requirements. To address the two factors together, we propose real-time communications with two approaches, a protocol for satisfied conditions and one for unsatisfied. Under the satisfied requirement, existing real-time protocol is employed. On the other hand, for the unsatisfied requirement, the newly developed scheme replaces the existing scheme by adjusting the transmission range of some surplus nodes. By expanding the transmission range, the end-to-end delay is shortened because the number of intermediate nodes decreases. These nodes conserve their energy for real-time communications by avoiding other activities such as sensing, forwarding, and computing. Finally, simulation results are given to demonstrate the feasibility of the proposed scheme in high traffic environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.1
• /
• pp.201-220
• /
• 2020

Trackers, especially long-term (LT) trackers, now have a more complex structure and more intensive computation for nowadays' endless pursuit of high accuracy and robustness. However, computing efficiency of LT trackers cannot meet the real-time requirement in various real application scenarios. Considering heterogeneous CPU-GPU platforms have been more popular than ever, it is a challenge to exploit the computing capacity of heterogeneous platform to improve the efficiency of LT trackers for real-time requirement. This paper focuses on TLD, which is the first LT tracking framework, and proposes an efficient parallel implementation based on OpenCL. In this paper, we firstly make an analysis of the TLD tracker and then optimize the computing intensive kernels, including Fern Feature Extraction, Fern Classification, NCC Calculation, Overlaps Calculation, Positive and Negative Samples Extraction. Experimental results demonstrate that our efficient parallel TLD tracker outperforms the original TLD, achieving the 3.92 speedup on CPU and GPU. Moreover, the parallel TLD tracker can run 52.9 frames per second and meet the real-time requirement.

• Journal of information and communication convergence engineering
• /
• v.9 no.6
• /
• pp.775-779
• /
• 2011

As the technology of multimedia sensor networks is desired in large numbers of applications nowadays, real-time service becomes one of the most important research challenges. Even though lots of related works have been conducted to meet this requirement in several ways, the specific traffic model for real-time has not been taken yet. Thus, it causes lack of adaptability of those approaches in real deployment. To solve this problem, in this paper, we model the application via (m,k)-firm streams which have weakly hard real-time property. And then, a novel forwarding scheme based on modified DBP (Distance-Based Priority) is proposed by considering local-DBP and stream DBP together. Local-DBP can contribute to identify the detailed causes of unsatisfied quality, that is, network congestion or wireless link failure. Simulation results reveal that (m,k)-firm is a good traffic model for multimedia sensor networks and the proposed scheme can contribute to guarantee real-time requirement well.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.8
• /
• pp.1567-1576
• /
• 2015

This paper proposes a reliable real-time data dissemination protocol for mitigating transmission failure of real-time data in WSNs. The re-transmission is well-known for recovery of transmission failure, but this may violate the real-time requirement by transmission delay. To solve this problem, the proposed protocol exploits broadcasting nature and temporal opportunity allocation. In a radio-range of sending node, there may be neighbors satisfying the real-time requirement. The neighbors of specific node could receive data simultaneously by broadcasting, and decide their priority using temporal opportunity allocation method. The method uses time slot and tolerable time. The time slot specifies the priority and transmission deadline for each neighbors, and the tolerable time is the real-time requirement at the sending node. By giving the priority to the node with shorter tolerable time in each slot, we may get more opportunities to forward toward the destination. In other words, even if a node have the longer tolerable time, it still has a chance to forward with the real-time requirement. Simulation results show that the proposed protocol is superior to the existing protocols.

• Journal of information and communication convergence engineering
• /
• v.14 no.2
• /
• pp.84-88
• /
• 2016

As good example of potential application-specific requirement, (m,k)-firm real-time streams have been recently introduced to deliver multimedia data efficiently in wireless sensor networks. In addition to stream model, communication protocols to meet specific (m,k)-firm real-time streams have been newly developed or extended from existing protocols. However, since the existing schemes for an (m,k)-firm stream have been proposed under typical flat architecture, the scalability problem remains unsolved when the number of real-time flows increases in the networks. To solve this problem, in this paper, we propose a new clustering scheme for an (m,k)-firm stream. The two different clustering algorithms are performed according to either the (m,k)-firm requirement or the deadline. Simulation results are presented to demonstrate the suitability of the proposed scheme under hierarchical architecture by showing that its performance is acceptable irrespective of the increase in the number of flows.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.160-162
• /
• 2007

The systems for assisted living and convenience of user real-time requirement in data communication among devices. therefore, it system was requirement to implementation of the hardware which guarantees the real-time to load the high-performance processor with suitable Operation System. This paper apply to operated intelligence robot in USN(Ubiquitous Sensor Network) environment, particularly, it is architecture research for guarantees the real-time of a sink-node that collect various sensor information from sensors and sending to main control unit.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.1
• /
• pp.88-95
• /
• 2004

The previous disk scheduling schemes for best-effort applications do not guarantee the real-time requirement of multimedia objects and the real-time disk scheduling schemes do not satisfy throughput of multimedia server. So, this paper propose a two-step disk scheduling scheme to satisfy the requirement of best-effort as well as soft real-time applications. This scheme is based on the round robin algorithm that imposes different weights on the best-effort task and the real-time one. The experiment results on the Linux kernel have shown that both best-effort tasks and real-time tasks could get fair service.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.1
• /
• pp.71-79
• /
• 2014

This paper discusses a method for the determination of frequency control reserve requirement with consideration of the interaction between ex-ante planning and real-time balancing. In proposed method, we consider the fact that the delivered energy for tertiary control reserve is determined based on required capacity for secondary control reserve and the expected amount of load errors. Uncertain load errors are derived by Brownian motion, an optimization method is suggested using a stochastic programming. In a short, we propose an interactive dependent method for determining secondary control reserve requirement based on the principle that it satisfies to minimize the total cost. As a result, this paper provides will analyze for an example model to demonstrate the capabilities of the method.