• Title/Summary/Keyword: CAN network

Search Result 19,494, Processing Time 0.046 seconds

Network Type Distributed Control of a System with Inner Loop Control Structure (내부 궤환 제어 구조를 갖는 시스템의 네트워크형 분산 제어)

  • Choi, Goon-Ho
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.28 no.2
    • /
    • pp.100-108
    • /
    • 2014
  • In this paper, an idea of a network type distributed control of a system with inner loop control structure will be considered. Generally, in case of a control system with inner loop control structure, it is not easy to implement circuits and programming. Using network type distributed control structure, it will show how it is better than before. CAN(Controller Area Network) protocol which has been known that it has a high reliability on the signal in the various network protocols is used. Also, Arago's Disk System which has a inner loop control stucture is made to validate effectiveness of the proposed method.

Development of Operation Network System and Processor in the Loop Simulation for Swarm Flight of Small UAVs (소형 무인기들의 군집비행을 위한 운영 네트워크 시스템과 PILS 개발)

  • Kim, Sung-Hwan;Cho, Sang-Ook;Cho, Seong-Beom;Park, Choon-Bae
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.5
    • /
    • pp.433-438
    • /
    • 2012
  • In this paper, a operation network system equipped with onboard wireless communication systems and ground-based mission control systems is proposed for swarm flight of small UAVs. This operating system can be divided into two networks, UAV communication network and ground control system. The UAV communication network is intend to exchange the informations of navigation, mission and flight status with minimum time delay. The ground control system consisted of mission control systems and UDP network. Proposed operation network system can make a swarm flight of various UAVs, execute complex missions decentralizing mission to several UAVs and cooperte several missions. Finally, PILS environments are developed based on the total operating system.

A Boolean Algebra Method for Calculation of Network Reliability (부울대수산법에 의한 회로망신뢰도의 계산법)

  • 고경식;오영환
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.13 no.6
    • /
    • pp.20-23
    • /
    • 1976
  • A boolean algebra method for computing the reliability in a communication network is prosented. Given the set of all simple paths between two nodes in a network, the terminal reliability can be symbolically computed by the Boolean operation which is named parallel operation. The method seems to be promising for both oriented and nonoriented network.

  • PDF

A Cost-Effective Dynamic Redundant Bitonic Sorting Network for ATM Switching (ATM 교환을 위한 비용 효율적인 동적 결함내성 bitonic sorting network)

  • Lee, Jae-Dong;Kim, Jae-Hong;Choe, Hong-In
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.4
    • /
    • pp.1073-1081
    • /
    • 2000
  • This paper proposes a new fault-tolerant technique for bitonic sorting networks which can be used for designing ATM switches based on Batcher-Banyan network. The main goal in this paper is to design a cost-effective fault-tolerant bitonic sorting network. In order to recover a fault, additional comparison elements and additional links are used. A Dynamic Redundant Bitonic Sorting (DRBS) network is based on the Dynamic Redundant network and can be constructed with several different variations. The proposed fault-tolerant sorting network offers high fault-tolerance; low time delays; maintenance of cell sequence; simple routing; and regularity and modularity.

  • PDF

Energy Efficient IDS Node Distribution Algorithm using Minimum Spanning Tree in MANETs

  • Ha, Sung Chul;Kim, Hyun Woo
    • Smart Media Journal
    • /
    • v.5 no.4
    • /
    • pp.41-48
    • /
    • 2016
  • In mobile ad hoc networks(MANETs), all the nodes in a network have limited resources. Therefore, communication topology which has long lifetime is suitable for nodes in MANETs. And MANETs are exposed to various threats because of a new node which can join the network at any time. There are various researches on security problems in MANETs and many researches have tried to make efficient schemes for reducing network power consumption. Power consumption is necessary to secure networks, however too much power consumption can be critical to network lifetime. This paper focuses on energy efficient monitoring node distribution for enhancing network lifetime in MANETs. Since MANETs cannot use centralized infrastructure such as security systems of wired networks, we propose an efficient IDS node distribution scheme using minimum spanning tree (MST) method to cover all the nodes in a network and enhance the network lifetime. Simulation results show that the proposed algorithm has better performance in comparison with the existing algorithms.

Implementation and Verification of FlexRay Network System using Matlab/Simulink (매틀랩/시뮬링크 기반 플렉스레이 네트워크 시스템의 구현 및 검증)

  • Yoon, Seung-Hyun;Seo, Suk-Hyun;Hwang, Sung-Ho;Kwon, Key-Ho;Jeon, Jae-Wook
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.7
    • /
    • pp.655-660
    • /
    • 2010
  • As increasing the number of Electronic Control Units in a vehicle, the proportion for reliability and stability of the software is going increasingly. Accordingly, the traditional CAN network has occurred the situation that the requirement of developing vehicle software is not sufficient. To solve these problems, the FlexRay network which is ensured the high bandwidth and real-time is generated. However it is difficult to implement FlexRay based application software because of complex protocol than traditional CAN network. Accordingly the system for analysis and verification of network state is needed. Also vehicle vendor develops application software using Matlab/Simulink in order to increase productivity. But this development method is hard to solve the network problem of node to node. Therefore this paper implements Matlab/Simulink based FlexRay network system and verifies it through comparing with existing embedded system.

Determining the Most Vital Arcs in the Weighted Network of GIS (GIS의 가중네트워크에서 MVA를 결정하는 방법)

  • 정호연
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.21 no.45
    • /
    • pp.181-191
    • /
    • 1998
  • The purpose of this paper is to develop an efficient algorithm for determining the most vital arcs in a weighted network and implement its algorithm on GIS. The most vital arcs in a weighted network of GIS is that arc whose removal from the network results in the greatest increase in shortest distance between two specified nodes. These studies are well applied to a situation where a logistics or communications network is broken by unexpected accidents. Because a user of the system wants to know which arcs are most vital to him so that he can reinforce them against unexpected accidents. We first present an algorithm to find the most vital arcs in a weighted network, then show that how its algorithm can be applied to a geo-spatial network.

  • PDF

Energy-Aware Node Selection Scheme for Code Update Protocol (코드 업데이트 프로토콜에서 에너지 잔존량에 따른 노드선정 기법)

  • Lee, Seung-Il;Hong, Won-Kee
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.5 no.1
    • /
    • pp.39-45
    • /
    • 2010
  • As wireless sensor network are being deployed in a wide variety of application areas, the number of sensor nodes in a sensor filed becomes larger and larger. In the past, ISP (In-System Programming) method have been generally used for code update but the large number of sensor nodes requires a new code update method called network reprogramming. There are many challenging issues for network reprogramming since it can make an impact on the network lifetime. In this paper, a new sender selection scheme for network reprogramming protocol is proposed to decrease energy consumption for code update by minimizing overlapped area between sender nodes and reducing data contention. Simulation results show that the proposed scheme can reduce the amount of message traffic and the overall data transmission time.

Modified Passive Clustering Algorithm for Wireless Sensor Network

  • AI Eimon Akhtar Rahman;HONG Choong Seon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07a
    • /
    • pp.427-429
    • /
    • 2005
  • Energy efficiency is the most challenging issue in wireless sensor network to prolong the life time of the network, as the sensors has to be unattended. Cluster based communication can reduce the traffic on the network and gives the opportunity to other sensors for periodic sleep and thus save energy. Passive clustering (PC) can perform a significant role to minimize the network load as it is less computational and light weight. First declaration wins method of PC without any priority generates severe collision in the network and forms the clusters very dense with large amount of overlapping region. We have proposed several modifications for the existing passive clustering algorithm to prolong the life time of the network with better cluster formation.

  • PDF

The Estimation of Link Travel Speed Using Hybrid Neuro-Fuzzy Networks (Hybrid Neuro-Fuzzy Network를 이용한 실시간 주행속도 추정)

  • Hwang, In-Shik;Lee, Hong-Chul
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.26 no.4
    • /
    • pp.306-314
    • /
    • 2000
  • In this paper we present a new approach to estimate link travel speed based on the hybrid neuro-fuzzy network. It combines the fuzzy ART algorithm for structure learning and the backpropagation algorithm for parameter adaptation. At first, the fuzzy ART algorithm partitions the input/output space using the training data set in order to construct initial neuro-fuzzy inference network. After the initial network topology is completed, a backpropagation learning scheme is applied to optimize parameters of fuzzy membership functions. An initial neuro-fuzzy network can be applicable to any other link where the probe car data are available. This can be realized by the network adaptation and add/modify module. In the network adaptation module, a CBR(Case-Based Reasoning) approach is used. Various experiments show that proposed methodology has better performance for estimating link travel speed comparing to the existing method.

  • PDF