• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.3
• /
• pp.141-152
• /
• 2007

In this paper, we present a network-oriented lightweight real-time system, which is composed of an event-driven operating system called the Embedded Lightweight Operating System (ELOS) and a generic multi hop ad hoc routing protocol suite. In the ELOS, a conditional preemptive FCFS scheduling method with a guaranteed time slot is designed for efficient real-time processing. For more elaborate configurations, we reinforce fault tolerance by supplementing semi-auto configuration using wireless agent nodes. The developed hardware platform is also introduced, which is a scalable prototype constructed using off-the-shelf components. In addition, in order to evaluate the performance of the proposed system, we developed a ubiquitous network test-bed on which several experiments with respect to various environments are conducted. The results show that the ELOS is considerably favorable for tiny ubiquitous networked systems with real-time constraints.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2774-2796
• /
• 2015

Quality-of-service (QoS) provisioning for a cognitive mesh network (CMN) with heterogeneous services has become a challenging area of research in recent days. Considering both real-time (RT) and non-real-time (NRT) traffic in a multihop CMN, [1] studied cross-layer resource management, including joint access control, route selection, and resource allocation. Due to the complexity of the formulated resource allocation problems, which are mixed-integer non-linear programming, a low-complexity yet efficient algorithm was proposed there to approximately solve the formulated optimization problems. In contrast, in this work, we present an application of genetic algorithm (GA) to re-address the hard resource allocation problems studied in [1]. Novel initialization, selection, crossover, and mutation operations are designed such that solutions with enough randomness can be generated and converge with as less number of attempts as possible, thus improving the efficiency of the algorithm effectively. Simulation results show the effectiveness of the newly proposed GA-based algorithm. Furthermore, by comparing the performance of the newly proposed algorithm with the one proposed in [1], more insights have been obtained in terms of the tradeoff among QoS provisioning for RT traffic, throughput maximization for NRT traffic, and time complexity of an algorithm for resource allocation in a multihop network such as CMN.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.3
• /
• pp.775-791
• /
• 1997

This paper describes Real-Time Trasport Protocol(RTTP) that procisdes for a ; user cmnnection-oriented sercices with performance fuarantee.Assuming that eral-time network services will be provided,RTTP solves provlems at end-hosts.RTTP has defined a new set of primitives for real-time communication servies based on the analysis of uwer requirements on various applications.Introducing the notion of Abstract Network Layer independent of real networks.RTTP's implementation scheme can be applied to various netwoeks.The study also intriduces an inplemenation strategy, provide prdeictability of protocol processing time,wich should be known a priori for performance guarantee.Intermally,RTTP has a set of QoS translation rules that change a user'w performance requirements to the equivalent network QoS paramenters.RTTP also introuduces a new apportunistic error control mehtod that can trade-off between overhead and error corredtion according to a uwer's requirement on reliability.

• Journal of the Korea Convergence Society
• /
• v.13 no.4
• /
• pp.1-6
• /
• 2022

Real-time systems using web cralwing data must provide users with data from the same database as remote data. To do this, the web crawler repeatedly sends HTTP(HtypeText Transfer Protocol) requests to the remote server to see if the remote data has changed. This process causes network load on the crawling server and remote server, causing problems such as excessive traffic generation. To solve this problem, in this paper, based on user events, we propose a real-time web crawling technique that can reduce the overload of the network while securing the reliability of maintaining the sameness between the data of the crawling server and data from multiple remote locations. The proposed method performs a crawling process based on an event that requests unit data and list data. The results show that the proposed method can reduce the overhead of network traffic in existing web crawlers and secure data reliability. In the future, research on the convergence of event-based crawling and time-based crawling is required.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.535-544
• /
• 2003

Integrated services networks should guarantee end-to-end delay bounds for real-time applications to provide high quality services. A real-time scheduler is installed on all the output ports to provide such guaranteed service. However, scheduling algorithms studied so far have problems with either network utilization or scalability. Here, network utilization indicates how many real-time sessions can be admitted. In this paper, we propose service curve allocation schemes that result in both high network utilization and scalability in a service curve algorithm. In service curve algorithm, an adopted service curve allocation scheme determines both network utilization and scalability. Contrary to the common belief, we have proved that only a part of a service curve is used to compute deadlines, not the entire curve. From this fact, we propose service curve allocation schemes that result in a constant time for computing deadlines. We through a simulation study that our proposed schemes can achieve better network utilizations than Generalized processor Sharing (GPS) algorithms including the multirate algorithm. To our knowledge, the service curve algorithm adopting our schemes can achieve the widest network utilization among existing scheduling algorithms that have the same scalability.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.842-847
• /
• 2005

This paper proposes a novel real-time EMG pattern recognition for the control of a multifunction myoelectric hand from four channel EMG signals. To cope with the nonstationary signal property of the EMG, features are extracted by wavelet packet transform. For dimensionality reduction and nonlinear mapping of the features, we also propose a linear-nonlinear feature projection composed of PCA and SOFM. The dimensionality reduction by PCA simplifies the structure of the classifier, and reduces processing time for the pattern recognition. The nonlinear mapping by SOFM transforms the PCA-reduced features to a new feature space with high class separability. Finally a multilayer neural network is employed as the pattern classifier. We implement a real-time control system for a multifunction virtual hand. From experimental results, we show that all processes, including virtual hand control, are completed within 125 msec, and the proposed method is applicable to real-time myoelectric hand control without an operation time delay.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.3
• /
• pp.49-56
• /
• 2007

The IEEE 802.15.4 low rate wireless personal area network is a protocol suitable for wireless sensor networks. Thus there has been growing interest in the IEEE 802.15.4 protocol in the home automation networks. This paper proposes a scheduling scheme obtaining optimal parameters regarding the IEEE 802.15.4 frame and subframes in the home automation networks. Guaranteed time slots (GTS) are exploited for the delivery of real-time traffic. Given a set of the requirements for bandwidths and periods assigned to nodes in the network, the beacon interval and the active/inactive subframe duration satisfying the requirements are selected considering the low duty cycle by the proposed scheme. Based on these parameters, analytic results provide the way to efficient use of network resources including energy.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.732-732
• /
• 2006

• Journal of Communications and Networks
• /
• v.5 no.1
• /
• pp.73-81
• /
• 2003

The controlled load service defined within the IETF's Integrated Services architecture for quality-of-service (QoS) in the Internet requires source nodes to regulate their traffic while the network, in combination with an admission control strategy, provides a guarantee of performance equivalent to that achieved in a lightly loaded network. Packets sent in violation of the traffic contract are marked so that the network may assign them a lower priority in the use of bandwidth and buffer resources. In this paper, we define the requirements of a scheduler serving packets belonging to the controlled load service and present a novel scheduler that exactly achieves these requirements. In this set of requirements, besides efficiency and throughput, we include an additional important requirement to bound the additional delay of unmarked packets caused due to the transmission of marked packets while dropping as few marked packets as possible. Without such a bound, unmarked packets that are in compliance with the traffic contract are not likely to experience delays consistent with that in al lightly loaded network. For any given desired bound ${\alpha}$ on this additional delay, we present the CL(${\alpha}$) scheduler which achieves the bound while also achieving a per-packet work complexity of O(1) with respect to the number of flows. We provide an analytical proof of these properties of the CL(${\alpha}$) scheduler, and we also verify this with simulation using real traces of video traffic. The scheduler presented here may be readily adapted for use in scheduling flows with multi-level priorities such as in some real-time video streams, as well as in other emerging service models of the Internet that mark packets to identify drop precedences.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.13 no.6
• /
• pp.48-55
• /
• 2005

In this paper, a mathematical model and a simulation method for the response time analysis of Local Interconnect Network(LIN) based network systems are proposed. Network-induced delays in a network based control system can vary widely according to the transmission time of message and the overhead time of transmission. Therefore, in order to design a distributed control system using LIN network, a method to predict and verify the timing behavior of LIN protocol is required at the network design phase. Furthermore, a simulation environment based on a timing model of LIN protocol is beneficial to predict the timing behavior of LIN. The model equation is formulated with six timing parameters deduced from timing properties of LIN specification. Additionally, LIN conformance test equations to verify LIN device driver are derived with timing constraints of the parameters. The proposed model equation and simulation method are validated with a result that is measured at real LIN based network system.