• Title/Summary/Keyword: distributed task

Search Result 386, Processing Time 0.025 seconds

Soft Fault Detection Using an Improved Mechanism in Wireless Sensor Networks

  • Montazeri, Mojtaba;Kiani, Rasoul
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.10
    • /
    • pp.4774-4796
    • /
    • 2018
  • Wireless sensor networks are composed of a large number of inexpensive and tiny sensors used in different areas including military, industry, agriculture, space, and environment. Fault tolerance, which is considered a challenging task in these networks, is defined as the ability of the system to offer an appropriate level of functionality in the event of failures. The present study proposed an intelligent throughput descent and distributed energy-efficient mechanism in order to improve fault tolerance of the system against soft and permanent faults. This mechanism includes determining the intelligent neighborhood radius threshold, the intelligent neighborhood nodes number threshold, customizing the base paper algorithm for distributed systems, redefining the base paper scenarios for failure detection procedure to predict network behavior when running into soft and permanent faults, and some cases have been described for handling failure exception procedures. The experimental results from simulation indicate that the proposed mechanism was able to improve network throughput, fault detection accuracy, reliability, and network lifetime with respect to the base paper.

Optimal Period and Priority Assignment Using Task & Message-Based Scheduling in Distributed Control Systems (분산 제어 시스템에서의 태스크와 메시지 기반 스케줄링을 이용한 최적 주기와 우선순위 할당)

  • 김형육;이철민;박홍성
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.6
    • /
    • pp.506-513
    • /
    • 2002
  • Distributed control systems(DCS) using fieldbus such as CAN have been applied to process systems but it is very difficult to design the DCS while guaranteeing the given end-to-end constraints such as precedence constraints, time constraints, and periods and priorities of tasks and messages. This paper presents a scheduling method to guarantee the given end-to-end constraints. The presented scheduling method is the integrated one considering both tasks executed in each node and messages transmitted via the network and is designed to be applied to a general DCS that has multiple loops with several types of constraints, where each loop consists of sensor nodes with multiple sensors, actuator nodes with multiple actuators and controller nodes with multiple tasks. An assignment method of the optimal period of each loop and a heuristic assignment rule of each message's priority are proposed and the integrated scheduling method is developed based on them.

Compressed Sensing-based Multiple-target Tracking Algorithm for Ad Hoc Camera Sensor Networks

  • Lu, Xu;Cheng, Lianglun;Liu, Jun;Chen, Rongjun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.3
    • /
    • pp.1287-1300
    • /
    • 2018
  • Target-tracking algorithm based on ad hoc camera sensor networks (ACSNs) utilizes the distributed observation capability of nodes to achieve accurate target tracking. A compressed sensing-based multiple-target tracking algorithm (CSMTTA) for ACSNs is proposed in this work based on the study of camera node observation projection model and compressed sensing model. The proposed algorithm includes reconfiguration of observed signals and evaluation of target locations. It reconfigures observed signals by solving the convex optimization of L1-norm least and forecasts node group to evaluate a target location by the motion features of the target. Simulation results show that CSMTTA can recover the subtracted observation information accurately under the condition of sparse sampling to a high target-tracking accuracy and accomplish the distributed tracking task of multiple mobile targets.

Calculation of the Area of Vulnerability to Voltage Sags by using Impedance Building Algorithm (임피던스 행렬 구성법을 이용한 순간전압강하 취약지역의 계산)

  • Park, Jong-Il;Park, Chang-Hyun
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.26 no.1
    • /
    • pp.44-53
    • /
    • 2012
  • This paper presents a method to calculate the area of vulnerability by using the impedance building algorithm. The installation of DG (Distributed Generation) is one of the countermeasures against voltage sags in power systems. In order to estimate the effect of the DG, the voltage sag assessment should be performed based on the area of vulnerability and system fault statistics. To determine the area of vulnerability, system impedance matrix should be calculated. The calculation of the impedance matrix of large systems is time-consuming task. This paper addresses an effective scheme to calculate the area of vulnerability and system impedance matrix.

Client/server system construction and practical guidelines for the configuration of the client/server system (클라이언트/서버 구조에 기반한 시스템 구축과 시스템 구축시 고려사항)

  • 김유정
    • Journal of the military operations research society of Korea
    • /
    • v.22 no.1
    • /
    • pp.1-17
    • /
    • 1996
  • In this paper, a client/server architecture and design concerns deduced from a real system design are described. The MIS system carried on IDIS is the one to be described. The experience from the system design is listed up and analized also. It is common to see that a distributed computing environment has much more complex structure than a conventional centralized one. As a consequence, a distributed system design is a complex task. It is worth to note that there should be sufficient considerations which had not been though ever for a centralized system. The objectives of this paper is to list up these problems and the solutions from experiences on a real system construction.

  • PDF

Distributed and Weighted Clustering based on d-Hop Dominating Set for Vehicular Networks

  • Shi, Yan;Xu, Xiang;Lu, Changkai;Chen, Shanzhi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.4
    • /
    • pp.1661-1678
    • /
    • 2016
  • Clustering is one of the key technologies in vehicular networks. Constructing and maintaining stable clusters is a challenging task in high mobility environments. DWCM (Distributed and Weighted Clustering based on Mobility Metrics) is proposed in this paper based on the d-hop dominating set of the network. Each vehicle is assigned a priority that describes the cluster relationship. The cluster structure is determined according to the d-hop dominating set, where the vehicles in the d-hop dominating set act as the cluster head nodes. In addition, cluster maintenance handles the cluster structure changes caused by node mobility. The rationality of the proposed algorithm is proven. Simulation results in the NS-2 and VanetMobiSim integrated environment demonstrate the performance advantages.

End-to-End Scheduling Method Considering 3-type RT-Data in Distributed Control Systems (분산 제어시스템에서 3가지 형태의 실시간 데이터를 고려하는 양극단 스케줄링 방법)

  • Kim, Hyoung-Yuk;Park, Hong-Seong
    • Proceedings of the KIEE Conference
    • /
    • 2003.11b
    • /
    • pp.311-314
    • /
    • 2003
  • In recent years, distributed control systems(DCS) using fieldbus such as CAN have been applied to process systems but it is very difficult to design the DCS while guaranteeing the given end-to-end constraints such as precedence constraints, time constraints, and periods and priorities of tasks and messages. This paper presents a scheduling method to guarantee the given end-to-end constraints considering aperiodic, periodic and non-real-time message and task simultaneously. The presented scheduling method is the integrated one considering both tasks executed in each node and messages transmitted via the network and is designed to be applied to a general DCS that has multiple loops with several types of constraints, where each loop consists of sensor nodes with multiple sensors, actuator nodes with multiple actuators and controller nodes with multiple tasks.

  • PDF

Cost-Aware Dynamic Resource Allocation in Distributed Computing Infrastructures

  • Ricciardi, Gianni M.;Hwang, Soon-Wook
    • International Journal of Contents
    • /
    • v.7 no.2
    • /
    • pp.1-5
    • /
    • 2011
  • Allocation of computing resources is a crucial issue when dealing with a huge number of tasks to be completed according to a given deadline and cost constraints. The task scheduling to several resources (e.g. grid, cloud or a supercomputer) with different characteristics is not trivial, especially if a trade-off in terms of time and cost is considered. We propose an allocation approach able to fulfill the given requirements about time and cost through the use of optimizing techniques and an adaptive behavior. Simulated productions of tasks have been run in order to evaluate the characteristics of the proposed approach.

Development of Intelligent Control Module with ANSI/EIA 709.1 for Water Treatment Facility

  • Hong, Won-Pyo
    • Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
    • /
    • 2003.11a
    • /
    • pp.243-249
    • /
    • 2003
  • With distribution industrial control system, the use of tow cost to achieve a highly reliable and safe system in real time distributed embedded application is proposed. This developed intelligent node is based on two microcontrollers, one for the execution of the application code, also as master controller for ensuring the real time control & the logic operation with PLD and other for communication task and the easy control execution, i.e., I/O digital input, digital output and interrupting. This paper also presents where the case NCS(Networked control system) with LonTalk protocol is applied for the filtration process control system of a small water treatment plant.

  • PDF

The Design and Implementation of the ParaC Language (ParaC 언어의 설계 및 구현)

  • Lee, Kyoung-Seok;Woo, Young-Choon;Kim, Jin-Mee;Chi, Dong-Hae
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.11
    • /
    • pp.2903-2913
    • /
    • 1997
  • This paper describes the design and implementation of the ParaC language that supports parallel programming on the shared memory and distributed memory parallel machine. The ParaC language is designed for the effective use of system resources of scalable parallel systems. The goal is achieved by adding parallel and synchronization constructs for shared address spaces, and remote task constructs for distributed address spaces. This paper also shows the translation method, and we implement the translator and the run-time library for parallel execution of extended constructs.

  • PDF